CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors

DOI10.1007/978-3-030-64837-4_6OpenAlexW3112482900MaRDI QIDQ2692341

Sebastian Ramacher, Valerio Cini, Daniel Slamanig, Christoph Striecks

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64837-4_6

zbMATH Keywords

puncturable encryptionFujisaki-Okamoto transformCPA-to-CCA transformationsnon-negligible correctness error

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Fine-grained forward secrecy: allow-list/deny-list encryption and applications ⋮ Symmetric Key Exchange with Full Forward Security and Robust Synchronization ⋮ Unique-path identity based encryption with applications to strongly secure messaging ⋮ Incremental symmetric puncturable encryption with support for unbounded number of punctures

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
• Hardness vs randomness
• Tightly-secure key-encapsulation mechanism in the quantum random oracle model
• A reaction attack on the QC-LDPC McEliece cryptosystem
• Identity-based encryption from codes with rank metric
• A modular analysis of the Fujisaki-Okamoto transformation
• Secure integration of asymmetric and symmetric encryption schemes
• Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
• Generic authenticated key exchange in the quantum random oracle model
• Chosen ciphertext security from injective trapdoor functions
• A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM
• Tighter proofs of CCA security in the quantum random oracle model
• A novel CCA attack using decryption errors against LAC
• A reaction attack against cryptosystems based on LRPC codes
• Assessment of the key-reuse resilience of NewHope
• Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
• On the decoding failure rate of QC-MDPC bit-flipping decoders
• Quantum security proofs using semi-classical oracles
• Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• On the Security of the TLS Protocol: A Systematic Analysis
• On the Security of TLS-DHE in the Standard Model
• Efficient Identity-Based Encryption over NTRU Lattices
• A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
• Random Oracles in a Quantum World
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Secure integration of asymmetric and symmetric encryption schemes
• Public-Key Puncturable Encryption: Modular and Compact Constructions
• Benchmarking Post-quantum Cryptography in TLS
• Decryption Failure Is More Likely After Success
• A Note on Perfect Correctness by Derandomization
• 0-RTT Key Exchange with Full Forward Secrecy
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Space/time trade-offs in hash coding with allowable errors
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
• Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange

This page was built for publication: CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors