Live briefing
Everything about Adaptive chosen-ciphertext attack
Cryptographic attack
An adaptive chosen-ciphertext attack is an interactive form of chosen-ciphertext attack in which an attacker first sends a number of ciphertexts to be decrypted chosen adaptively and then uses the results to distinguish a target ciphertext without consulting the oracle on the challenge ciphertext. In an adaptive attack, the attacker is further allowed adaptive queries to be asked after the target is revealed. It is extending the indifferent (non-adaptive) chosen-ciphertext attack (CCA1), where the second stage of adaptive queries is not allowed. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Adaptive chosen-ciphertext attackA 5-minute orientation
- Skim a recent paper: Post-Quantum Authenticated Encryption against Chosen-Ciphertext Side-Channel AttacksInfluential work since 2022
- Pick up a classic book: Information Security and PrivacyThe most-reprinted book on the subject
- Read the landmark paper: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext AttackCited 677 times
- Go sideways: Chosen-ciphertext attackA closely related topic
- Go sideways: Padding oracle attackA closely related topic
📖 Definitions
Noun An attack on a cryptosystem that relies on the attacker's ability to choose any ciphertext of their liking and decrypt it into the corresponding plaintext with that system and key. More powerful than a chosen-plaintext attack.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Securing Threshold Cryptosystems against Chosen Ciphertext Attack
Chosen Ciphertext k-Trace Attacks on Masked CCA2 Secure Kyber
Universal Chosen-Ciphertext Attack for a Family of Image Encryption Schemes
Chosen ciphertext attack on chaos communication based on chaotic synchronization
Adaptive Chosen-Ciphertext Attack on Secure Arithmetic Coding
Immunizing public key cryptosystems against chosen ciphertext attacks
Chosen-Ciphertext Clustering Attack on CRYSTALS-KYBER Using the Side-Channel Leakage of Barrett Reduction
🆕 Influential since 2022
Post-Quantum Authenticated Encryption against Chosen-Ciphertext Side-Channel Attacks
Security of COFB against Chosen Ciphertext Attacks
Chosen-Ciphertext Attack Secure Public-Key Encryption with Keyword Search
A Chosen-Ciphertext Attack for Chaos-Based Image Encryption
Indistinguishability under adaptive chosen-ciphertext attack secure double-NTRU-based key encapsulation mechanism
📚 Books worth reading
Information Security and PrivacyColin Boyd · 2005
Security, Privacy, and Applied Cryptography EngineeringAndrey Bogdanov · 2012
Public-Key Cryptography – PKC 2013Kaoru Kurosawa · 2013
Topics in Cryptology – CT-RSA 2013Ed Dawson · 2013- 📕Information, Coding and MathematicsRobert J. McEliece, Mario Blaum · 2002
Advances in Cryptology – EUROCRYPT 2013Thomas Johansson · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Chosen-ciphertext attack A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst can gather information by obtaining the decryptions of…
- Padding oracle attack In cryptography, a padding oracle attack is an attack which uses the padding validation of a cryptographic message to decrypt the ciphertext. In cryptography…
- PKCS 1 In cryptography, PKCS #1 is the first of a family of standards called Public-Key Cryptography Standards (PKCS), published by RSA Laboratories. It provides…
- Cramer–Shoup cryptosystem The Cramer–Shoup system is an asymmetric key encryption algorithm, and was the first efficient scheme proven to be secure against adaptive chosen ciphertext…
- Optimal asymmetric encryption padding In cryptography, optimal asymmetric encryption padding (OAEP) is a padding scheme often used together with RSA encryption. OAEP was introduced by Bellare…
- Ciphertext indistinguishability Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability…
- Daniel Bleichenbacher Daniel Bleichenbacher (born 1964) is a Swiss cryptographer, previously a researcher at Bell Labs and Google, and currently employed at Cure53. He received…
- Semantic security In cryptography, a semantically secure cryptosystem is one where only negligible information about the plaintext can be feasibly extracted from the ciphertext…