Making chord robust to byzantine attacks. Fiat, A., Saia, J., & Young, M. 2005. ![Making chord robust to byzantine attacks [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4\textendashε)z Byzantine peers in the network for a fixed ε > 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of \textquotedblleftproper behavior\textquotedblright such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.
@conference {Fiat05makingchord,
title = {Making chord robust to byzantine attacks},
booktitle = {In Proc. of the European Symposium on Algorithms (ESA},
year = {2005},
pages = {803{\textendash}814},
publisher = {Springer},
organization = {Springer},
abstract = {Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4{\textendash}ε)z Byzantine peers in the network for a fixed ε > 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of {\textquotedblleft}proper behavior{\textquotedblright} such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.},
keywords = {Chord, distributed hash table, robustness},
doi = {10.1007/11561071},
url = {http://www.springerlink.com/content/422llxn7khwej72n/},
author = {Amos Fiat and Jared Saia and Maxwell Young}
}
Downloads: 0
{"_id":"n4dn73A7noZaeTyL7","bibbaseid":"fiat-saia-young-makingchordrobusttobyzantineattacks-2005","downloads":0,"creationDate":"2018-07-03T04:50:28.696Z","title":"Making chord robust to byzantine attacks","author_short":["Fiat, A.","Saia, J.","Young, M."],"year":2005,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Making chord robust to byzantine attacks","booktitle":"In Proc. of the European Symposium on Algorithms (ESA","year":"2005","pages":"803\\textendash814","publisher":"Springer","organization":"Springer","abstract":"Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4\\textendashε)z Byzantine peers in the network for a fixed ε > 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of \\textquotedblleftproper behavior\\textquotedblright such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.","keywords":"Chord, distributed hash table, robustness","doi":"10.1007/11561071","url":"http://www.springerlink.com/content/422llxn7khwej72n/","author":[{"firstnames":["Amos"],"propositions":[],"lastnames":["Fiat"],"suffixes":[]},{"firstnames":["Jared"],"propositions":[],"lastnames":["Saia"],"suffixes":[]},{"firstnames":["Maxwell"],"propositions":[],"lastnames":["Young"],"suffixes":[]}],"bibtex":"@conference {Fiat05makingchord,\n\ttitle = {Making chord robust to byzantine attacks},\n\tbooktitle = {In Proc. of the European Symposium on Algorithms (ESA},\n\tyear = {2005},\n\tpages = {803{\\textendash}814},\n\tpublisher = {Springer},\n\torganization = {Springer},\n\tabstract = {Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4{\\textendash}ε)z Byzantine peers in the network for a fixed ε > 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of {\\textquotedblleft}proper behavior{\\textquotedblright} such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.},\n\tkeywords = {Chord, distributed hash table, robustness},\n\tdoi = {10.1007/11561071},\n\turl = {http://www.springerlink.com/content/422llxn7khwej72n/},\n\tauthor = {Amos Fiat and Jared Saia and Maxwell Young}\n}\n","author_short":["Fiat, A.","Saia, J.","Young, M."],"key":"Fiat05makingchord","id":"Fiat05makingchord","bibbaseid":"fiat-saia-young-makingchordrobusttobyzantineattacks-2005","role":"author","urls":{"Paper":"http://www.springerlink.com/content/422llxn7khwej72n/"},"keyword":["Chord","distributed hash table","robustness"],"downloads":0},"search_terms":["making","chord","robust","byzantine","attacks","fiat","saia","young"],"keywords":["chord","distributed hash table","robustness"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}