Bounded CCA2-Secure Encryption

DOI10.1007/978-3-540-76900-2_31MaRDI QIDQ3498396zbMATH OpenOpenAlexWikidataFDO

Authors Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan, Hideki Imai

Publication date 15 May 2008

Published in Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Parallel decryption queries in bounded chosen ciphertext attacks
• Bit Encryption Is Complete
• Advances in Cryptology - CRYPTO 2003
• A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
• Blackbox construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness

Cited in

(31)

• A black-box construction of non-malleable encryption from semantically secure encryption
• Revisiting (R)CCA security and replay protection
• Authenticated key exchange and signatures with tight security in the standard model
• CCA-secure ABE using tag and pair encoding
• Dynamic collusion bounded functional encryption from identity-based encryption
• On IND-qCCA security in the ROM and its applications. CPA security is sufficient for TLS 1.3
• Optimal bounded-collusion secure functional encryption
• Non-malleable encryption: simpler, shorter, stronger
• Improved, black-box, non-malleable encryption from semantic security
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy
• Towards tight adaptive security of non-interactive key exchange
• Non-malleable encryption: simpler, shorter, stronger
• Combiners for chosen-ciphertext security
• Spooky Encryption and Its Applications
• On CCA-Secure Somewhat Homomorphic Encryption
• Two-dimensional representation of cover free families and its applications: short signatures and more
• Parallel decryption queries in bounded chosen ciphertext attacks
• Compact Proofs of Retrievability
• On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
• A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
• Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
• Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
• Security with functional re-encryption from CPA
• A survey of cover-free families: constructions, applications, and generalizations
• Fast public-key silent OT and more from constrained Naor-Reingold
• Quantum public-key encryption with tamper-resilient public keys from one-way functions
• Dynamic bounded-collusion streaming functional encryption from minimal assumptions
• Quantum CCA-secure PKE, revisited
• Hybrid encryption in correlated randomness model and KEM combiners
• Traceable threshold encryption without a trusted dealer
• Verifiable random functions: relations to identity-based key encapsulation and new constructions

This page was built for publication: Bounded CCA2-Secure Encryption

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