{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:33:23Z","timestamp":1767108803664},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/tnet.2012.2195729","type":"journal-article","created":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T19:02:08Z","timestamp":1360695728000},"page":"190-203","source":"Crossref","is-referenced-by-count":15,"title":["Towards Practical Communication in Byzantine-Resistant DHTs"],"prefix":"10.1109","volume":"21","author":[{"given":"Maxwell","family":"Young","sequence":"first","affiliation":[]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Karsten","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1174","article-title":"Pollution in P2P file sharing systems","volume":"2","author":"liang","year":"2005","journal-title":"Proc IEEE InfoCom"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1096166.1096174"},{"key":"ref33","first-page":"61","article-title":"Halo: High-assurance locate for distributed hash tables","author":"kapadia","year":"2008","journal-title":"Proc NDSS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217937"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/571697.571725"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MDSO.2005.31"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0099-z"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.21"},{"key":"ref34","author":"kate","year":"2009","journal-title":"Asynchronous distributed private-key generators for identity-based cryptography"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964723.383071","article-title":"Chord: A scalable peer-to-peer lookup service for Internet applications","author":"stoica","year":"2001","journal-title":"Proc ACM Sigcomm"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.207"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1883612.1883615"},{"key":"ref63","first-page":"253","article-title":"A survey of peer-to-peer security issues","author":"wallach","year":"2002","journal-title":"Proc Int Conf Softw Security Theories Syst"},{"key":"ref28","first-page":"514","article-title":"Short signatures from the Weil pairing","author":"boneh","year":"2001","journal-title":"Proc 9th Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref64","author":"weng","year":"2006","journal-title":"Myrmic Secure and Robust Dht Routing"},{"key":"ref27","first-page":"321","article-title":"Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks","author":"hildrum","year":"2004","journal-title":"Proc DISCEX"},{"key":"ref65","author":"young","year":"2009","journal-title":"Practical robust communication in DHTs tolerating a Byzantine adversary"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.31"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"ref2","author":"adar","year":"2000","journal-title":"Free Riding on Gnutella"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095817"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref21","first-page":"803","article-title":"Making chord robust to Byzantine attacks","author":"fiat","year":"2005","journal-title":"Proc Eur Symp Algor"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2000.899694"},{"key":"ref23","first-page":"299","article-title":"Vanish: Increasing data privacy with self-destructing data","author":"geambasu","year":"2009","journal-title":"Proc Usenix Security Symp"},{"key":"ref26","first-page":"2","article-title":"One hop lookups for peer-to-peer overlays","author":"gupta","year":"2003","journal-title":"Proc Hot Topics Oper Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/945472.945475"},{"key":"ref50","article-title":"Large-scale Byzantine fault tolerance: Safe but not always live","author":"rodrigues","year":"2007","journal-title":"Proc HotDep"},{"key":"ref51","author":"rodrigues","year":"2003","journal-title":"Rosebud A scalable Byzantine-fault-tolerant storage architecture"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2009053"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298323"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-45748-8_25","article-title":"Security considerations for peer-to-peer distributed hash tables","author":"sit","year":"2002","journal-title":"Proc Int Workshop Peer-to-Peer Syst"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2146382.2146389"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"ref54","first-page":"314","article-title":"A measurement study of peer-to-peer file sharing systems","author":"saroiu","year":"2002","journal-title":"Proc MMCN"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.11.004"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1133373.1133396"},{"key":"ref10","first-page":"416","article-title":"Aggregate and verifiably encrypted signatures from bilinear maps","author":"boneh","year":"2003","journal-title":"Proc EUROCRYPT"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400772"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.232"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2002.1028897"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060317"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2001.941437"},{"key":"ref15","first-page":"177","article-title":"HQ replication: A hybrid quorum protocol for Byzantine fault tolerance","author":"cowling","year":"1999","journal-title":"Proceedings of Operating System Design and Implementation"},{"key":"ref16","first-page":"85","article-title":"Designing a DHT for low latency and high throughput","author":"dabek","year":"2004","journal-title":"Proc Symp Netw Syst Design Implement"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","article-title":"The Sybil attack","author":"douceur","year":"2002","journal-title":"Proc Int Workshop Peer-to-Peer Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064218"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298325"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77096-1_32"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060291"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_20"},{"key":"ref5","first-page":"183","article-title":"Group spreading: A protocol for provably secure distributed name service","author":"awerbuch","year":"2004","journal-title":"Proc 9th Colloq Automata Lang Program"},{"key":"ref8","article-title":"Towards scalable and robust overlay networks","author":"awerbuch","year":"2007","journal-title":"Proc Int Workshop Peer-to-Peer Syst"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/1148109.1148163","article-title":"Towards a scalable and robust DHT","author":"awerbuch","year":"2006","journal-title":"Proc SPAA"},{"key":"ref49","first-page":"127","article-title":"Handling churn in a DHT","author":"rhea","year":"2004","journal-title":"Proc Usenix Tech Conf"},{"key":"ref9","first-page":"31","article-title":"Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme","author":"boldyreva","year":"2003","journal-title":"Proc PKC"},{"key":"ref46","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","author":"pedersen","year":"1991","journal-title":"Proc Crypto"},{"key":"ref45","first-page":"51","article-title":"How to withstand mobile virus attacks (Ext. abstract)","author":"ostrovsky","year":"1991","journal-title":"Proc PODC"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-60042-6_7","article-title":"The Rampart toolkit for building high-integrity services","author":"reiter","year":"1995","journal-title":"Proc Int Workshop Theory Practice Distrib Syst"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774772"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653683"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571863"},{"key":"ref44","first-page":"88","article-title":"A simple fault tolerant distributed hash table","author":"naor","year":"2003","journal-title":"Proc Int Workshop Peer-to-Peer Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180409"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6461135\/06196191.pdf?arnumber=6196191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T21:23:37Z","timestamp":1714944217000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6196191\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":66,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2012.2195729","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}