Skip to main content

Naming and Integrity: Self-Verifying Data in Peer-to-Peer Systems

  • Chapter
  • First Online:
Future Directions in Distributed Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2584))

Abstract

Today’s exponential growth in network bandwidth, storage capacity, and computational resources has inspired a whole new class of distributed, peer-to-peer storage infrastructrues. Systems such as Farsite [26.4], Freenet [26.6], Intermemory [26.5], OceanStore [26.10], CFS [26.7], and PAST [26.8] seek to capitalize on the rapid growth of resources to provide inexpensive, highly-available storage without centralized servers. The designers of these systems propose to achieve high availability and long-term durability, in the face of individual component failures, through replication and coding techniques.

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

Access this chapter

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. N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. Stern. Scalable secure storage when half the system is faulty. In International Colloquium on Automata, Languages and Programming, pages 576–587, 2000.

    Google Scholar 

  2. R. Anderson. The eternity service. In Proc. of Pragocrypt, 1996.

    Google Scholar 

  3. J. Bloemer at el. An XOR-based erasure-resilient coding scheme. Technical Report TR-95-048, ICSI, Berkeley, CA, 1995.

    Google Scholar 

  4. W. Bolosky et al. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of Sigmetrics, June 2000.

    Google Scholar 

  5. Y. Chen at el. Prototype implementation of archival intermemory. In Proc. of IEEE ICDE, pages 485–495, Feb. 1996.

    Google Scholar 

  6. I. Clark, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proc. of the Design Issues in Anonymity and Unobservability, pages 311–320, Berkeley, CA, July 2000.

    Google Scholar 

  7. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of SOSP, October 2001.

    Google Scholar 

  8. P. Druschel and A. Rowstron. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. of SOSP, 2001.

    Google Scholar 

  9. H. Krawczyk. Distributed fingerprints and secure information dispersal. In Proc. of PODC Symp., pages 207–218, 1993.

    Google Scholar 

  10. J. Kubiatowicz et al. Oceanstore: An architecture for global-scale persistent storage. In Proc. of ASPLOS, 2000.

    Google Scholar 

  11. P. Maniatis and M. Baker. Enabling the archival storage of signed documents. In Proc. of USENIX File and Storage Technologies FAST, 2002.

    Google Scholar 

  12. R. Merkle. A digital signature based on a conventional encryption function. In Proc. of CRYPTO, pages 369–378. Springer-Verlag, 1988.

    Google Scholar 

  13. NIST. FIPS 186 digital signature standard. May 1994.

    Google Scholar 

  14. D. Patterson, G. Gibson, and R. Katz. The case for raid: Redundant arrays of inexpensive disks, May 1988.

    Google Scholar 

  15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable contentaddressable network. In Proc. of SIGCOMM. ACM, August 2001.

    Google Scholar 

  16. 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 SIGCOMM.ACM,August 2001.

    Google Scholar 

  17. M. Stonebraker. The design of the Postgres storage system. In Proc. of Intl. Conf. on VLDB, Sept. 1987.

    Google Scholar 

  18. H. Weatherspoon and J. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proc. of IPTPS, Mar. 2002.

    Google Scholar 

  19. B. Zhao, A. Joseph, and J. Kubiatowicz. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Weatherspoon, H., Wells, C., Kubiatowicz, J.D. (2003). Naming and Integrity: Self-Verifying Data in Peer-to-Peer Systems. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds) Future Directions in Distributed Computing. Lecture Notes in Computer Science, vol 2584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37795-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-37795-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00912-2

  • Online ISBN: 978-3-540-37795-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics