Obserwuj
Michael Ben-Or
Michael Ben-Or
The Jean and Helena Alfassa Professor of Computer Science, The Hebrew University
Zweryfikowany adres z cs.huji.ac.il
Tytuł
Cytowane przez
Cytowane przez
Rok
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
32532019
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
12561989
Fault-tolerant quantum computation with constant error rate
D Aharonov, M Ben-Or
SIAM Journal on Computing, 2008
10212008
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
9381983
Lower bounds for algebraic computation trees
M Ben-Or
Proceedings of the fifteenth Annual ACM Symposium on Theory of Computing, 80-86, 1983
7501983
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
6342019
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
4041988
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
4001984
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
3931985
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
3611990
Everything provable is provable in zero-knowledge
M Ben-Or, O Goldreich, S Goldwasser, J Håstad, J Kilian, S Micali, ...
Conference on the Theory and Application of Cryptography, 37-56, 1988
3181988
The universal composable security of quantum key distribution
M Ben-Or, M Horodecki, DW Leung, D Mayers, J Oppenheim
Theory of Cryptography Conference, 386-406, 2005
2342005
Asynchronous secure computation
M Ben-Or, R Canetti, O Goldreich
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2301993
Probabilistic algorithms in finite fields
M Ben-Or
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), 394-398, 1981
1931981
Asynchronous secure computations with optimal resilience
M Ben-Or, B Kelmer, T Rabin
Proceedings of the thirteenth annual ACM symposium on Principles of …, 1994
1881994
Proceedings of the 29th Annual ACM Symposium on Theory of Computing
D Aharonov, M Ben-Or
ACM, 1997
1871997
Interactive proofs for quantum computations
D Aharonov, M Ben-Or, E Eban, U Mahadev
arXiv preprint arXiv:1704.04487, 2017
1842017
Computing algebraic formulas using a constant number of registers
M Ben-Or, R Cleve
SIAM Journal on Computing 21 (1), 54-58, 1992
178*1992
A theorem on probabilistic constant depth computations
M Ajtai, M Ben-Or
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
1571984
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
1062006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20