[Benaloh 1986]

J. Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Proceedings of Crypto 1986.

[Ben-Or 1983]

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.

[Ben-Or, Goldwasser and Wigderson 1988]

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.

[Blakely 1979]

Safeguarding Cryptographic Keys, Proc. AFIPS June 1979 NCC Vol. 48, pp.313–317.

[Bracha 1985]

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.

[Bracha and Toueg 1983]

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.

[Chaum, Crepeau and Damgaard 1988]

D. Chaum, C. Crepeau, and I. Damgaard, Multiparty Unconditionally Secure Protocols, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, May 1988.

[Chor and Coan 1985]

B. Chor and B. Coan, A Simple and Efficient Randomized Byzantine Agreement Algorithm, IEEE Transactions on Software Engineering, Vol. SE-11, No.6 1985.

[Chor and Dwork 1987]

B. Chor and C. Dwork, manuscript.

[Chor, Goldwasser, Micali and Awerbuch 1985]

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.

[Chor, Merritt and Shmoys 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.

[Coan 1987]

B. Coan, Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations, PhD. thesis, MIT, 1987.

[Dolev 1982]

D. Dolev, The Byzantine Generals Strike Again, Journal of Algorithms, Vol. 3, No. 1, pp. 14–30, March 1982.

CrossRefGoogle Scholar[Dolev and Dwork 1987]

D. Dolev and C. Dwork, manuscript.

[Dolev, Fischer, Fowler, Lynch, and Strong 1982]

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.

CrossRefGoogle Scholar[Dolev and Strong 1982]

D. Dolev and H. Strong, Authenticated Algorithms for Byzantine Agreement, IBM Technical Report RJ3416, March 1982.

[Dwork, Shmoys and Stockmeyer 1986]

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.

[Feldman 1987]

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.

[Feldman 1988a]

P. Feldman, manuscript.

[Feldman 1988b]

P. Feldman, submitted for publication.

[Feldman and Micali 1985]

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.

[Fischer and Lynch 1982]

A Lower Bound for the Time to Assure Interactive Consistency, Information Processing Letters, 14(4), pp.183–186, 1982.

Google Scholar[Fischer, Lynch and Paterson 1983]

Impossibility of Distributed Consensus with One Faulty Process, JACM 32(2), pp.374–382, 1985.

[Goldwasser, Micali and Rackoff 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.

[Goldreich, Micali, and Wigderson 1986]

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.

[Karlin and Yao 1987]

A. Karlin and A. Yao, manuscript.

[Linnik 1944]

Result quoted from Encyclopedic Dictionary of Mathematics, Second Edition, MIT Press, 1987 123 D.

[Pease, Shostak and Lamport 1980]

M. Pease, R. Shostak, and L. Lamport, Reaching Agreement in the Presence of Faults, JACM 27(2), 1980.

[Peterson and Weldon 1972]

Peterson and Weldon, Error Correcting Codes, Second Ed., MIT Press, 1972.

[Rabin 1983]

Randomized Byzantine Generals, Proceedings of the Twenty-fourth Annual IEEE Symposium on Foundations of Computer Science, May 1983, pp.403–409.

[Shamir 1979]

A. Shamir, How to Share a Secret, CACM Vol.22 No.11, 1979.

[Srikanth and Toueg 1984]

T. Srikanth and S. Toueg, Byzantine Agreement Made Simple: Simulating Authentication without Signatures, Cornell Technical Report 84-623, July 1984.

[Turpin and Coan 1984]

R. Turpin and B. Coan, Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement, Information Processing Letters, Vol. 18, pp. 73–76, Feb. 1984.

CrossRefGoogle Scholar