Optimally efficient multi-valued byzantine agreement

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 163-168

  Fitzi, Matthias ^a   Hirt, Martin ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b ETH ZURICH   (Switzerland)

Author keywords

Byzantine agreement; Communication complexity; Cryptographic security; Information theoretic security

Indexed keywords

BROADCASTING; COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; PARAMETER ESTIMATION; SECURITY OF DATA;

BYZANTINE AGREEMENT; COMMUNICATION COMPLEXITY; CRYPTOGRAPHIC SECURITY; INFORMATION-THEORETIC SECURITY;

NETWORK PROTOCOLS;

EID: 33748676639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146407     Document Type: Conference Paper

References (15)

1. [BGP92] P. Berman, J. A. Garay, and K. J. Perry. Bit optimal distributed consensus. Computer Science Research, pp. 313-322, 1992.
2. Preliminary version appeared in STOC '89.
3. [CR90] D. Chaum and S. Roijakkers. Unconditionally secure digital signatures. In CRYPTO '90, LNCS 537, pp. 206-214. Springer, 1990.
4. [CW79] L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences (JCSS), 18(4): 143-154, 1979.
5. Preliminary version appeared in STOC '77.
6. [CW92] B. A. Coan and J. L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, Mar. 1992.
7. Preliminary version appeared in PODC '89.
8. [DR85] D. Dolev and R. Reischuk. Bounds on information exchange for Byzantine agreement. Journal of the ACM, 32(1):191-204, Jan. 1985.
9. [DS83] D. Dolev and H. R. Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, Nov. 1983.
10. Preliminary version appeared in STOC '82.
11. [FM89] P. Feldman and S. Micali. An optimal probabilistic algorithm for synchronous Byzantine agreement. Automata, languages and programming, 372:341-378, 1989.
12. Preliminary version appeared in STOC '88.
13. [PSL80] M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, Apr. 1980.
14. [PW96] B. Pfitzmann and M. Waidner. Information-theoretic pseudosignatures and byzantine agreement for t >= n/3. Technical report, IBM Research, 1996.
15. [TC84] R. Turpin and B. A. Coan. Extending binary Byzantine agreement to multivalued Byzantine agreement. Information Processing Letters, 18(2):73-76, Feb. 1984.