Round complexity of authenticated broadcast with a dishonest majority

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 658-668

  Garay, Juan A ^a   Katz, Jonathan ^b   Chiu Yuen, Koo ^b   Ostrovsky, Rafail ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Maryland

^c Department of Civil and Environmental Engineering

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; DIGITAL SIGNATURES;

EID: 46749153857     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389534     Document Type: Conference Paper

References (33)

1. A. Bar-Noy, D. Dolev, C. Dwork, and H. R. Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In 6th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1987.
2. M. Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC), 1983.
3. M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in O(log n) rounds. In 38th Annual ACM Symposium on Theory of Computing (STOC), 2006.
4. P. Berman and J. A. Garay. Efficient distributed consensus with n = (3+ε)t processors. In 5th Intl. Workshop on Distributed Algorithms (WDAG), 1991.
5. P. Berman and J. A. Garay. Cloture votes: n/4-resilient, polynomial-time distributed consensus in t + 1 rounds. Mathematical Systems Theory, 26(1):3-20, 1993.
6. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantitnople: Practical asynchronous Byzantine agreement using cryptography. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2000.
7. B. Chor and C. Dwork. Randomization in Byzantine agreement. Advances in Computing Research, 4, 1989.
8. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In 18th Annual ACM Symposium on Theory of Computing (STOC), 1986.
9. B. A. Coan. A communication-efficient canonical form for fault-tolerant distributed protocols. In 5th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1986.
10. J. Considine, M. Fitzi, M. Franklin, L. A. Levin, U. Maurer, and D. Metcalf. Byzantine agreement given partial broadcast. J. Cryptology, 18(3): 191-217, 2005.
11. D. Dolev. The Byzantine generals strike again. J. Algorithms, 3(1): 14-30, 1982.
12. D. Dolev, R. Reischuk, and H. R. Strong. Early stopping in Byzantine agreement. J. ACM, 37(4):720-741, 1990.
13. D. Dolev and H. Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Computing, 12(4):656-666, 1983.
14. P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Computing, 26(4):873-933, 1997.
15. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty processor. J. ACM, 32(2):374-382, 1985.
16. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Info. Proc. Lett., 14(4):183-186, 1982.
17. M. Fitzi and J. A. Garay. Efficient player-optimal protocols for strong and differential consensus. In 22nd Annual ACM Symp. on Principles of Distributed Computing (PODC), 2003.
18. J. A. Garay, P. D. MacKenzie, M. Prabhakaran, and K. Yang. Resource fairness and composability of cryptographic protocols. In 3rd Theory of Cryptography Conference (TCC), 2006.
19. J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement for n > 3t processors in t+1 rounds. SIAM J. Computing, 27(1):247-290, 1998.
20. S. Goldwasser and Y Lindell. Secure multi-party computation without agreement. J. Cryptology, 18(3):247-287, 2005.
21. S. Goldwasser, E. Pavlov, and V. Vaikuntanathan. Fault-tolerant distributed computing in fullinformation networks. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
22. R. Gradwohl, S. P. Vadhan, and D. Zuckerman. Random selection with an adversarial majority. In Advances in Cryptology -Crypto 2006.
23. J. Katz and C.-Y. Koo. On expected constant-round protocols for Byzantine agreement. In Advances in Cryptology -Crypto 2006.
24. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. Syst., 4(3):382-401, 1982.
25. Y Lindell, A. Lysyanskaya, and T Rabin. On the composition of authenticated Byzantine agreement. In 34th Annual ACM Symposium on Theory of Computing (STOC), 2002.
26. Y Moses and O. Waarts. Coordinated traversal: (t + 1)-round Byzantine agreement in polynomial time. J. Algorithms, 17(1):110-156, 1994.
27. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st Annual ACM Symposium on Theory of Computing (STOC), 1989.
28. J. Nielsen. A threshold pseudorandom function construction and its applications. In Advances in Cryptology-Crypto 2002.
29. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
30. B. Pfitzmann and M. Waidner. Informationtheoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
31. M. Rabin. Randomized Byzantine generals. In 24th IEEE Symposium on Foundations of Computer Science (FOCS), 1983.
32. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd Annual ACM Symposium on Theory of Computing (STOC), 1990.
33. S. Toueg, K. J. Perry, and T K. Srikanth. Fast distributed agreement. SIAM J. Computing, 16(3):445-457, 1987.