The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Ben-Or: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry. [Citation Graph (5, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:2, pp:251-264 [Journal]
  2. Michael Ben-Or, Dexter Kozen, John H. Reif
    The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:457-464 [Conf]
  3. Tal Rabin, Michael Ben-Or
    Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:73-85 [Conf]
  4. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:273-285 [Conf]
  5. Danny Gutfreund, Michael Ben-Or
    Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2000, pp:429-442 [Conf]
  6. Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway
    Everything Provable is Provable in Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:37-56 [Conf]
  7. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
    Efficient Identification Schemes Using Two Prover Interactive Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:498-506 [Conf]
  8. Dorit Aharonov, Michael Ben-Or
    Polynomial Simulations of Decohered Quantum Computers. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:46-55 [Conf]
  9. Yonatan Aumann, Michael Ben-Or
    Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:440-446 [Conf]
  10. Michael Ben-Or
    Probabilistic Algorithms in Finite Fields [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:394-398 [Conf]
  11. Michael Ben-Or
    Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:534-539 [Conf]
  12. Michael Ben-Or, Nathan Linial
    Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:408-416 [Conf]
  13. Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith
    Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:249-260 [Conf]
  14. Michael Ben-Or
    Randomized Agreement Protocols. [Citation Graph (0, 0)][DBLP]
    Fault-Tolerant Distributed Computing, 1986, pp:72-83 [Conf]
  15. Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
    A Fair Protocol for Signing Contracts (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:43-52 [Conf]
  16. Gadi Shamir, Michael Ben-Or, Danny Dolev
    BARTER: A Backbone Architecture for Trade of Electronic Content. [Citation Graph (0, 0)][DBLP]
    Trends in Distributed Systems for Electronic Commerce, 1998, pp:65-79 [Conf]
  17. Ziv Bar-Joseph, Michael Ben-Or
    A Tight Lower Bound for Randomized Synchronous Consensus. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:193-199 [Conf]
  18. Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
    Choice Coordination with Bounded Failure (a Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:309-316 [Conf]
  19. Michael Ben-Or
    Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1983, pp:27-30 [Conf]
  20. Michael Ben-Or
    Fast Asynchronous Byzantine Agreement (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:149-151 [Conf]
  21. Michael Ben-Or, Boaz Kelmer, Tal Rabin
    Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:183-192 [Conf]
  22. Miklós Ajtai, Michael Ben-Or
    A Theorem on Probabilistic Constant Depth Computations [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:471-474 [Conf]
  23. Dorit Aharonov, Michael Ben-Or
    Fault-Tolerant Quantum Computation With Constant Error. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:176-188 [Conf]
  24. Yonatan Aumann, Michael Ben-Or
    Computing with Faulty Arrays [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:162-169 [Conf]
  25. Michael Ben-Or
    Lower Bounds for Algebraic Computation Trees (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:80-86 [Conf]
  26. Michael Ben-Or, Richard Cleve
    Computing Algebraic Formulas Using a Constant Number of Registers [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:254-257 [Conf]
  27. Michael Ben-Or, Ran Canetti, Oded Goldreich
    Asynchronous secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:52-61 [Conf]
  28. Michael Ben-Or, Benny Chor, Adi Shamir
    On the Cryptographic Security of Single RSA Bits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:421-430 [Conf]
  29. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
    A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:340-349 [Conf]
  30. Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Wigderson
    Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:113-131 [Conf]
  31. Michael Ben-Or, Shafi Goldwasser, Avi Wigderson
    Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:1-10 [Conf]
  32. Michael Ben-Or, Avinatan Hassidim
    Fast quantum byzantine agreement. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:481-485 [Conf]
  33. Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
    Byzantine agreement in the full-information model in O(log n) rounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:179-186 [Conf]
  34. Michael Ben-Or, Prasoon Tiwari
    A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:301-309 [Conf]
  35. Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim
    The Universal Composable Security of Quantum Key Distribution. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:386-406 [Conf]
  36. Amotz Bar-Noy, Michael Ben-Or, Danny Dolev
    Choice Coordination with Limited Failure. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1989, v:3, n:2, pp:61-72 [Journal]
  37. Michael Ben-Or, Ran El-Yaniv
    Resilient-optimal interactive consistency in constant time. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:4, pp:249-262 [Journal]
  38. Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld
    Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:052, pp:- [Journal]
  39. Gadi Shamir, Michael Ben-Or, Danny Dolev
    A Safe and Scalable Payment Infrastructure for Trade of Electronic Content. [Citation Graph (0, 0)][DBLP]
    Int. J. Cooperative Inf. Syst., 1998, v:7, n:4, pp:331-354 [Journal]
  40. Michael Ben-Or, Dana Ron
    Agreement in the Presence of Faults, on Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:6, pp:329-334 [Journal]
  41. Michael Ben-Or, Prasoon Tiwari
    Simple algorithms for approximating all roots of a polynomial with real roots. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:4, pp:417-442 [Journal]
  42. Michael Ben-Or, Danny Gutfreund
    Trading Help for Interaction in Statistical Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2003, v:16, n:2, pp:95-116 [Journal]
  43. Michael Ben-Or, Richard Cleve
    Computing Algebraic Formulas Using a Constant Number of Registers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:54-58 [Journal]
  44. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
    A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1081-1092 [Journal]
  45. Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
    A fair protocol for signing contracts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:40-46 [Journal]

  46. The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well). [Citation Graph (, )][DBLP]


  47. Quantum Multi Prover Interactive Proofs with Communicating Provers. [Citation Graph (, )][DBLP]


  48. Fast self-stabilizing byzantine tolerant digital clock synchronization. [Citation Graph (, )][DBLP]


  49. A Fault-Resistant Asynchronous Clock Function. [Citation Graph (, )][DBLP]


  50. Brief Announcement: Simple Gradecast Based Algorithms. [Citation Graph (, )][DBLP]


  51. Interactive Proofs For Quantum Computations. [Citation Graph (, )][DBLP]


  52. Simple Gradecast Based Algorithms [Citation Graph (, )][DBLP]


  53. A Fault-Resistant Asynchronous Clock Function [Citation Graph (, )][DBLP]


Search in 0.724secs, Finished in 0.726secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002