Journal of the ACM Bibliography

Selected papers that cite this one

• Shafi Goldwasser. New directions in cryptography: Twenty some years later (or Cryptography and complexity theory: A match made in heaven). In 38th Annual Symposium on Foundations of Computer Science, pages 314-324, Miami Beach, Florida, 20-22 October 1997. IEEE.

Selected references

• Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols (extended abstract). In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 503-513, Baltimore, Maryland, 14-16 May 1990.

• Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 1-10, Chicago, Illinois, 2-4 May 1988.

• David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 11-19, Chicago, Illinois, 2-4 May 1988.

• Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In 26th Annual Symposium on Foundations of Computer Science, pages 383-395, Portland, Oregon, 21-23 October 1985. IEEE.

• Danny Dolev, Cynthia Dwork, Orli Waarts, and Moti Yung. Perfectly secure message transmission. In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 36-45, St. Louis, Missouri, 22-24 October 1990. IEEE.

• Paul Feldman and Silvio Micali. Optimal algorithms for Byzantine agreement. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 148-161, Chicago, Illinois, 2-4 May 1988.

• Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In 27th Annual Symposium on Foundations of Computer Science, pages 174-187, Toronto, Ontario, Canada, 27-29 October 1986. IEEE.

• M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.

• Michael O. Rabin. Randomized Byzantine generals. In 24th Annual Symposium on Foundations of Computer Science, pages 403-409, Tucson, Arizona, 7-9 November 1983. IEEE.

• Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 73-85, Seattle, Washington, 15-17 May 1989.

Shortcuts: