Michael Ben-Or - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 60 from 60

2022

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum SettingsDorit Aharonov, Michael Ben-Or, Fernando G. S. L. Brandão, Or Sattath. quantum, 6:668, 2022. [doi]

2019

Completeness theorems for non-cryptographic fault-tolerant distributed computationMichael Ben-Or, Shafi Goldwasser, Avi Wigderson. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 351-371, ACM, 2019. [doi]

Multi-prover interactive proofs: how to remove intractability assumptionsMichael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson. In Oded Goldreich 0001, editor, Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. pages 373-410, ACM, 2019. [doi]

2018

A Quasi-Random Approach to Matrix Spectral AnalysisMichael Ben-Or, Lior Eldar. innovations 2018: [doi]

2014

Quantum Multiprover Interactive Proofs with Communicating ProversMichael Ben-Or, Avinatan Hassidim, Haran Pilpel. SICOMP, 43(3):987-1011, 2014. [doi]

2010

Interactive Proofs For Quantum ComputationsDorit Aharonov, Michael Ben-Or, Elad Eban. innovations 2010: 453-469 [doi]

Brief Announcement: Simple Gradecast Based AlgorithmsMichael Ben-Or, Danny Dolev, Ezra N. Hoch. wdag 2010: 194-197 [doi]

A Fault-Resistant Asynchronous Clock FunctionEzra N. Hoch, Michael Ben-Or, Danny Dolev. sss 2010: 19-34 [doi]

2008

2006

Secure Multiparty Quantum Computation with (Only) a Strict Honest MajorityMichael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith. focs 2006: 249-260 [doi]

Byzantine agreement in the full-information model in O(log n) roundsMichael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan. stoc 2006: 179-186 [doi]

2005

The Universal Composable Security of Quantum Key DistributionMichael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim. tcc 2005: 386-406 [doi]

Fast quantum byzantine agreementMichael Ben-Or, Avinatan Hassidim. stoc 2005: 481-485 [doi]

2004

Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutionsMichael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld. approx 2004: 273-285 [doi]

Non-Abelian Homomorphism Testing, and Distributions Close to their Self-ConvolutionsMichael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld. eccc, (052), 2004. [doi]

2003

Trading Help for Interaction in Statistical Zero-Knowledge ProofsMichael Ben-Or, Danny Gutfreund. joc, 16(2):95-116, 2003. [doi]

Resilient-optimal interactive consistency in constant timeMichael Ben-Or, Ran El-Yaniv. dc, 16(4):249-262, 2003. [doi]

2000

Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof SystemsDanny Gutfreund, Michael Ben-Or. asiacrypt 2000: 429-442 [doi]

1998

A Tight Lower Bound for Randomized Synchronous ConsensusZiv Bar-Joseph, Michael Ben-Or. podc 1998: 193-199 [doi]

A Safe and Scalable Payment Infrastructure for Trade of Electronic ContentGadi Shamir, Michael Ben-Or, Danny Dolev. ijcis, 7(4):331-354, 1998.

BARTER: A Backbone Architecture for Trade of Electronic ContentGadi Shamir, Michael Ben-Or, Danny Dolev. ifip 1998: 65-79 [doi]

1997

Fault-Tolerant Quantum Computation With Constant ErrorDorit Aharonov, Michael Ben-Or. stoc 1997: 176-188 [doi]

1996

Polynomial Simulations of Decohered Quantum ComputersDorit Aharonov, Michael Ben-Or. focs 1996: 46-55

Agreement in the Presence of Faults, on Networks of Bounded DegreeMichael Ben-Or, Dana Ron. ipl, 57(6):329-334, 1996. [doi]

1994

Algebraic Computation Trees in Characteristi p>0 (Extended Abstract)Michael Ben-Or. focs 1994: 534-539

Asynchronous Secure Computations with Optimal Resilience (Extended Abstract)Michael Ben-Or, Boaz Kelmer, Tal Rabin. podc 1994: 183-192

1993

Asynchronous secure computationMichael Ben-Or, Ran Canetti, Oded Goldreich. stoc 1993: 52-61 [doi]

1992

Computing with Faulty ArraysYonatan Aumann, Michael Ben-Or. stoc 1992: 162-169

Computing Algebraic Formulas Using a Constant Number of RegistersMichael Ben-Or, Richard Cleve. SICOMP, 21(1):54-58, 1992.

1991

Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)Yonatan Aumann, Michael Ben-Or. focs 1991: 440-446

1990

Simple algorithms for approximating all roots of a polynomial with real rootsMichael Ben-Or, Prasoon Tiwari. jc, 6(4):417-442, 1990. [doi]

A fair protocol for signing contractsMichael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest. TIT, 36(1):40-46, 1990.

1989

1988

Computing Algebraic Formulas Using a Constant Number of RegistersMichael Ben-Or, Richard Cleve. stoc 1988: 254-257

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract)Michael Ben-Or, Prasoon Tiwari. stoc 1988: 301-309

A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. SICOMP, 17(6):1081-1092, 1988.

Multi-Prover Interactive Proofs: How to Remove Intractability AssumptionsMichael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson. stoc 1988: 113-131

Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)Michael Ben-Or, Shafi Goldwasser, Avi Wigderson. stoc 1988: 1-10

Everything Provable is Provable in Zero-KnowledgeMichael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway. crypto 1990: 37-56 [doi]

1986

Randomized Agreement ProtocolsMichael Ben-Or. ftdcs 1990: 72-83

A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real RootsMichael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari. stoc 1986: 340-349

The Complexity of Elementary Algebra and GeometryMichael Ben-Or, Dexter Kozen, John H. Reif. jcss, 32(2):251-264, 1986.

1985

Choice Coordination with Bounded Failure (a Preliminary Version)Amotz Bar-Noy, Michael Ben-Or, Danny Dolev. podc 1985: 309-316

Fast Asynchronous Byzantine Agreement (Extended Abstract)Michael Ben-Or. podc 1985: 149-151

Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf ValuesMichael Ben-Or, Nathan Linial. focs 1985: 408-416

A Fair Protocol for Signing Contracts (Extended Abstract)Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest. icalp 1985: 43-52

1984

A Theorem on Probabilistic Constant Depth ComputationsMiklós Ajtai, Michael Ben-Or. stoc 1984: 471-474

The Complexity of Elementary Algebra and Geometry (Preliminary Abstract)Michael Ben-Or, Dexter Kozen, John H. Reif. stoc 1984: 457-464

1983

Lower Bounds for Algebraic Computation Trees (Preliminary Report)Michael Ben-Or. stoc 1983: 80-86

Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract)Michael Ben-Or. podc 1983: 27-30

On the Cryptographic Security of Single RSA BitsMichael Ben-Or, Benny Chor, Adi Shamir. stoc 1983: 421-430

1981

Probabilistic Algorithms in Finite FieldsMichael Ben-Or. focs 1981: 394-398

אלגוריתמים הסתברותיים בשדות סופיים (Probabilistic algorithms in finite fields.)Michael Ben-Or. PhD thesis, Hebrew University of Jerusalem, Israel, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL