Bounded CCA2-Secure Encryption
From MaRDI portal
Publication:3498396
DOI10.1007/978-3-540-76900-2_31zbMATH Open1153.94363OpenAlexW1585474545WikidataQ59163756 ScholiaQ59163756MaRDI QIDQ3498396FDOQ3498396
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
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 (27)
- Non-malleable encryption: simpler, shorter, stronger
- On CCA-Secure Somewhat Homomorphic Encryption
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Security with functional re-encryption from CPA
- A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme
- Authenticated key exchange and signatures with tight security in the standard model
- Non-malleable encryption: simpler, shorter, stronger
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
- Combiners for chosen-ciphertext security
- Compact Proofs of Retrievability
- Improved, black-box, non-malleable encryption from semantic security
- A survey of cover-free families: constructions, applications, and generalizations
- On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- CCA-secure ABE using tag and pair encoding
- Spooky Encryption and Its Applications
- On IND-qCCA security in the ROM and its applications. CPA security is sufficient for TLS 1.3
- Fast public-key silent OT and more from constrained Naor-Reingold
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Revisiting (R)CCA security and replay protection
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Towards tight adaptive security of non-interactive key exchange
- Quantum public-key encryption with tamper-resilient public keys from one-way functions
- Dynamic collusion bounded functional encryption from identity-based encryption
- Optimal bounded-collusion secure functional encryption
- Parallel decryption queries in bounded chosen ciphertext attacks
- A black-box construction of non-malleable encryption from semantically secure encryption
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)
