Michael Ben-Or
机构: The Jean and Helena Alfassa Professor of Computer Science, The Hebrew University
每年引用次数
引用次数
引用: 14,705
H-指数: 36
I10-指数 : 56
出版物: 79
Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.
Ronitt Rubinfeld , Don Coppersmith , Michael Luby , Michael Ben-Or
international workshop and international workshop on approximation, randomization, and combinatorial optimization. algorithms and techniques 273 -285
20
2004
Selected papers of the 23rd annual ACM symposium on Theory of computing
Baruch Awerbuch , Michael Saks , Joachim von zur Gathen , Joseph Halpern
1995
A Quasi-Random Approach to Matrix Spectral Analysis
Lior Eldar , Michael Ben-Or
conference on innovations in theoretical computer science 94 22
1
2018
A fault-resistant asynchronous clock function
Ezra N. Hoch , Michael Ben-Or , Danny Dolev
international conference on stabilization safety and security of distributed systems 6366 19 -34
1
2010
Everything provable is provable in zero-knowledge
Michael Ben-Or , Oded Goldreich , Shafi Goldwasser , Johan Håstad
international cryptology conference 37 -56
328
1990
Efficient identification schemes using two prover interactive proofs
Michael Ben-Or , Shafi Goldwasser , Joe Kilian , Avi Wigderson
international cryptology conference 498 -506
23
1989
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Michael Ben-Or , Shafi Goldwasser , Avi Wigderson
symposium on the theory of computing 1 -10
3,415
1988
A deterministic algorithm for sparse multivariate polynomial interpolation
Michael Ben-Or , Prasson Tiwari
symposium on the theory of computing 301 -309
283
1988
Resilient-optimal interactive consistency in constant time
Michael Ben-Or , Ran El-Yaniv
Distributed Computing 16 ( 4) 249 -262
46
2003
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Danny Gutfreund , Michael Ben-Or
international conference on the theory and application of cryptology and information security 429 -442
7
2000
Agreement in the presence of faults, on networks of bounded degree
Michael Ben-Or , Dana Ron
Information Processing Letters 57 ( 6) 329 -334
9
1996
A theorem on probabilistic constant depth Computations
Miklos Ajtai , Michael Ben-Or
symposium on the theory of computing 471 -474
161
1984
Lower bounds for algebraic computation trees
Michael Ben-Or
symposium on the theory of computing 80 -86
488
1983
On the cryptographic security of single RSA bits
Michael Ben-Or , Benny Chor , Adi Shamir
symposium on the theory of computing 421 -430
39
1983
The complexity of elementary algebra and geometry
Michael Ben-Or , Dexter Kozen , John Reif
symposium on the theory of computing 457 -464
40
1984
Multi-prover interactive proofs: how to remove intractability assumptions
Michael Ben-Or , , Shafi Goldwasser , Joe Kilian
Providing Sound Foundations for Cryptography 373 -410
644
2019
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
Michael Ben-Or , Avinatan Hassidim
foundations of computer science 221 -230
61
2008
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Michael Ben-Or , Claude Crepeau , Daniel Gottesman , Avinatan Hassidim
foundations of computer science 249 -260
98
2006
Collective coin flipping, robust voting schemes and minima of Banzhaf values
Michael Ben-Or , Nathan Linial
26th Annual Symposium on Foundations of Computer Science (sfcs 1985) 408 -416
94
1985
Computing with faulty arrays
Yonatan Aumann , Michael Ben-Or
symposium on the theory of computing 162 -169
12
1992