Practical robust communication in DHTs tolerating a byzantine adversary

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 263-272

  Young, Maxwell ^a   Kate, Aniket ^a   Goldberg, Ian ^a   Karsten, Martin ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL RESULTS; ASYMPTOTIC NOTATION; BYZANTINE FAULT; COMMUNICATION COST; DATA RETRIEVAL; DISTRIBUTED HASH TABLES; DISTRIBUTED KEY GENERATION; MESSAGE COMPLEXITY; MESSAGE SENDING; MICROBENCHMARKS; PLANETLAB; REAL-WORLD APPLICATION; ROBUST COMMUNICATION; SETUP COSTS; THRESHOLD CRYPTOGRAPHY; TRUSTED THIRD PARTIES;

COSTS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 77955963220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.31     Document Type: Conference Paper

References (50)

1. st Intl. Workshop on Peer-to-Peer Systems, 2002, pp. 261-269.
2. D. S.Wallach, "A Survey of Peer-to-Peer Security Issues," in ISSS, 2002, pp. 253-258.
3. J. Falkner, M. Piatek, J. P. John, A. Krishnamurthy, and T. Anderson, "Profiling a Million User DHT," in IMC, 2007, pp. 129-134.
4. M. Steiner, T. En-Najjary, and E. W. Biersack, "A Global View of KAD," in IMC, 2007, pp. 117-122.
5. R. Geambasu, T. Kohno, A. A. Levy, and H. M. Levy, "Vanish: Increasing Data Privacy with Self-Destructing Data," in USENIX Security Symp., 2009, pp. 299-315.
6. V. Pappas, D. Massey, A. Terzis, and L. Zhang, "A Comparative Study of the DNS Design with DHT-Based Alternatives," in INFOCOM, 2006, pp. 1-13.
7. B. Awerbuch and C. Scheideler, "Towards a Scalable and Robust DHT," in SPAA, 2006, pp. 318-327.
8. -, "Towards Scalable and Robust Overlay Networks," in IPTPS, 2007.
9. -, "Robust Random Number Generation for Peer-to-Peer Systems," in OPODIS, 2006, pp. 275-289.
10. J. Saia and M. Young, "Reducing Communication Costs in Robust Peer-to-Peer Networks," Information Processing Letters, vol. 106(4), pp. 152-158, 2008.
11. A. Fiat, J. Saia, and M. Young, "Making Chord Robust to Byzantine Attacks," in ESA, 2005, pp. 803-814.
12. M. Naor and U. Wieder, "A Simple Fault Tolerant Distributed Hash Table," in IPTPS, 2003, pp. 88-97.
13. K. Hildrum and J. Kubiatowicz, "Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-peer Networks," in DISC, 2004, pp. 321-336.
14. H. Johansen, A. Allavena, and R. van Renesse, "Fireflies: Scalable Support for Intrusion-Tolerant Network Overlays," in OSR, 2006, pp. 3-13.
15. J. Douceur, "The Sybil Attack," in IPTPS, 2002.
16. G. Urdaneta, G. Pierre, and M. van Steen, "A Survey of DHT Security Techniques," ACM Computing Surveys, 2009, to appear.
17. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," in SIGCOMM, 2001, pp. 149-160.
18. M. Young, A. Kate, I. Goldberg, and M. Karsten, "Practical Robust Communication in DHTs Tolerating a Byzantine Adversary," Tech. Rep. CACR 2009-31, 2009, http://www.cacr.math.uwaterloo.ca/techreports/2009/cacr2009-31. pdf.
19. F. B. Schneider, "Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial," ACM Computing Surveys, vol. 22(4), pp. 299-319, 1990.
20. M. K. Reiter, "The Rampart Toolkit for Building High-Integrity Services," in Intl. Workshop on Theory and Practice in Distributed Systems, 1995, pp. 99-110.
21. M. Castro and B. Liskov, "Byzantine Fault Tolerance Can Be Fast," in DSN, 2001, pp. 513-518.
22. C. Cachin and J. Poritz, "Secure Intrusion-tolerant Replication on the Internet," in DSN, 2002, pp. 167-176.
23. A. Adya, W. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. Douceur, J. Howell, J. Lorch, M. Theimer, and R. Wattenhofer, "FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted environment," in OSDI, 2002, pp. 1-14.
24. M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie, "Fault-Scalable Byzantine Fault-Tolerant Services," in SOSP, 2005, pp. 59-74.
25. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira, "HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance," in OSDI, 1999, pp. 177-190.
26. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, W. W. H. Weatherspoon, C. Wells, and B. Zhao, "OceanStore: An Architecture for Global-Scale Persistent Storage," in ASPLOS, 2000, pp. 190-201.
27. R. Rodrigues and B. Liskov, "Rosebud: A Scalable Byzantine-Fault- Tolerant Storage Architecture," MIT LCS, Tech. Rep. TR/932, December 2003.
28. R. Rodrigues, P. Kouznetsov, and B. Bhattacharjee, "Large-Scale Byzantine Fault Tolerance: Safe but Not Always Live," in HotDep, 2007.
29. R. Rodrigues, B. Liskov, and L. Shrira, "The Design of a Robust Peer-to-Peer System," in 10th ACM SIGOPS European Workshop, 117-124, p. 2002.
30. P. Weng, N. Hopper, I. Osipkov, and Y. Kim, "Myrmic: Secure and Robust DHT Routing," University of Minnesota, Tech. Rep. 2006/20, 2006.
31. M. Castro, P.Druschel, A.Ganesh, A. Rowstron, and D.Wallach, "Secure Routing for Structured Peer-to-Peer Overlay Networks," in OSDI, 2002, pp. 299-314.
32. A. Kapadia and N. Triandopoulos, "Halo: High-Assurance Locate for Distributed Hash Tables," in NDSS, 2008.
33. A. Nambiar and M. Wright, "Salsa: A Structured Approach to Large-Scale Anonymity," in CCS, 2006, pp. 17-26.
34. P. Mittal and N. Borisov, "Shadow Walker: Peer-to-peer Anonymous Communication using Redundant Structured Topologies," in CCS, 2009.
35. M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance and Proactive Recovery," ACM Transactions on Computer Systems, vol. 20(4), pp. 398-461, 2002.
36. D. Boneh, B. Lynn, and H. Shacham, "Short Signatures from the Weil Pairing," in ASIACRYPT, 2001, pp. 514-532.
37. P. Feldman, "A Practical Scheme for Non-Interactive Verifiable Secret Sharing," in FOCS, 1987, pp. 427-437.
38. T. P. Pedersen, "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing," in CRYPTO, 1991, pp. 129-140.
39. A. Boldyreva, "Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme," in PKC, 2003, pp. 31-46.
40. A. Kate and I. Goldberg, "Distributed Key Generation for the Internet," in ICDCS, 2009, pp. 119-128.
41. D. Boneh, C. Gentry, B. Lynn, and H. Shacham, "Aggregate and Verifiably Encrypted Signatures from Bilinear Maps," in EUROCRYPT, 2003, pp. 416-432.
42. H. Jiang and C. Dovrolis, "Passive Estimation of TCP Round-Trip Times," CCR, vol. 32, pp. 75-88, 2002.
43. L. Peterson, T. Anderson, D. Culler, and T. Roscoe, "A Blueprint for Introducing Disruptive Technology into the Internet," CCR, vol. 33, no. 1, pp. 59-64, 2003.
44. A. Kate and I. Goldberg, "Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography," Cryptology ePrint Archive, Report 355, 2009.
45. F. Dabek, J. Li, E. Sit, J. Robertson, M. F. Kaashoek, and R. Morris, "Designing a DHT for Low Latency and High Throughput," in NSDI, 2004, pp. 85-98.
46. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling Churn in a DHT," in USENIX Annual Technical Conf., 2004, pp. 127-140.
47. P. K. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan, "Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload," in SOSP, 2003, pp. 314-329.
48. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," in MMCN, 2002, pp. 314-329.
49. S.Guha, N.Daswani, and R. Jain, "An Experimental Study of the Skype Peer-to-Peer VoIP System," in IPTPS, 2006.
50. D. Liben-Nowell, H. Balakrishnan, and D. Karger, "Analysis of the Evolution of Peer-to-Peer Systems," in PODC, 2002, pp. 233-242.