Michael O. Rabin

According to our database, Michael O. Rabin authored at least 62 papers between 1958 and 2014.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of two.

2014

Cryptography miracles, secure auctions, matching problem verification.

Silvio Micali, Michael O. Rabin

Commun. ACM, 2014

2012

Never too early to begin: computer science for high-school students.

Michael O. Rabin

Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions.

Michael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2009

Cryptographic Combinatorial Clock-Proxy Auctions.

David C. Parkes, Michael O. Rabin, Christopher Thorpe

Proceedings of the Financial Cryptography and Data Security, 2009

2008

Practical secrecy-preserving, verifiably correct and trustworthy auctions.

David C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe

Electron. Commer. Res. Appl., 2008

2007

DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.

Michael O. Rabin

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications.

Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2005

How To Exchange Secrets with Oblivious Transfer.

Michael O. Rabin

IACR Cryptol. ePrint Arch., 2005

Provably unbreakable hyper-encryption in the limited access model.

Michael O. Rabin

Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004

Identity-Based Zero Knowledge.

Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

2003

Zero-Knowledge Sets.

Silvio Micali, Michael O. Rabin, Joe Kilian

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Hyper Encryption and Everlasting Secrets.

Michael O. Rabin

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Everlasting security in the bounded storage model.

Yonatan Aumann, Yan Zong Ding, Michael O. Rabin

IEEE Trans. Inf. Theory, 2002

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk.

Michael A. Bender, Michael O. Rabin

Theory Comput. Syst., 2002

Hyper-Encryption and Everlasting Security.

Yan Zong Ding, Michael O. Rabin

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001

Linear-Consistency Testing.

Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan

J. Comput. Syst. Sci., 2001

2000

Scheduling Cilk multithreaded parallel programs on processors of different speeds.

Michael A. Bender, Michael O. Rabin

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999

Verifiable Random Functions.

Silvio Micali, Michael O. Rabin, Salil P. Vadhan

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Information Theoretically Secure Communication in the Limited Storage Space Model.

Yonatan Aumann, Michael O. Rabin

Proceedings of the Advances in Cryptology, 1999

1998

Lower Bounds for Randomized Mutual Exclusion.

Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman

SIAM J. Comput., 1998

Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography.

Rosario Gennaro, Michael O. Rabin, Tal Rabin

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract).

Yonatan Aumann, Michael O. Rabin

Proceedings of the Advances in Cryptology, 1998

1997

Hashing on strings, cryptography, and protection of privacy.

Michael O. Rabin

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

DNA²DNA computations: A potential "killer app?".

Laura F. Landweber, Richard J. Lipton, Michael O. Rabin

Proceedings of the DNA Based Computers, 1997

Correctness of Programs and Protocols through Randomization (Extended Abstract).

Michael O. Rabin

Proceedings of the Advances in Computing Science, 1997

1996

Computationally Hard Algebraic Problems (extended abstract).

Michael O. Rabin

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

On Lotteries with Unique Winners.

Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin

SIAM J. Discret. Math., 1995

Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach.

Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin

Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995

1994

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation.

Yonatan Aumann, Michael O. Rabin

Theor. Comput. Sci., 1994

1993

Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs

Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)

Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Randomized Mutual Exclusion Algorithms Revisited.

Eyal Kushilevitz, Michael O. Rabin

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Dependable Parallel Computing by Randomization (Abstract).

Michael O. Rabin

Proceedings of the Future Tendencies in Computer Science, 1992

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)

Yonatan Aumann, Michael O. Rabin

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Set systems with no union of cardinality 0 modulo<i>m</i>.

Noga Alon, Daniel J. Kleitman, Richard J. Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer

Graphs Comb., 1991

1989

Maximum Matchings in General Graphs Through Randomization.

Michael O. Rabin, Vijay V. Vazirani

J. Algorithms, 1989

Efficient dispersal of information for security, load balancing, and fault tolerance.

Michael O. Rabin

J. ACM, 1989

Biased Coins and Randomized Algorithms.

Noga Alon, Michael O. Rabin

Adv. Comput. Res., 1989

ITOSS: An Integrated Toolkit For Operating System Security.

Michael O. Rabin, J. D. Tygar

Proceedings of the Foundations of Data Organization and Algorithms, 1989

1987

Efficient Randomized Pattern-Matching Algorithms.

Richard M. Karp, Michael O. Rabin

IBM J. Res. Dev., 1987

A Logic to Reason about Likelihood.

Joseph Y. Halpern, Michael O. Rabin

Artif. Intell., 1987

Achieving Independence in Logarithmic Number of Rounds.

Benny Chor, Michael O. Rabin

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1983

Transaction Protection by Beacons.

Michael O. Rabin

J. Comput. Syst. Sci., 1983

Randomized Byzantine Generals

Michael O. Rabin

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable.

Michael O. Rabin

J. Comput. Syst. Sci., 1982

The Choice Coordination Problem.

Michael O. Rabin

Acta Informatica, 1982

1981

On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem.

Daniel Lehmann, Michael O. Rabin

Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981

1980

Probabilistic Algorithms in Finite Fields.

Michael O. Rabin

SIAM J. Comput., 1980

N-Process Synchronization by 4 log _2 N-Valued Shared Variables

Michael O. Rabin

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1977

Complexity of Computations.

Michael O. Rabin

Commun. ACM, 1977

1974

A Characterization of the Power of Vector Machines

Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Theoretical Impediments to Artificial Intelligence.

Michael O. Rabin

Proceedings of the Information Processing, 1974

1972

Proving Simultaneous Positivity of Linear Forms.

Michael O. Rabin

J. Comput. Syst. Sci., 1972

Solving Linear Equations by Means of Scalar Products.

Michael O. Rabin

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971

Meeting of the Association for Symbolic Logic.

Michael O. Rabin, Michael D. Morley

J. Symb. Log., 1971

1966

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.

Calvin C. Elgot, Michael O. Rabin

J. Symb. Log., 1966

1963

Probabilistic Automata

Michael O. Rabin

Inf. Control., September, 1963

The Theory of Definite Automata.

Micha A. Perles, Michael O. Rabin, Eliahu Shamir

IEEE Trans. Electron. Comput., 1963

Words in the History of a Turing Machine with a Fixed Input.

Michael O. Rabin, Hao Wang

J. ACM, 1963

1959

Finite Automata and Their Decision Problems.

Michael O. Rabin, Dana S. Scott

IBM J. Res. Dev., 1959

On Codes for Checking Logical Operations.

W. Wesley Peterson, Michael O. Rabin

IBM J. Res. Dev., 1959

1958

On Recursively Enumerable and Arithmetic Models of Set Theory.

Michael O. Rabin

J. Symb. Log., 1958