pith. sign in

arxiv: cs/0303026 · v3 · submitted 2003-03-25 · 💻 cs.DC · cs.DL

Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

classification 💻 cs.DC cs.DL
keywords votingdamagelocksspreservingaccessadversariesarchivalattacking
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.