The Notion of Security for Probabilistic Cryptosystems

1988/04/01 by Silvio Micali, Charles Rackoff, Bob Sloan
Computer Science · #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Computability, Logic, AI Algorithms

paper · doi:10.1137/0217025

Abstract

Three very different formal definitions of security for public-key cryptosystems have been proposed—two by Goldwasser and Micali and one by Yao. We prove all of them to be equivalent. This equivalence provides evidence that the right formalization of the notion of security has been reached.

Citations

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• New directions in cryptography
• Probabilistic encryption

Related

• Probability theory and public-key cryptography
• Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
• Toward a Mathematical Foundation for Information Flow Security
• Defining Security in Quantum Key Distribution
• Reasoning about Probabilistic Defense Mechanisms against Remote Attacks