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

DOI10.1007/978-3-540-70936-7_24MaRDI QIDQ3596392zbMATH OpenOpenAlexFDO

Authors Yael Gertner, Tal Malkin, Steven Myers

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Parallel decryption queries in bounded chosen ciphertext attacks
• Cryptography and Coding
• A simpler construction of CCA2-secure public-key encryption under general assumptions
• scientific article; zbMATH DE number 2009959
• Chosen‐Ciphertext Security from Identity‐Based Encryption

Cited in

(29)

• Reproducible circularly secure bit encryption: applications and realizations
• A black-box construction of non-malleable encryption from semantically secure encryption
• On the CCA compatibility of public-key infrastructure
• 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
• Parallel decryption queries in bounded chosen ciphertext attacks
• Towards non-black-box separations of public key encryption and one way function
• 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
• scientific article; zbMATH DE number 1955805 (Why is no real title available?)
• 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
• Cryptographic primitives with hinting property
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Translating between the common Haar random state model and the unitary model
• Chosen ciphertext security via BARGs
• Impossibility of post-quantum shielding black-box constructions of CCA from CPA

This page was built for publication: Towards a Separation of Semantic and CCA Security for Public Key Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596392)