Preserving peer replicas by rate-limited sampled voting

@inproceedings{Maniatis2003PreservingPR,
  title={Preserving peer replicas by rate-limited sampled voting},
  author={Petros Maniatis and David Stuart Holmes Rosenthal and Mema Roussopoulos and Mary Baker and Tj Giuli and Yanto Muliadi},
  booktitle={SOSP '03},
  year={2003}
}
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… 

Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

The LOCKSS project presents a design for and simulations of a novel protocol for voting in systems of this kind that 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.

The LOCKSS peer-to-peer digital preservation system

The LOCKSS project presents a design for and simulations of a novel protocol for voting in systems of this kind that 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.

Economic Measures to Resist Attacks on a Peer-to-Peer Network

A set of techniques are described that enable a large population of autonomous peers to resist attack by a substantial minority of malign peers endowed with unlimited computational resources in the LOCKSS system.

Stealth modification versus nuisance attacks in the LOCKSS peer-to-peer digital preservation system

This paper identifies and characterize a fundamental tradeoff in the LOCKSS system’s ability to defend against adversaries with competing goals, and shows that with a simple change to the design of the system's preservation protocol, it is able to create moderately strong defense against both of these competing adversaries simultaneously.

Defending a P2P digital preservation system

A more accurate view of how the LOCKSS network will perform over time is developed by simulating the system's behavior using dynamic models in which peers can be subverted and repaired, including ripple healing, which performs remarkably well.

Attrition Defenses for a Peer-to-Peer Digital Preservation System

This work describes several defenses for the LOCKSS peer-to-peer digital preservation system that help ensure that application-level attrition attacks even from powerful adversaries are less effective than simple network-level attacks, and that network- level attacks must be intense, widespread, and prolonged to impair the system.

Ensuring Content Integrity for Untrusted Peer-to-Peer Content Distribution Networks

Repeat and Compare is presented, a system for ensuring content integrity in untrusted peer-to-peer CDNs even when replicas dynamically generate content, and quantifies its detection guarantees through probabilistic analysis and shows that a small sample of forwarded records is sufficient to effectively and promptly cleanse a CDN, even if large fractions of replicas or verifiers are misbehaving.

Detecting Reputation Variations in P 2 P Networks

RMM provides resistance to attacks by colluding peers by continually monitoring the reputation level of each peer over a number of consecutive time periods or epochs and observes rapid changes in the reputation value of a node.

A Review of Techniques to Mitigate Sybil Attacks

The different kinds of Sybil attacks including those occurring in peer-to-peer reputation systems, self-organising networks and even social network systems are discussed, along with their modus operandi.

A Permissioned Distributed Ledger for Monitoring Web Content

The design of Watchdog is presented, a permissioned distributed ledger that securely and reliably monitors and preserves dynamic web content such as government and news sites and achieves Byzantine fault-tolerance via a novel interactive consistency algorithm that offers a twist on the traditional definition and use of interactive consistency.
...

References

SHOWING 1-10 OF 71 REFERENCES

Preserving Peer Replicas By Rate-Limited Sampled Voting in LOCKSS

The LOCKSS project presents a design for and simulations of a novel protocol for voting in systems of this kind that 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.

Economic Measures to Resist Attacks on a Peer-to-Peer Network

A set of techniques are described that enable a large population of autonomous peers to resist attack by a substantial minority of malign peers endowed with unlimited computational resources in the LOCKSS system.

Permanent Web Publishing

LOCKSS (Lots Of Copies Keep Stuff Safe) is a prototype of a system to preserve access to scientific journals published on the Web that, unlike normal systems, has far more replicas than would be required just to survive the anticipated failures.

Long-term data resilience using opinion polls

  • N. MichalakisD. ChiuD. Rosenthal
  • Computer Science, Mathematics
    Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003.
  • 2003
A set of protocols based on those of LOCKSS are investigated that achieve data resilience for the long-term using a peer-to-peer network, where mutually untrusted peers are loosely organized.

The Sybil Attack

It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.

The Free Haven Project: Distributed Anonymous Storage Service

A design for a system of anonymous storage which resists the attempts of powerful adversaries to find or destroy any stored data is presented, and a way to classify anonymous systems based on the kinds of anonymity provided is suggested.

Tangler: a censorship-resistant publishing system based on document entanglements

The design of a censorship-resistant system that employs a unique document storage mechanism designed to eject non-compliant servers and prevent them from doing more harm than good is described.

Proactive recovery in a Byzantine-fault-tolerant system

An asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors, and is the first to recover Byzantine-faulty replicas proactively, which performs well because it uses symmetric rather than public-key cryptography for authentication.

Freenet: A Distributed Anonymous Information Storage and Retrieval System

We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet

How to Own the Internet in Your Spare Time

This work develops and evaluates several new, highly virulent possible techniques: hit-list scanning, permutation scanning, self-coordinating scanning, and use of Internet-sized hit-lists (which creates a flash worm).
...