2020 - ACM Fellow For fundamental, pioneering contributions to the theory of computation, probabilistic algorithms, and cryptography
2007 - Fellow of the Royal Society, United Kingdom
2003 - ACM Paris Kanellakis Theory and Practice Award Development of efficient randomized tests of primality
1984 - Member of the National Academy of Sciences
1976 - A. M. Turing Award Along with Dana S. Scott, for their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.
1975 - Fellow of the American Academy of Arts and Sciences
His primary scientific interests are in Discrete mathematics, Algorithm, Algebra, Automaton and Cryptography. His Discrete mathematics research includes elements of Solovay–Strassen primality test and Primality test. His Algorithm course of study focuses on Load balancing and Fault tolerance and Data slice.
His work carried out in the field of Algebra brings together such families of science as Computable model theory, Computable analysis and Church's thesis. His study on Sequential calculus and Monadic second-order logic is often connected to Emptiness and Monadic predicate calculus as part of broader study in Automaton. The study incorporates disciplines such as Alice and Bob and Alice in addition to Cryptography.
Michael O. Rabin mainly investigates Discrete mathematics, Theoretical computer science, Computer security, Algorithm and Cryptography. Michael O. Rabin is studying Decidability, which is a component of Discrete mathematics. His Theoretical computer science research includes themes of Distributed computing, Correctness, Bounded function, Protocol and Computation.
He has researched Computer security in several fields, including Beacon and Internet privacy. His work on Randomized algorithm as part of general Algorithm research is often related to Information dispersal, thus linking different fields of science. Michael O. Rabin has included themes like Hash function and Encryption, Secure communication in his Cryptography study.
His scientific interests lie mostly in Computer security, Theoretical computer science, Encryption, Cryptography and Hyper-encryption. His Computer security study incorporates themes from Identifier and Internet privacy. His Theoretical computer science study combines topics in areas such as End-to-end principle, Algorithm, Correctness, Computation and Quantum complexity theory.
His study in Algorithm is interdisciplinary in nature, drawing from both Value, Discrete mathematics and Verifiable secret sharing. His Discrete mathematics research is multidisciplinary, relying on both Class and Faithful representation, Pure mathematics. His Cryptography study integrates concerns from other disciplines, such as Trusted third party and Ciphertext.
Michael O. Rabin focuses on Computer security, Oblivious transfer, Alice and Bob, Shared secret and Key. His Computer security research incorporates elements of Identifier, Software and User device. His Oblivious transfer study contributes to a more complete understanding of Algorithm.
His studies in Algorithm integrate themes in fields like Theoretical computer science and Encryption. His research integrates issues of Computation and Computer security model in his study of Encryption. His biological study spans a wide range of topics, including Key generation and Pre-shared key, Key exchange, Key distribution.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Finite automata and their decision problems
M. O. Rabin;D. Scott.
Ibm Journal of Research and Development (1959)
Efficient dispersal of information for security, load balancing, and fault tolerance
Michael O. Rabin.
Journal of the ACM (1989)
How to Exchange Secrets with Oblivious Transfer
Michael O. Rabin.
IACR Cryptology ePrint Archive (1981)
Efficient randomized pattern-matching algorithms
Richard M. Karp;Michael O. Rabin.
Ibm Journal of Research and Development (1987)
Decidability of second-order theories and automata on infinite trees.
Michael O. Rabin.
Transactions of the American Mathematical Society (1969)
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
M. O. Rabin.
MIT Laboratory for Computer Science (1979)
Scheme for information dispersal and reconstruction
Michael O. Rabin.
(1991)
Probabilistic algorithm for testing primality
Michael O Rabin;Michael O Rabin.
Journal of Number Theory (1980)
Randomized byzantine generals
Michael O. Rabin.
foundations of computer science (1983)
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Rosario Gennaro;Michael O. Rabin;Tal Rabin.
principles of distributed computing (1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Harvard University
Tel Aviv University
Technion – Israel Institute of Technology
Harvard University
New York University
Harvard University
Royal Institute of Technology
The University of Texas at Austin
Stony Brook University
Columbia University
Utrecht University
University of Göttingen
Purdue University West Lafayette
Monash University
Illinois State University
Kansas State University
Texas Tech University
Newcastle University
Saarland University
International Centre for Diarrhoeal Disease Research
Oklahoma State University
Universidade de São Paulo
University of Canberra
University of Iowa
California Institute of Technology
Paul Scherrer Institute