Petros Maniatis
ABSTRACT
The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent web caches that cooperate to detect and repair damage to their content by voting in "opinion polls." Based on this experience, we present a design for and simulations of a novel protocol for voting in systems of this kind. It incorporates rate limitation and intrusion detection to ensure that even some very powerful adversaries attacking over many years have only a small probability of causing irrecoverable damage before being detected.
- M. Abadi, M. Burrows, M. Manasse, and T. Wobber. Moderately Hard, Memory-bound Functions. In 10th Annual Network and Distributed System Security Symp., San Diego, CA, USA, February 2003.]]Google Scholar
- R. J. Anderson. The Eternity Service. In 1st Intl. Conf. on the Theory and Applications of Cryptology, Prague, Czech Republic, 1996.]]Google Scholar
- Assoc. of Research Libraries. ARL Statistics 2000-01. http://www.arl.org/stats/arlstat/01pub/intro.html, 2001.]]Google Scholar
- K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal Multicast. ACM Trans. on Computer Systems, 17(2):41--88, 1999.]] Google ScholarDigital Library
- M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In 3rd Symp. on Operating Systems Design and Implementation, pages 273--287, New Orleans, LA, USA, February 1999.]] Google ScholarDigital Library
- Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos. A Prototype Implementation of Archival Intermemory. In Intl. Conf. on Digital Libraries, pages 28--37, Berkeley, CA, USA, 1999.]] Google ScholarDigital Library
- B. Chor and C. Dwork. Randomization in Byzantine Agreement. Advances in Computing Research, 5:443--497, 1989.]]Google Scholar
- I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Workshop on Design Issues in Anonymity and Unobservability, pages 46--66, Berkeley, CA, USA, July 2000.]] Google ScholarDigital Library
- ConservationOnline. Electronic Storage Media. http://palimpsest.stanford.edu/bytopic/electronic-records/electronic-storage-media/, 2003.]]Google Scholar
- F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area Cooperative Storage with CFS. In 18th ACM Symp. on Operating Systems Principles, pages 202--215, Chateau Lake Louise, Banff, Alberta, Canada, October 2001.]] Google ScholarDigital Library
- D. Davis. Compliance Defects in Public-Key Cryptography. In 6th USENIX Security Symp., pages 171--178, San Jose, CA, USA, July 1996.]] Google ScholarDigital Library
- W. Diffie. Perspective: Decrypting The Secret to Strong Security. http://news.com.com/2010-1071-980462.html, January 2003.]]Google Scholar
- W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Trans. on Information Theory, IT-22(6):644--654, November 1976.]]Google ScholarDigital Library
- R. Dingledine, M. J. Freedman, and D. Molnar. The Free Haven Project: Distributed Anonymous Storage Service. In Workshop on Design Issues in Anonymity and Unobservability, pages 67--95, Berkeley, CA, USA, July 2000.]] Google ScholarDigital Library
- John Douceur. The Sybil Attack. In 1st Intl. Workshop on Peer-to-Peer Systems, pages 251--260, Boston, MA, USA, March 2002.]] Google ScholarDigital Library
- C. Dwork, A. Goldberg, and M. Naor. On Memory-Bound Functions for Fighting Spam. In 23rd Annual Intl. Cryptology Conference, Santa Barbara, CA, USA, August 2003. To appear.]]Google Scholar
- C. Dwork and M. Naor. Pricing via Processing. In Advances on Cryptology (CRYPTO 1992), volume 740 of Lecture Notes in Computer Science, pages 139--147. Springer, 1993.]] Google ScholarDigital Library
- Electronic Frontier Found. DMCA Archive. http://www.eff.org/IP/DMCA/.]]Google Scholar
- M. Erdos and S. Cantor. Shibboleth Architecture DRAFT v05. http://shibboleth.internet2.edu/docs/draft-internet2-shibboleth-arch-v05.pdf, May 2002. Work in progress.]]Google Scholar
- TJ Giuli and M. Baker. Narses: A Scalable, Flow-Based Network Simulator. Technical Report cs.PF/0211024, Computer Science Department, Stanford University, Stanford, CA, USA, November 2002.]]Google Scholar
- M. Keller, V. Reich, and A. Herkovic. What is a Library Anymore, Anyway? First Monday, 8(5), May 2003. http://www.firstmonday.org/issues/issue8_5/keller/index.html.]]Google Scholar
- J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 190--201, Cambridge, MA, USA, November 2000.]] Google ScholarDigital Library
- D. Malkhi and M. Reiter. Byzantine Quorum Systems. J. Distributed Computing, 11(4):203--213, October 1998.]] Google ScholarDigital Library
- P. Maniatis, M. Roussopoulos, TJ~Giuli, D. S. H. Rosenthal, M. Baker, and Y. Muliadi. Preserving Peer Replicas By Rate-Limited Sampled Voting. Technical Report cs.CR/0303026, Stanford Univ., March 2003. Extended version of this SOSP 2003 paper.]] Google ScholarDigital Library
- N. Michalakis, D-M. Chiu, and D. S. H. Rosenthal. Long Term Data Resilience Using Opinion Polls. In 22nd IEEE Intl. Performance Computing and Communications Conference, Phoenix, AZ, USA, April 2003.]]Google Scholar
- D. Mogge. Seven Years of Tracking Electronic Publishing: The ARL Directory of Electronic Journals, Newsletters and Academic Discussion Lists. Library Hi Tech, 17(1):17--25, 1999.]]Google Scholar
- D. Patterson, G. Gibson, and R. Katz. A Case for Redundant Arrays of Inexpensive Disks (RAID). In ACM SIGMOD, pages 109--116, Chicago, IL, USA, June 1988.]] Google ScholarDigital Library
- M. Reiter. Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart. In 2nd ACM Conf. on Computer and Communications Security, pages 68--80, Fairfax, VA, USA, November 1994.]] Google ScholarDigital Library
- D. S. H. Rosenthal. A Digital Preservation Network Appliance Based on OpenBSD. In BSDcon, San Mateo, CA, USA, September 2003. To appear.]] Google ScholarDigital Library
- D. S. H. Rosenthal and V. Reich. Permanent Web Publishing. In USENIX Annual Technical Conf., Freenix Track, pages 129--140, San Diego, CA, USA, June 2000.]] Google ScholarDigital Library
- D. S. H. Rosenthal, M. Roussopoulos, P. Maniatis, and M. Baker. Economic Measures to Resist Attacks on a Peer-to-Peer Network. In Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA, June 2003.]]Google Scholar
- A. Rowstron and P. Druschel. Storage Management and Caching in PAST, A Large-scale, Persistent Peer-to-peer Storage Utility. In 18th ACM Symp. on Operating Systems Principles, pages 188--201, Chateau Lake Louise, Banff, Alberta, Canada, October 2001.]] Google ScholarDigital Library
- S. Staniford, V. Paxson, and N. Weaver. How to 0wn the Internet in Your Spare Time. In 11th USENIX Security Symp., pages 149--167, San Francisco, CA, USA, August 2002.]] Google ScholarDigital Library
- US Govt. Web Design and Usability Guidelines. http://usability.gov/guidelines/softhard.html.]]Google Scholar
- W. Venema. Murphy's Law and Computer Security. In 6th USENIX Security Symp., San Jose, CA, USA, July 1996.]] Google ScholarDigital Library
- M. Waldman and D. Mazieres. Tangler: A Censorship-Resistant Publishing System Based On Document Entanglements. In 8th ACM Conf. on Computer and Communications Security, pages 126--135, Philadelphia, PA, USA, November 2001.]] Google ScholarDigital Library
- M. Williamson. Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code. In 18th Annual Computer Security Applications Conf., Las Vegas, Nevada, USA, December 2002.]] Google ScholarDigital Library
- N. Wingfield. EBay's Figurine Scandal: Auction Site Merchant Disappears With The Goods. Wall Street J., Feb 22nd, 2002.]]Google Scholar
Index Terms
- Preserving peer replicas by rate-limited sampled voting
Recommendations
Preserving peer replicas by rate-limited sampled voting
SOSP '03The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent web caches ...
The LOCKSS peer-to-peer digital preservation system
The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost, persistent Web caches ...
Preserving digital information forever
DL '00: Proceedings of the fifth ACM conference on Digital librariesWell within our lifetime we can expect to see most information being created, stored and used digitally. Despite the growing importance of digital data, the wider community pays almost no attention to the problems of preserving this digital information ...
Comments