Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?

DOI10.1007/S00145-013-9167-4zbMath1308.94059DBLPjournals/joc/BellareHK15OpenAlexW2047323326WikidataQ59163661 ScholiaQ59163661MaRDI QIDQ2018816

Eike Kiltz, Mihir Bellare, Dennis Hofheinz

Publication date: 25 March 2015

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9167-4

zbMATH Keywords

foundationsencryptionchosen-ciphertext attackdefinitions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Tightness subtleties for multi-user PKE notions ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Multi-instance secure public-key encryption ⋮ On quantum ciphertext indistinguishability, recoverability, and OAEP ⋮ A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack ⋮ Joint state composition theorems for public-key encryption and digital signature functionalities with local computation ⋮ Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption ⋮ Beyond Provable Security Verifiable IND-CCA Security of OAEP ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Generic transformation from broadcast encryption to round-optimal deniable ring authentication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simpler construction of CCA2-secure public-key encryption under general assumptions
• Probabilistic encryption
• OAEP reconsidered
• RSA-OAEP is secure under the RSA assumption
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Identity-Based Encryption Gone Wild
• Optimal Asymmetric Encryption and Signature Paddings
• Rerandomizable RCCA Encryption
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• The Exact Security of ECIES in the Generic Group Model
• Foundations of Cryptography
• Combining Encryption and Proof of Knowledge in the Random Oracle Model
• Secure integration of asymmetric and symmetric encryption schemes
• Advances in Cryptology – CRYPTO 2004
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Advances in Cryptology - CRYPTO 2003
• Cryptography and Coding
• Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
• Security in Communication Networks
• Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
• Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
• Theory of Cryptography
• Theory of Cryptography
• Introduction to cryptography. Principles and applications

This page was built for publication: Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?