Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
From MaRDI portal
Publication:2018816
Recommendations
- Relaxing IND-CCA: indistinguishability against chosen ciphertext verification attack
- Security in Communication Networks
- On IND-CCA security modeling in cryptographic protocols
- Parallel decryption queries in bounded chosen ciphertext attacks
- Subtleties in security definitions for predicate encryption with public index
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A simpler construction of CCA2-secure public-key encryption under general assumptions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Combining Encryption and Proof of Knowledge in the Random Oracle Model
- Cryptography and Coding
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
- Foundations of Cryptography
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 2085419 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-Based Encryption Gone Wild
- Introduction to cryptography. Principles and applications
- Introduction to modern cryptography
- Nonmalleable Cryptography
- OAEP reconsidered
- On IND-CCA security modeling in cryptographic protocols
- Optimal Asymmetric Encryption and Signature Paddings
- Probabilistic encryption
- Rerandomizable RCCA Encryption
- RSA-OAEP is secure under the RSA assumption
- Secure integration of asymmetric and symmetric encryption schemes
- Security in Communication Networks
- The Exact Security of ECIES in the Generic Group Model
- Theory of Cryptography
- Theory of Cryptography
- Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
Cited in
(15)- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication
- Tightness subtleties for multi-user PKE notions
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- 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
- On IND-CCA security modeling in cryptographic protocols
- Subtleties in security definitions for predicate encryption with public index
- Relaxing IND-CCA: indistinguishability against chosen ciphertext verification attack
- 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
- CASE: a new frontier in public-key authenticated encryption
- From polynomial IOP and commitments to non-malleable zkSNARKs
This page was built for publication: Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018816)
