Towards a Separation of Semantic and CCA Security for Public Key Encryption

From MaRDI portal
Revision as of 04:32, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3596392


DOI10.1007/978-3-540-70936-7_24zbMath1129.94021MaRDI QIDQ3596392

Yael Gertner, Steven Myers, Tal Malkin

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_24


94A60: Cryptography

68P25: Data encryption (aspects in computer science)


Related Items

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness, Structure Versus Hardness Through the Obfuscation Lens, Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions, CCA security and trapdoor functions via key-dependent-message security, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, Reproducible circularly secure bit encryption: applications and realizations, A black-box construction of non-malleable encryption from semantically secure encryption, Black-box use of one-way functions is useless for optimal fair coin-tossing, On black-box extension of a non-interactive zero-knowledge proof system for secret equality, On the complexity of collision resistant hash functions: new and old black-box separations, CPA-to-CCA transformation for KDM security, Non-malleable encryption: simpler, shorter, stronger, Reconciling non-malleability with homomorphic encryption, Improved, black-box, non-malleable encryption from semantic security, On constructing one-way permutations from indistinguishability obfuscation, Non-Malleable Encryption: Simpler, Shorter, Stronger, On Constructing One-Way Permutations from Indistinguishability Obfuscation, Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs, Reproducible Circularly-Secure Bit Encryption: Applications and Realizations, On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model, On the Theoretical Gap between Group Signatures with and without Unlinkability