Group spreading: A protocol for provably secure distributed name service

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 183-195

  Awerbuch, Baruch ^a   Scheideler, Christian ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BYZANTINE ATTACKS; BYZANTINE PEERS; DISTRIBUTED NAME SERVICE; PROVABLY SECURE; RANDOM DISTRIBUTION;

OVERLAY NETWORKS;

EID: 35048895724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_18     Document Type: Article

References (18)

1. B. Awerbuch and C. Scheideler. Robust distributed name service. In Proc. of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
2. R. Canetti, R. Gennaro, A. Herzberg, and D. Naor. Proactive security: Long-term protection against break-ins. RSA CryptoBytes, 3(1):1-8, 1997.
3. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proc. of the 5th Usenix Symp. on Operating Systems Design and Implementation (OSDI), 2002.
4. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation (OSDI), 1999.
5. S. Crosby and D. Wallach. Denial of service via algorithmic complexity attacks. In Usenix Security, 2003.
6. J. R. Douceur. The sybil attack. In Proc. of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
7. P. Druschel and A. Rowstron. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001.
8. A. Fiat and J. Saia. Censorship resistant peer-to-peer content addressable networks. In Proc. of the 13th ACM Symp. on Discrete Algorithms (SODA), 2002.
9. Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Optimal resilience proactive public-key cryptosystems. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pages 384-393, 1997.
10. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In Proc. of the ACM Conference on Computer and Communications Security (CCS), pages 100-110, 1997.
11. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or: How to cope with perpetual leakage. In CRYPTO '95, pages 339-352, 1995.
12. L. Lamport. The weak Byzantine generals problem. Journal of the ACM, 30(3):669-676, 1983.
13. L. Lamport and N. Lynch. Distributed computing. Chapter of Handbook on Theoretical Computer Science. Also, to be published as Technical Memo MIT/LCS/TM-384, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1989.
14. M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach. In Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2003.
15. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. of the 10th ACM Symp. on Principles of Distributed Computing (PODC), pages 51-59, 1991.
16. R. De Prisco, B. W. Lampson, and N. Lynch. Revisiting the Paxos algorithm. In Workshop on Distributed Algorithms, pages 111-125, 1997.
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 Proc. of the ACM SIGCOMM '01, 2001.
18. B.Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, University of California at Berkeley, Computer Science Department, 2001.