A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Peer-to-peer data trading to preserve information
ACM Transactions on Information Systems (TOIS)
Enabling the Archival Storage of Signed Documents
FAST '02 Proceedings of the Conference on File and Storage Technologies
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
| Hi-index | 0.00 |
Opinion Polls can be used as a means to reach weak agreement, an idea introduced by the LOCKSS system [1]. In this paper, we investigate a set of protocols that achieve data resilience for the long-term using a peer-to-peer network, where mutually untrusted peers are loosely organized. Peers use Opinion Polls to heal corrupted copies of data items instead of conventional methods that use consensus algorithms or cryptography to sign data. We give a brief overview of how LOCKSS performs Opinions, improve the current algorithms, and evaluates our protocols in terms of their performance and security against adversary attacks.