The Notion of Security for Probabilistic Cryptosystems
From MaRDI portal
Publication:3787915
DOI10.1137/0217025zbMath0644.94013OpenAlexW2055993618WikidataQ56427117 ScholiaQ56427117MaRDI QIDQ3787915
Silvio Micali, Bob Sloan, Charles W. Rackoff
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d6fbc5de4b74cc36692b23095244e0b7349cc10b
Related Items (15)
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Mathematical problems in cryptology ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Gambling, Computational Information and Encryption Security ⋮ Universally composable symbolic security analysis ⋮ Pitfalls in identity based encryption using an elliptic curve combined public key ⋮ The complexity of Grigorchuk groups with application to cryptography ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Novel \(\Omega\)-protocols for NP ⋮ Simpler session-key generation from short random passwords ⋮ A uniform-complexity treatment of encryption and zero-knowledge ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Key-Dependent Message Security for Division Function: Discouraging Anonymous Credential Sharing ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles
This page was built for publication: The Notion of Security for Probabilistic Cryptosystems
