Efficient byzantine agreement with faulty minority

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4833 LNCS, Issue , 2007, Pages 393-409

  Beerliova Trubiniova, Zuzana ^a   Hirt, Martin ^a   Riser, Micha ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Broadcast; Byzantine agreement; Consensus; Efficiency; Information theoretic security; Multi party computation

Indexed keywords

BROADCASTING; COMPUTATION THEORY; INFORMATION THEORY;

BYZANTINE AGREEMENT; INFORMATION-THEORETIC SECURITY; MULTI-PARTY COMPUTATION;

SECURITY OF DATA;

EID: 38349072001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76900-2_24     Document Type: Conference Paper

References (18)

1. Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, 75-122 (1991)
2. Berman, P., Garay, J.A, Perry, K.J.: Bit optimal distributed consensus. Computer Science Research, 313-322 (1992)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC, pp. 1-10 (1988)
4. Beerliova-Trubiniova, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305-328. Springer, Heidelberg (2006)
5. Baum-Waidner, B., Pfitzmann, B., Waidner, M.: Unconditional Byzantine agreement with good majority. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 285-295. Springer, Heidelberg (1991)
6. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
7. Carter, L., Wegman, M.N.: Universal classes of hash functions. JCSS 18(4), 143-154 (1979) (Preliminary version in Proc. 9st STOC, 1977)
8. Coan, B.A, Welch, J.L.: Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation 97(1), 61-85 (1992)
9. Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing 12(4), 656-666 (1983) (Preliminary version in Proc. 14th STOC, 1982)
10. Fitzi, M.: Generalized Communication and Security Models in Byzantine Agreement. PhD thesis, ETH Zurich (2003)
11. Fitzi, M.: Personal communication (2004)
12. Fischer, M.J, Lynch, N.A, Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing 1, 26-39 (1986)
13. Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143-161. Springer, Heidelberg (2000)
14. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228-234 (1980)
15. Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and Byzantine agreement for t >= n/3. Technical report, IBM Research (1996)
16. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. 21st STOC, pp. 73-85 (1989)
17. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
18. Shikata, J., Hanaoka, G., Zheng, Y., Imai, H.: Security notions for unconditionally secure signature schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 434-449. Springer, Heidelberg (2002)