Travelled to:1 × Canada
1 × Greece
9 × USA
Collaborated with:P.Tiwari O.Goldreich S.Goldwasser A.Wigderson D.Kozen A.Hassidim D.Aharonov Y.Aumann T.Rabin R.Cleve M.Ajtai ∅ E.Pavlov V.Vaikuntanathan R.Canetti J.H.Reif B.Chor A.Shamir J.Kilian E.Feig S.Micali R.L.Rivest
Talks about:comput (7) constant (3) algebra (3) cryptograph (2) algorithm (2) agreement (2) protocol (2) byzantin (2) theorem (2) quantum (2)
Person: Michael Ben-Or
DBLP: Ben-Or:Michael
Contributed to:
20062005199719931992198919881986
198519841983Wrote 16 papers:
- STOC-2006-Ben-OrPV
- Byzantine agreement in the full-information model in O(log n) rounds (MBO, EP, VV), pp. 179–186.
- STOC-2005-Ben-OrH #performance #quantum
- Fast quantum byzantine agreement (MBO, AH), pp. 481–485.
- STOC-1997-AharonovB #constant #fault tolerance #quantum
- Fault-Tolerant Quantum Computation With Constant Error (DA, MBO), pp. 176–188.
- STOC-1993-Ben-OrCG
- Asynchronous secure computation (MBO, RC, OG), pp. 52–61.
- STOC-1992-AumannB #array
- Computing with Faulty Arrays (YA, MBO), pp. 162–169.
- STOC-1989-RabinB #multi #protocol
- Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (TR, MBO), pp. 73–85.
- STOC-1988-Ben-OrC #algebra #constant #using
- Computing Algebraic Formulas Using a Constant Number of Registers (MBO, RC), pp. 254–257.
- STOC-1988-Ben-OrGKW #how #interactive #multi #proving
- Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions (MBO, SG, JK, AW), pp. 113–131.
- STOC-1988-Ben-OrGW #distributed #fault tolerance #theorem
- Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (MBO, SG, AW), pp. 1–10.
- STOC-1988-Ben-OrT #algorithm #multi
- A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (MBO, PT), pp. 301–309.
- STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.
- ICALP-1985-Ben-OrGMR #contract #protocol
- A Fair Protocol for Signing Contracts (MBO, OG, SM, RLR), pp. 43–52.
- STOC-1984-AjtaiB #constant #probability #theorem
- A Theorem on Probabilistic Constant Depth Computations (MA, MBO), pp. 471–474.
- STOC-1984-Ben-OrKR #algebra #complexity #geometry
- The Complexity of Elementary Algebra and Geometry (MBO, DK, JHR), pp. 457–464.
- STOC-1983-Ben-Or #algebra #bound
- Lower Bounds for Algebraic Computation Trees (MBO), pp. 80–86.
- STOC-1983-Ben-OrCS #encryption #on the #security
- On the Cryptographic Security of Single RSA Bits (MBO, BC, AS), pp. 421–430.