Bounded CCA2-Secure Encryption

DOI10.1007/978-3-540-76900-2_31zbMath1153.94363WikidataQ59163756 ScholiaQ59163756MaRDI QIDQ3498396

Vinod Vaikuntanathan, Dennis Hofheinz, Abhi Shelat, Eike Kiltz, Goichiro Hanaoka, Ronald Cramer, Rafael Pass, Hiroshi 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

94A60: Cryptography

Related Items

Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk), Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions, Verifiable random functions: relations to identity-based key encapsulation and new constructions, A black-box construction of non-malleable encryption from semantically secure encryption, Optimal bounded-collusion secure functional encryption, Improved, black-box, non-malleable encryption from semantic security, A unified approach to deterministic encryption: new constructions and a connection to computational entropy, Non-Malleable Encryption: Simpler, Shorter, Stronger, Combiners for Chosen-Ciphertext Security, Spooky Encryption and Its Applications, Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More, Compact Proofs of Retrievability, On the Security of Padding-Based Encryption Schemes – or – Why We Cannot Prove OAEP Secure in the Standard Model