| The round complexity of secure protocols D Beaver, S Micali, P Rogaway Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 984 | 1990 |
| Efficient multiparty protocols using circuit randomization D Beaver Advances in Cryptology—CRYPTO’91: Proceedings 11, 420-432, 1992 | 934 | 1992 |
| Dapper, a large-scale distributed systems tracing infrastructure BH Sigelman, LA Barroso, M Burrows, P Stephenson, M Plakal, D Beaver, ... | 766 | 2010 |
| Non-cryptographic fault-tolerant computing in constant number of rounds of interaction J Bar-Ilan, D Beaver Proceedings of the eighth annual ACM Symposium on Principles of distributed …, 1989 | 396 | 1989 |
| Foundations of secure interactive computing D Beaver Annual International Cryptology Conference, 377-391, 1991 | 375 | 1991 |
| Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority D Beaver Journal of Cryptology 4, 75-122, 1991 | 312 | 1991 |
| Hiding instances in multioracle queries D Beaver, J Feigenbaum Annual Symposium on Theoretical Aspects of Computer Science, 37-48, 1990 | 309 | 1990 |
| Precomputing oblivious transfer D Beaver Annual International Cryptology Conference, 97-109, 1995 | 292 | 1995 |
| Correlated pseudorandomness and the complexity of private computations D Beaver Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 269 | 1996 |
| Commodity-based cryptography D Beaver Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 195 | 1997 |
| Multiparty computation with faulty majority D Beaver, S Goldwasser Conference on the Theory and Application of Cryptology, 589-590, 1989 | 189 | 1989 |
| Cryptographic protocols provably secure against dynamic adversaries D Beaver, S Haber Workshop on the Theory and Application of of Cryptographic Techniques, 307-323, 1992 | 171 | 1992 |
| Security with low communication overhead D Beaver, J Feigenbaum, J Kilian, P Rogaway Advances in Cryptology-CRYPTO’90: Proceedings 10, 62-76, 1991 | 126 | 1991 |
| Multiparty protocols tolerating half faulty processors D Beaver Advances in Cryptology—CRYPTO’89 Proceedings 9, 560-572, 1990 | 120 | 1990 |
| A universal molecular computer D Beaver DIMACS Series in Discrete Mathematics and Theoretical Computer Science 27, 29-36, 1996 | 108 | 1996 |
| Perfect privacy for two-party protocols D Beaver Harvard University, Center for Research in Computing Technology, Aiken …, 1990 | 103 | 1990 |
| Locally random reductions: Improvements and applications D Beaver, J Feigenbaum, J Kilian, P Rogaway Journal of Cryptology 10, 17-36, 1997 | 90 | 1997 |
| Computing with DNA D Beaver Journal of Computational Biology 2 (1), 1-7, 1995 | 83 | 1995 |
| Plug and play encryption D Beaver Annual International Cryptology Conference, 75-89, 1997 | 75 | 1997 |
| Minimal-latency secure function evaluation D Beaver International Conference on the Theory and Applications of Cryptographic …, 2000 | 71 | 2000 |
Joan FeigenbaumGrace Murray Hopper Professor of Computer Science, Yale UniversityVerified email at yale.edu
