18 citations · 27 across the 7 of their papers we have counts for
7 papers
A Fresh Look at the Reliability of Long-term Digital Storage
Mary Baker, Mehul Shah, David S. H. Rosenthal +4
Many emerging Web services, such as email, photo sharing, and web site archives, need to preserve large amounts of quickly-accessible data indefinitely into the future. In this pap…
Notes On The Design Of An Internet Adversary
David S. H. Rosenthal, Petros Maniatis, Mema Roussopoulos +2
The design of the defenses Internet systems can deploy against attack, especially adaptive and resilient defenses, must start from a realistic model of the threat. This requires an…
Transparent Format Migration of Preserved Web Content
David S. H. Rosenthal, Thomas Lipkis, Thomas Robertson +1
The LOCKSS digital preservation system collects content by crawling the web and preserves it in the format supplied by the publisher. Eventually, browsers will no longer understand…
Attrition Defenses for a Peer-to-Peer Digital Preservation System
T. J. Giuli, Petros Maniatis, Mary Baker +2
In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to…
2 P2P or Not 2 P2P?
Mema Roussopoulos, Mary Baker, David S. H. Rosenthal +3
In the hope of stimulating discussion, we present a heuristic decision tree that designers can use to judge the likely suitability of a P2P architecture for their applications. It…
On The Cost Distribution of a Memory Bound Function
David S. H. Rosenthal
Memory Bound Functions have been proposed for fighting spam, resisting Sybil attacks and other purposes. A particular implementation of such functions has been proposed in which th…