MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Probabilistic Quorum Systems (2001) [308 citations — 44 self]

Abstract:

this paper, we also explore relaxing the intersection properties of these quorums, to achieve (b; ")-dissemination and (b; ")-masking systems. Again, we show that these systems oer substantial improvements over their strict counterparts in the measures described above. 1.1. Applications Due to their relaxed intersection properties, our probabilistic quorums are most suitable for use when the consistency of replicated data may be relaxed to achieve greater availability of that data. Below we describe several examples of applications where this tradeo is justied. The rst application arose in the context of an electronic voting system designed by AT&T Labs for the country of Costa Rica. In this system, each voter is given a unique voter identier when she registers to vote. On election day, she presents PROBABILISTIC QUORUMS 3 this voter ID to any one of over 1000 voting stations spread across the country in order to cast her vote. To prevent a voter ID from being used multiple times in one election, it is necessary to \lock" each voter ID country-wide when it is presented at any voting station. In order to preserve the integrity of the election, it is only necessary to prevent large-scale repeat voting. Therefore, it suces for each repeated use of the same voter ID to be detected with high probability, so numerous repeat attempts will be detected with virtual certainty. We thus adopted a protocol among voting stations that uses probabilistic quorums for this purpose. Moreover, by using our dissemination or masking quorum constructions in the locking protocol, repeat usage of a voter ID can be prevented even if some number of voting stations do not follow the locking protocol (e.g., some stations have been altered by bribed election ocials). At the same time, the u...

Citations

6121 Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
2091 A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1997
1320 Concurrency Control and Recovery in Database Systems – Bernstein, Hadzilacos, et al. - 1987
1143 Transaction Processing: Concepts and Techniques – Gray, Reuter - 1993
1072 How to Share a Secret – Shamir - 1979
1028 System architecture directions for network sensors – Hill, Szewczyk, et al. - 2000
867 The Byzantine Generals Problem – Lamport, Shostak, et al. - 1982
813 Myrinet: A gigabit-per-second local area network – Boden, Cohen, et al. - 1995
600 Transmission Control Protocol – Postel - 1981
589 Implementing fault-tolerant services using the state machine approach: a tutorial – Schneider - 1990
456 Weighted voting for replicated data – Gifford - 1979
377 Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance – Rabin - 1989
373 Practical Byzantine Fault Tolerance – Castro, Liskov - 1999
351 Authentication in distributed systems: Theory and practice – LAMPSON, ABADI, et al. - 1992
272 A.: A digital fountain approach to reliable distribution of bulk data – Byers, Luby, et al. - 1998
262 A Majority Consensus Approach to Concurrency Control – Thomas - 1979
182 A pn algorithm for mutual exclusion in decentralized systems – Maekawa - 1985
172 Rover: A toolkit for mobile information access – Joseph, deLespinasse, et al. - 1995
167 The bayou architecture: Support for data sharing among mobile users – Demers - 1994
160 How to assign votes in a distributed system – Garcia-Molina, Barbara - 1985
153 Secure Agreement Protocols: Reliable and Atomic Group Multicast in Rampart – Reiter - 1994
124 Replication Methods for Abstract Data Types – Herlihy - 1984
118 Atomic snapshots of shared memory – Afek, Attiya, et al. - 1993
117 Autonet: A high-speed self configuring local area network using point-to-point links – Schroeder, Birrell, et al. - 1990
116 Asynchronous consensus and broadcast protocols – Bracha, Toueg - 1985
113 The Rampart Toolkit for building high-integrity Services," Theory and – Reiter - 1995
112 Measuring the capacity of a web server – Banga, Druschel - 1997
112 On interprocess communication – Lamport - 1985
109 Proactive Recovery in a Byzantine-Fault-Tolerant System – Castro, Liskov - 2000
101 The grid protocol: A high performance scheme for maintaining replicated data – Cheung, Ammar, et al. - 1992
89 Composite registers – Anderson - 1993
88 Availability in Partitioned Replicated Databases – Abbadi, Toueg - 1986
80 Hierarchical quorum consensus: A new algorithm for managing replicated data – Kumar - 1991
79 End-to-end wan service availability – Chandra, Dahlin, et al. - 2001
75 Sharing memory robustly in message-passing systems – Attiya, Bar-Noy, et al. - 1995
71 Secure and scalable replication in phalanx – Malkhi, Reiter - 1998
69 The Load, capacity and availability of quorum systems – Naor, Wool - 1994
63 An efficient and fault-tolerant solution for distributed mutual exclusion – Agrawal, El-Abbadi - 1991
61 SPX: Global Authentication using public key certificates – Tardo, Alagappan - 1992
61 using abstraction to improve fault tolerance – Base - 2001
60 The case for packet level FEC – HUITEMA - 1996
59 Internet Privacy Enhanced mail – Kent - 1993
51 The reliability of vote mechanisms – Barbara, Garcia-Molina - 1987
50 On interprocess communication; part II: Algorithms – Lamport - 1986
49 Coverings and colorings of hypergraphs – Lov'asz - 1973
49 Tolerating failures of continuous-valued sensors – Marzullo - 1990
44 A.: Efficient Program Transformations for Resilient Parallel Computation via Randomization – Kedem, Palem, et al. - 1992
43 Bounded concurrent time-stamp systems are constructible – Dolev, Shavit - 1989
43 The load and availability of Byzantine quorum systems – Malkhi, Reiter, et al. - 1997
41 How to make replicated data secure – Herlihy, Tygar - 1987
View or Download | Add to My Collection | Correct Errors