| Byzantine quorum systems |
| Full text |
Pdf
(1.62 MB)
|
| Source
|
Annual ACM Symposium on Theory of Computing
archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
table of contents
El Paso, Texas, United States
Pages: 569 - 578
Year of Publication: 1997
ISBN:0-89791-888-6
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 80, Citation Count: 22
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Yehuda Afek , Hagit Attiya , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit, Atomic snapshots of shared memory, Journal of the ACM (JACM), v.40 n.4, p.873-890, Sept. 1993
[doi> 10.1145/153724.153741]
|
| |
2
|
Yehuda Afek , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit, A bound first-in, first-enabled solution to the 1-exclusion problem, Proceedings of the 4th international workshop on Distributed algorithms, p.422-432, June 1991, Bari, Italy
|
| |
3
|
|
 |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
International Telegraph and Telephone Consultative Committee (CCITT). The Directory- Authentication Framework, Recommendation X.509, 1988.
|
 |
11
|
Danny Dolev , Eli Gafni , Nir Shavit, Toward a non-atomic era: l-exclusion as a test case, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.78-92, May 02-04, 1988, Chicago, Illinois, United States
[doi> 10.1145/62212.62220]
|
 |
12
|
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
| |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
|
| |
20
|
|
 |
21
|
|
 |
22
|
|
 |
23
|
|
| |
24
|
L. Lamport. On interprocess communication (part II: algorithms). Distributed Computing 1:86-101, 1986.
|
 |
25
|
|
 |
26
|
|
| |
27
|
|
| |
28
|
D. Malkhi, M. Ratter and A. Wool. Optima{ Byzantine quorum systems. Submitted for publication, January 1997.
|
| |
29
|
|
| |
30
|
M. Nw0r and A. Wool. The load, capacity, and availability of quorum systems. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 214-225, 1994.
|
 |
31
|
|
 |
32
|
|
 |
33
|
|
 |
34
|
|
 |
35
|
|
 |
36
|
|
| |
37
|
J. J. Tardo and K. Alagappan. SPX: Global authentication using public key certificates. In Proceedings of the 1991 IEEE Symposium on Research in Security and Privacy, pages 232-244, May 1991.
|
 |
38
|
|
 |
39
|
|
CITED BY 22
|
Hyunyoung Lee , Jennifer L. Welch, Specification, implementation and application of randomized regular registers (brief announcement), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.338, July 16-19, 2000, Portland, Oregon, United States
|
|
|
|
Qunwei Zheng , Sibabrata Ray , Xiaoyan Hong , Lei Tang , Li Gao, Integrity and its applications, Proceedings of the 45th annual southeast regional conference, March 23-24, 2007, Winston-Salem, North Carolina
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dahlia Malkhi , Michael Reiter , Rebecca Wright, Probabilistic quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.267-273, August 21-24, 1997, Santa Barbara, California, United States
|
|
Haixun Wang , Jian Yin , Chang-shing Perng , Philip S. Yu, Dual encryption for query integrity assurance, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
|
|
|
|
|
|
Flavio Junqueira , Ranjita Bhagwan , Alejandro Hevia , Keith Marzullo , Geoffrey M. Voelker, Surviving internet catastrophes, Proceedings of the USENIX Annual Technical Conference 2005 on USENIX Annual Technical Conference, p.4-4, April 10-15, 2005, Anaheim, CA
|
|
|
|
|
|
|
|
Dahlia Malkhi , Michael Reiter , Avishai Wool, The load and availability of Byzantine quorum systems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, p.249-257, August 21-24, 1997, Santa Barbara, California, United States
|
|
|
|
|
Atul Singh , Pedro Fonseca , Petr Kuznetsov , Rodrigo Rodrigues , Petros Maniatis, Zeno: eventually consistent Byzantine-fault tolerance, Proceedings of the 6th USENIX symposium on Networked systems design and implementation, p.169-184, April 22-24, 2009, Boston, Massachusetts
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|