Journal of the ACM Bibliography
Danny Dolev, Cynthia Dwork, Orli Waarts, and Moti Yung. Perfectly secure message
transmission. Journal of the ACM, 40(1):17-47, January
1993.
[BibTeX entry]
Selected papers that cite this one
Selected references
- Donald Beaver and Shafi Goldwasser. Multiparty computation with
faulty majority (extended announcement). In 30th Annual
Symposium on Foundations of Computer Science, pages 468-473,
Research Triangle Park, North Carolina, 30 October-1 November 1989.
IEEE.
- 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.
- Benny Chor and Eyal Kushilevitz. A zero-one law for Boolean
privacy (extended abstract). In Proceedings of the Twenty
First Annual ACM Symposium on Theory of Computing, pages 62-72,
Seattle, Washington, 15-17 May 1989.
- Richard Cleve. Limits on the security of
coin flips when half the processors are faulty (extended abstract).
In Proceedings of the Eighteenth Annual ACM Symposium on Theory of
Computing, pages 364-369, Berkeley, California, 28-30 May 1986.
- 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. How to play any mental
game or a completeness theorem for protocols with honest majority.
In Proceedings of the Nineteenth Annual ACM Symposium on Theory of
Computing, pages 218-229, New York City, 25-27 May 1987.
- 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.
- Andrew Chi-Chih Yao. How to generate and exchange
secrets (extended abstract). In 27th Annual Symposium on
Foundations of Computer Science, pages 162-167, Toronto, Ontario,
Canada, 27-29 October 1986. IEEE.
Shortcuts: