Michael O. Rabin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 67 from 67

2014

Cryptography miracles, secure auctions, matching problem verificationSilvio Micali, Michael O. Rabin. CACM, 57(2):85-93, 2014. [doi]

2012

Never too early to begin: computer science for high-school studentsMichael O. Rabin. iticse 2012: 1 [doi]

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial TransactionsMichael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung. icalp 2012: 738-749 [doi]

2009

Cryptographic Combinatorial Clock-Proxy AuctionsDavid C. Parkes, Michael O. Rabin, Christopher Thorpe. fc 2009: 305-324 [doi]

2008

Practical secrecy-preserving, verifiably correct and trustworthy auctionsDavid C. Parkes, Michael O. Rabin, Stuart M. Shieber, Christopher Thorpe. ecra, 7(3):294-312, 2008. [doi]

2007

DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed SystemsMichael O. Rabin. wdag 2007: 506-508 [doi]

Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and ApplicationsMichael O. Rabin, Rocco A. Servedio, Christopher Thorpe. lics 2007: 63-76 [doi]

2006

Practical secrecy-preserving, verifiably correct and trustworthy auctionsDavid C. Parkes, Michael O. Rabin, Stuart M. Shieber, C. A. Thorpe. ACMicec 2006: 70-81 [doi]

2005

How To Exchange Secrets with Oblivious TransferMichael O. Rabin. iacr, 2005:187, 2005. [doi]

Provably unbreakable hyper-encryption in the limited access modelMichael O. Rabin. icits 2005: 34-37 [doi]

2004

Identity-Based Zero KnowledgeJonathan Katz, Rafail Ostrovsky, Michael O. Rabin. scn 2005: 180-192 [doi]

2003

Zero-Knowledge SetsSilvio Micali, Michael O. Rabin, Joe Kilian. focs 2003: 80-91 [doi]

Hyper Encryption and Everlasting SecretsMichael O. Rabin. ciac 2003: 7-10 [doi]

2002

Everlasting security in the bounded storage modelYonatan Aumann, Yan Zong Ding, Michael O. Rabin. TIT, 48(6):1668-1680, 2002.

Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to CilkMichael A. Bender, Michael O. Rabin. mst, 35(3):289-304, 2002. [doi]

Hyper-Encryption and Everlasting SecurityYan Zong Ding, Michael O. Rabin. STACS 2002: 1-26 [doi]

2001

Linear-Consistency TestingYonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan. jcss, 62(4):589-607, 2001.

2000

Scheduling Cilk multithreaded parallel programs on processors of different speedsMichael A. Bender, Michael O. Rabin. spaa 2000: 13-21 [doi]

1999

1998

Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)Yonatan Aumann, Michael O. Rabin. crypto 1998: 299-303 [doi]

Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold CryptographyRosario Gennaro, Michael O. Rabin, Tal Rabin. podc 1998: 101-111 [doi]

Lower Bounds for Randomized Mutual ExclusionEyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman. SICOMP, 27(6):1550-1563, 1998. [doi]

1997

2DNA computations: A potential "killer app?"Laura F. Landweber, Richard J. Lipton, Michael O. Rabin. dimacs 1999: 161-172

Correctness of Programs and Protocols through Randomization (Extended Abstract)Michael O. Rabin. asian 1997: 1-3

Hashing on strings, cryptography, and protection of privacyMichael O. Rabin. sequences 1997: [doi]

1996

Computationally Hard Algebraic Problems (extended abstract)Michael O. Rabin. focs 1996: 284-289

1995

Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance ApproachPartha Dasgupta, Zvi M. Kedem, Michael O. Rabin. icdcs 1995: 467-474

On Lotteries with Unique WinnersEyal Kushilevitz, Yishay Mansour, Michael O. Rabin. siamdm, 8(1):93-98, 1995. [doi]

1994

Clock Construction in Fully Asynchronous Parallel Systems and PRAM SimulationYonatan Aumann, Michael O. Rabin. TCS, 128(1&2):3-30, 1994.

1993

Highly Efficient Asynchronous Execution of Large-Grained Parallel ProgramsYonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin. focs 1993: 271-280

Lower bounds for randomized mutual exclusionEyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman. stoc 1993: 154-163 [doi]

1992

Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)Yonatan Aumann, Michael O. Rabin. focs 1992: 147-156

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan. stoc 1992: 306-317

Randomized Mutual Exclusion Algorithms RevisitedEyal Kushilevitz, Michael O. Rabin. podc 1992: 275-283

Dependable Parallel Computing by Randomization (Abstract)Michael O. Rabin. inria 1992: 19-20

1991

mNoga Alon, Daniel J. Kleitman, Richard Lipton, Roy Meshulam, Michael O. Rabin, Joel H. Spencer. gc, 7(2):97-99, 1991. [doi]

1989

Biased Coins and Randomized AlgorithmsNoga Alon, Michael O. Rabin. acr, 5:499-507, 1989.

ITOSS: An Integrated Toolkit For Operating System SecurityMichael O. Rabin, J. D. Tygar. fodo 1989: 2-15

Efficient dispersal of information for security, load balancing, and fault toleranceMichael O. Rabin. JACM, 36(2):335-348, 1989. [doi]

Maximum Matchings in General Graphs Through RandomizationMichael O. Rabin, Vijay V. Vazirani. jal, 10(4):557-567, 1989.

1987

Achieving Independence in Logarithmic Number of RoundsBenny Chor, Michael O. Rabin. podc 1987: 260-268

A Logic to Reason about LikelihoodJoseph Y. Halpern, Michael O. Rabin. ai, 32(3):379-405, 1987.

Efficient Randomized Pattern-Matching AlgorithmsRichard M. Karp, Michael O. Rabin. ibmrd, 31(2):249-260, 1987.

1983

A Logic to Reason about LikelihoodJoseph Y. Halpern, Michael O. Rabin. stoc 1983: 310-319

Randomized Byzantine GeneralsMichael O. Rabin. focs 1983: 403-409

Transaction Protection by BeaconsMichael O. Rabin. jcss, 27(2):256-267, 1983.

1982

The Choice Coordination ProblemMichael O. Rabin. ACTA, 17:121-134, 1982.

N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared VariableMichael O. Rabin. jcss, 25(1):66-75, 1982.

1981

On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers ProblemDaniel J. Lehmann, Michael O. Rabin. POPL 1981: 133-138

1980

N-Process Synchronization by 4 log _2 N-Valued Shared VariablesMichael O. Rabin. focs 1980: 407-410

Probabilistic Algorithms in Finite FieldsMichael O. Rabin. SICOMP, 9(2):273-280, 1980.

1977

Complexity of ComputationsMichael O. Rabin. CACM, 20(9):625-633, 1977.

1974

A Characterization of the Power of Vector MachinesVaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer. stoc 1974: 122-134

Theoretical Impediments to Artificial IntelligenceMichael O. Rabin. ifip 1974: 615-619

1972

Proving Simultaneous Positivity of Linear FormsMichael O. Rabin. jcss, 6(6):639-650, 1972.

Solving Linear Equations by Means of Scalar ProductsMichael O. Rabin. coco 1972: 11-20

1971

Meeting of the Association for Symbolic LogicMichael O. Rabin, Michael Morley. JSYML, 36(4):696-710, 1971.

1966

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) SuccessorCalvin C. Elgot, Michael O. Rabin. JSYML, 31(2):169-181, 1966.

1963

The Theory of Definite AutomataMicha A. Perles, Michael O. Rabin, Eliahu Shamir. TC, 12(3):233-243, 1963. [doi]

Probabilistic AutomataMichael O. Rabin. iandc, 6(3):230-245, September 1963.

Words in the History of a Turing Machine with a Fixed InputMichael O. Rabin, Hao Wang. JACM, 10(4):526-527, 1963. [doi]

1959

On Codes for Checking Logical OperationsW. Wesley Peterson, Michael O. Rabin. ibmrd, 3(2):163-168, 1959. [doi]

Finite Automata and Their Decision ProblemsMichael O. Rabin, Dana Scott. ibmrd, 3(2):114-125, 1959. [doi]

1958

On Recursively Enumerable and Arithmetic Models of Set TheoryMichael O. Rabin. JSYML, 23(4):408-416, 1958.

Sign in or sign up to see more results.

runs on WebDSL