Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Proceedings of Crypto 1986.
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, August 1983, pp. 27–30.
M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 1988.
Safeguarding Cryptographic Keys, Proc. AFIPS June 1979 NCC Vol. 48, pp.313–317.
G. Bracha, An O (log n) Expected Rounds Randomized Byzantine Generals Protocol, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, May 1985.
G. Bracha and S. Toueg, Resilient Consensus Protocols, Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, August 1983, pp. 12–26.
D. Chaum, C. Crepeau, and I. Damgaard, Multiparty Unconditionally Secure Protocols, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 1988.
B. Chor and B. Coan, A Simple and Efficient Randomized Byzantine Agreement Algorithm, IEEE Transactions on Software Engineering, Vol. SE-11, No.6 1985.
B. Chor and C. Dwork, manuscript.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, Proceedings of the Twenty-fifth Annual IEEE Symposium on Foundations of Computer Science, October 1985.
B. Chor, M. Merritt, and D. Shmoys, Simple Constant-Time Consensus Protocols in Realistic Failure Models, Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, August 1985, pp. 152–162.
B. Coan, Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations, PhD. thesis, MIT, 1987.
D. Dolev, The Byzantine Generals Strike Again, Journal of Algorithms, Vol. 3, No. 1, pp. 14–30, March 1982.
D. Dolev and C. Dwork, manuscript.
D. Dolev, M. Fischer, R. Fowler, N. Lynch, and H. Strong, An Efficient Algorithm for Byzantine Agreement Without Authentication, Information and Control, Vol. 52, Nos. 1–3, pp. 257–274, Jan-March/1982.
D. Dolev and H. Strong, Authenticated Algorithms for Byzantine Agreement, IBM Technical Report RJ3416, March 1982.
C. Dwork, D. Shmoys and L. Stockmeyer, Flipping Persuasively in Constant Expected Time, Proceedings of the Twenty-seventh Annual IEEE Symposium on Foundations of Computer Science, October 1986, pp.222–232.
P. Feldman, A Practical Scheme for Non-Interactive Verifiable Secret Sharing, Proceedings of the Twenty-seventh Annual IEEE Symposium on Foundations of Computer Science, October 1987.
P. Feldman, manuscript.
P. Feldman, submitted for publication.
P. Feldman and S. Micali, Byzantine Agreement in Constant Expected Time, Proceedings of the Twenty-fifth Annual IEEE Symposium on Foundations of Computer Science, May 1985.
A Lower Bound for the Time to Assure Interactive Consistency, Information Processing Letters, 14(4), pp.183–186, 1982.
Impossibility of Distributed Consensus with One Faulty Process, JACM 32(2), pp.374–382, 1985.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proofs, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, May 1985.
O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design, Proceedings of the Twenty-seventh Annual IEEE Symposium on Foundations of Computer Science, May 1986.
A. Karlin and A. Yao, manuscript.
Result quoted from Encyclopedic Dictionary of Mathematics, Second Edition, MIT Press, 1987 123 D.
M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults, JACM 27(2), 1980.
Peterson and Weldon, Error Correcting Codes, Second Ed., MIT Press, 1972.
Randomized Byzantine Generals, Proceedings of the Twenty-fourth Annual IEEE Symposium on Foundations of Computer Science, May 1983, pp.403–409.
A. Shamir, How to Share a Secret, CACM Vol.22 No.11, 1979.
T. Srikanth and S. Toueg, Byzantine Agreement Made Simple: Simulating Authentication without Signatures, Cornell Technical Report 84-623, July 1984.
R. Turpin and B. Coan, Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement, Information Processing Letters, Vol. 18, pp. 73–76, Feb. 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feldman, P., Micali, S. (1989). An optimal probabilistic algorithm for synchronous Byzantine agreement. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035770
Download citation
DOI: https://doi.org/10.1007/BFb0035770
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive