On Expected Constant-Round Protocols for Byzantine Agreement.

作者: Chiu-Yuen Koo , Jonathan Katz

DOI:

关键词: AlgorithmConstant (mathematics)Byzantine architectureQuantum Byzantine agreementProtocol (science)Computer scienceAgreement

摘要: In a seminal paper, Feldman and Micali show an n-party Byzantine agreement protocol in the plain model that tolerates t

参考文章(36)
Paul Feldman, Silvio Micali, Byzantine Agreement in Constant Expected Time (and Trusting No One) foundations of computer science. pp. 267- 276 ,(1985)
Shafi Goldwasser, Yehuda Lindell, Secure Computation without Agreement Lecture Notes in Computer Science. pp. 17- 32 ,(2002) , 10.1007/3-540-36108-1_2
R. Canetti, Universally composable security: a new paradigm for cryptographic protocols international conference on cluster computing. pp. 136- 145 ,(2001) , 10.1109/SFCS.2001.959888
Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin, Efficient multiparty computations secure against an adaptive adversary theory and application of cryptographic techniques. pp. 311- 326 ,(1999) , 10.1007/3-540-48910-X_22
Donald Beaver, Stuart Haber, Cryptographic protocols provably secure against dynamic adversaries theory and application of cryptographic techniques. pp. 307- 323 ,(1992) , 10.1007/3-540-47555-9_26
Matthias Fitzi, Juan Garay, Shyamnath Gollakota, C. Pandu Rangan, Kannan Srinathan, Round-Optimal and Efficient Verifiable Secret Sharing Theory of Cryptography. pp. 329- 342 ,(2006) , 10.1007/11681878_17
Jonathan Katz, Chiu-Yuen Koo, On Expected Constant-Round Protocols for Byzantine Agreement Lecture Notes in Computer Science. pp. 445- 462 ,(2006) , 10.1007/11818175_27
Christian Cachin, Klaus Kursawe, Victor Shoup, Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract) principles of distributed computing. pp. 123- 132 ,(2000) , 10.1145/343477.343531