| Completeness theorems for non-cryptographic fault-tolerant distributed computation M Ben-Or, S Goldwasser, A Wigderson Providing sound foundations for cryptography: on the work of Shafi …, 2019 | 3790 | 2019 |
| Fault-tolerant quantum computation with constant error D Aharonov, M Ben-Or Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 1448 | 1997 |
| Verifiable secret sharing and multiparty protocols with honest majority T Rabin, M Ben-Or Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 1436 | 1989 |
| Another advantage of free choice (extended abstract) completely asynchronous agreement protocols M Ben-Or Proceedings of the second annual ACM symposium on Principles of distributed …, 1983 | 1093 | 1983 |
| Lower bounds for algebraic computation trees M Ben-Or Proceedings of the fifteenth Annual ACM Symposium on Theory of Computing, 80-86, 1983 | 795 | 1983 |
| Multi-prover interactive proofs: How to remove intractability assumptions M Ben-Or, S Goldwasser, J Kilian, A Wigderson Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019 | 698 | 2019 |
| A deterministic algorithm for sparse multivariate polynomial interpolation M Ben-Or, P Tiwari Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 471 | 1988 |
| Collective coin flipping, robust voting schemes and minima of Banzhaf values M Ben-Or, N Linial 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 408-416, 1985 | 432 | 1985 |
| The complexity of elementary algebra and geometry M Ben-Or, D Kozen, J Reif Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 412 | 1984 |
| A fair protocol for signing contracts M Ben-Or, O Goldreich, S Micali, RL Rivest IEEE Transactions on Information Theory 36 (1), 40-46, 1990 | 381 | 1990 |
| Everything provable is provable in zero-knowledge M Ben-Or, O Goldreich, S Goldwasser, J Håstad, J Kilian, S Micali, ... Advances in Cryptology—CRYPTO’88: Proceedings 8, 37-56, 1990 | 375 | 1990 |
| Asynchronous secure computation M Ben-Or, R Canetti, O Goldreich Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 298 | 1993 |
| Asynchronous secure computations with optimal resilience M Ben-Or, B Kelmer, T Rabin Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994 | 277 | 1994 |
| The universal composable security of quantum key distribution M Ben-Or, M Horodecki, DW Leung, D Mayers, J Oppenheim Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005 …, 2005 | 257 | 2005 |
| Interactive proofs for quantum computations D Aharonov, M Ben-Or, E Eban, U Mahadev arXiv preprint arXiv:1704.04487, 2017 | 237 | 2017 |
| Probabilistic algorithms in finite fields M Ben-Or 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), 394-398, 1981 | 216 | 1981 |
| Computing algebraic formulas with a constant number of registers M Ben-Or, R Cleve Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 196 | 1988 |
| Proceedings of the 29th Annual ACM Symposium on Theory of Computing D Aharonov, M Ben-Or ACM, 1997 | 188 | 1997 |
| A theorem on probabilistic constant depth computations M Ajtai, M Ben-Or Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 167 | 1984 |
| Fast quantum byzantine agreement M Ben-Or, A Hassidim Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 137 | 2005 |
