Towards plaintext-aware public-key encryption without random oracles

DOI10.1007/978-3-540-30539-2_4MaRDI QIDQ5465837zbMATH OpenOpenAlexFDO

Authors M. Bellare, Adriana Palacio

Publication date 12 August 2005

Full work available at URL https://doi.org/10.1007/978-3-540-30539-2_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Relations Among Notions of Plaintext Awareness
• Security models and proof strategies for plaintext-aware encryption
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Plaintext-awareness of hybrid encryption
• Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption

Cited in

(43)

• Robust encryption
• Secure integration of asymmetric and symmetric encryption schemes
• An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
• Generic transformation from broadcast encryption to round-optimal deniable ring authentication
• An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
• Succinct non-interactive arguments via linear interactive proofs
• How to construct secure proxy cryptosystem
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Security models and proof strategies for plaintext-aware encryption
• A new framework for deniable secure key exchange
• Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
• On the existence of extractable one-way functions
• On CCA-Secure Somewhat Homomorphic Encryption
• Public-key encryption indistinguishable under plaintext-checkable attacks
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• A Brief History of Provably-Secure Public-Key Encryption
• Relationship between Two Approaches for Defining the Standard Model PA-ness
• Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Polylogarithmic two-round argument systems
• On ciphertext undetectability
• Salvaging Merkle-Damgård for Practical Applications
• Minimizing the use of random oracles in authenticated encryption schemes
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Toward RSA-OAEP without random oracles
• Plaintext-awareness of hybrid encryption
• A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
• Advances in Cryptology - CRYPTO 2003
• Relations Among Notions of Plaintext Awareness
• Relationship Between Standard Model Plaintext Awareness and Message Hiding
• Hybrid Damgård Is CCA1-Secure under the DDH Assumption
• A CCA Secure Hybrid Damgård’s ElGamal Encryption
• PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity
• Post-quantum plaintext-awareness
• From plaintext-extractability to IND-CCA security
• Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
• Fully homomorphic encryption with chosen-ciphertext security from LWE
• Leveraging small message spaces for cca1 security in additively homomorphic and bgn-type encryption
• Hybrid encryption in correlated randomness model and KEM combiners
• On the security of homomorphic encryption schemes with restricted decryption oracles
• Chosen ciphertext security via BARGs
• The uber-knowledge assumption: a bridge to the AGM
• On new variants of FuncCPA security and related CCA-secure constructions

This page was built for publication: Towards plaintext-aware public-key encryption without random oracles

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