Follow
Michael Ben-Or
Michael Ben-Or
The Jean and Helena Alfassa Professor of Computer Science, The Hebrew University
Verified email at cs.huji.ac.il
Title
Cited by
Cited by
Year
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
37312019
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
14131989
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
13701997
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
10811983
Lower bounds for algebraic computation trees
M Ben-Or
Proceedings of the fifteenth Annual ACM Symposium on Theory of Computing, 80-86, 1983
7841983
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
6852019
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
4591988
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
4181985
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
4131984
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
3811990
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
3641990
Asynchronous secure computation
M Ben-Or, R Canetti, O Goldreich
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2891993
Asynchronous secure computations with optimal resilience
M Ben-Or, B Kelmer, T Rabin
Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994
2621994
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
2572005
Interactive proofs for quantum computations
D Aharonov, M Ben-Or, E Eban, U Mahadev
arXiv preprint arXiv:1704.04487, 2017
2252017
Probabilistic algorithms in finite fields
M Ben-Or
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), 394-398, 1981
2181981
Proceedings of the 29th Annual ACM Symposium on Theory of Computing
D Aharonov, M Ben-Or
ACM, 1997
2171997
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
1901988
A theorem on probabilistic constant depth computations
M Ajtai, M Ben-Or
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
1641984
Secure multiparty quantum computation with (only) a strict honest majority
M Ben-Or, C Crépeau, D Gottesman, A Hassidim, A Smith
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
1322006
The system can't perform the operation now. Try again later.
Articles 1–20