Distributed hash table: Difference between revisions

Revision as of 23:59, 5 September 2024

Revision as of 00:01, 6 September 2024

Line 115:

https://pdos.csail.mit.edu/papers/whanau-nsdi10.pdf {{Webarchive|url=https://web.archive.org/web/20220125025128/https://pdos.csail.mit.edu/papers/whanau-nsdi10.pdf |date=2022-01-25 }}</ref>

Petar Maymounkov, one of the original authors of [[Kademlia]], has proposed a way to circumvent the weakness to the Sybil attack by incorporating social trust relationships into the system design.<ref>{{Cite journal |last=Lesniewski-Laas |first=Chris |date=2008-04-01 |title=A Sybil-proof one-hop DHT |url=https://dl.acm.org/doi/10.1145/1435497.1435501 |journal=Proceedings of the 1st Workshop on Social Network Systems |series=SocialNets '08 |___location=New York, NY, USA |publisher=Association for Computing Machinery |pages=19–24 |doi=10.1145/1435497.1435501 |isbn=978-1-60558-124-8}}</ref> The new system, codenamed Tonika or also known by its ___domain name as 5ttt, is based on an algorithm design known as "electric routing" and co-authored with the mathematician Jonathan Kelner.<ref>{{citeCite journal |authorlast=Kelner |first=Jonathan Kelner,|last2=Maymounkov |first2=Petar Maymounkov|date=2011-07-22 |title=Electric routing and concurrent flow cutting |url=https://archivelinkinghub.orgelsevier.com/detailsretrieve/arxiv-0909.2859pii/S0304397510003476 |arxivjournal=0909.2859Theoretical Computer Science |bibcodeseries=2009arXiv0909.2859KAlgorithms and Computation |yearvolume=2009412 |issue=32 |pages=4123–4135 |doi=10.1016/j.tcs.2010.06.013 |issn=0304-3975}}</ref> Maymounkov has now undertaken a comprehensive implementation effort of this new system. However, research into effective defences against Sybil attacks is generally considered an open question, and wide variety of potential defences are proposed every year in top security research conferences.{{Citation needed|date=May 2020}}

== Implementations ==