Skip to main content
SpringerLink
Log in

Robust Distributed Name Service

  • Conference paper
Peer-to-Peer Systems III (IPTPS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3279))

Included in the following conference series:

Abstract

This paper suggests a method called Trust-but-Verify that, under certain simplifying assumptions, provides robust distributed name service even under massive adversarial attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awerbuch, B., Scheideler, C.: Enforced Spreading: An improved protocol for provably secure distributed name service. Technical report, Johns Hopkins University (February 2004)

    Google Scholar 

  2. Awerbuch, B., Scheideler, C.: Group Spreading: A protocol for provably secure distributed name service. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 183–195. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Canetti, R., Gennaro, R., Herzberg, A., Naor, D.: Proactive security: Long-term protection against break-ins. RSA CryptoBytes 3(1), 1–8 (1997)

    Google Scholar 

  4. Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure routing for structured peer-to-peer overlay networks. In: Proc. of the 5th Usenix Symp. on Operating Systems Design and Implementation, OSDI (2002)

    Google Scholar 

  5. Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation, OSDI (1999)

    Google Scholar 

  6. Crosby, S., Wallach, D.: Denial of service via algorithmic complexity attacks. In: Usenix Security (2003)

    Google Scholar 

  7. Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Druschel, P., Rowstron, A.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proc. of the 13th ACM Symp. on Discrete Algorithms, SODA (2002)

    Google Scholar 

  10. Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public-key cryptosystems. In: Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 384–393 (1997)

    Google Scholar 

  11. Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., Yung, M.: Proactive public key and signature systems. In: Proc. of the ACM Conference on Computer and Communications Security (CCS), pp. 100–110 (1997)

    Google Scholar 

  12. Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)

    Google Scholar 

  13. Lamport, L.: The weak Byzantine generals problem. Journal of the ACM 30(3), 669–676 (1983)

    Article  MathSciNet  Google Scholar 

  14. Lamport, L., Lynch, N.: Distributed computing. Chapter of Handbook on Theoretical Computer Science. Also, to be published as Technical MemoMIT/LCS/TM- 384, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA (1989)

    Google Scholar 

  15. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuousdiscrete approach. In: Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA (2003)

    Google Scholar 

  16. Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proc. of the 10th ACM Symp. on Principles of Distributed Computing (PODC), pp. 51–59 (1991)

    Google Scholar 

  17. De Prisco, R., Lampson, B.W., Lynch, N.: Revisiting the Paxos algorithm. In: Workshop on Distributed Algorithms, pp. 111–125 (1997)

    Google Scholar 

  18. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM 2001 (2001)

    Google Scholar 

  19. Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical report, University of California at Berkeley, Computer Science Department (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD, 21218, USA

    Baruch Awerbuch & Christian Scheideler

Authors
  1. Baruch Awerbuch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Scheideler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Dr., MC 0114, 92093-0114, La Jolla, CA, USA

    Geoffrey M. Voelker

  2. UC Berkeley and ICSI,  

    Scott Shenker

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Awerbuch, B., Scheideler, C. (2005). Robust Distributed Name Service. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30183-7_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24252-9

  • Online ISBN: 978-3-540-30183-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation