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 | 1019 | 1990 |
Efficient multiparty protocols using circuit randomization D Beaver Advances in Cryptology—CRYPTO’91: Proceedings 11, 420-432, 1992 | 1014 | 1992 |
Dapper, a large-scale distributed systems tracing infrastructure BH Sigelman, LA Barroso, M Burrows, P Stephenson, M Plakal, D Beaver, ... | 788 | 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 | 408 | 1989 |
Foundations of secure interactive computing D Beaver Annual International Cryptology Conference, 377-391, 1991 | 382 | 1991 |
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority D Beaver Journal of Cryptology 4, 75-122, 1991 | 315 | 1991 |
Hiding instances in multioracle queries D Beaver, J Feigenbaum Annual Symposium on Theoretical Aspects of Computer Science, 37-48, 1990 | 311 | 1990 |
Precomputing oblivious transfer D Beaver Annual International Cryptology Conference, 97-109, 1995 | 307 | 1995 |
Correlated pseudorandomness and the complexity of private computations D Beaver Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 283 | 1996 |
Commodity-based cryptography D Beaver Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 198 | 1997 |
Multiparty computation with faulty majority D Beaver, S Goldwasser Conference on the Theory and Application of Cryptology, 589-590, 1989 | 193 | 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 | 169 | 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 | 116 | 1996 |
Perfect privacy for two-party protocols D Beaver Harvard University, Center for Research in Computing Technology, Aiken …, 1990 | 102 | 1990 |
Locally random reductions: Improvements and applications D Beaver, J Feigenbaum, J Kilian, P Rogaway Journal of Cryptology 10, 17-36, 1997 | 91 | 1997 |
Computing with DNA D Beaver Journal of Computational Biology 2 (1), 1-7, 1995 | 86 | 1995 |
Minimal-latency secure function evaluation D Beaver International Conference on the Theory and Applications of Cryptographic …, 2000 | 73 | 2000 |
Plug and play encryption D Beaver Annual International Cryptology Conference, 75-89, 1997 | 73 | 1997 |