Secure integration of asymmetric and symmetric encryption schemes
From MaRDI portal
Publication:1946596
DOI10.1007/s00145-011-9114-1zbMath1291.94085OpenAlexW1995261385WikidataQ121339381 ScholiaQ121339381MaRDI QIDQ1946596
Eiichiro Fujisaki, Tatsuaki Okamoto
Publication date: 15 April 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9114-1
Related Items (67)
Fast, Compact, and Expressive Attribute-Based Encryption ⋮ Decryption Failure Is More Likely After Success ⋮ Towards post-quantum security for signal's X3DH handshake ⋮ Generalized closest substring encryption ⋮ FO-like combiners and hybrid post-quantum cryptography ⋮ Efficient attribute-based proxy re-encryption with constant size ciphertexts ⋮ The wonderful world of global random oracles ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Anonymous, robust post-quantum public key encryption ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ On IND-qCCA security in the ROM and its applications. CPA security is sufficient for TLS 1.3 ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ Multi-instance secure public-key encryption ⋮ Post-quantum anonymity of Kyber ⋮ QCCA-secure generic transformations in the quantum random oracle model ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ IND-CCA security of Kyber in the quantum random oracle model, revisited ⋮ A message recovery attack on LWE/LWR-based PKE/KEMs using amplitude-modulated EM emanations ⋮ Compact and tightly selective-opening secure public-key encryption schemes ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Tight adaptive reprogramming in the QROM ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ On quantum ciphertext indistinguishability, recoverability, and OAEP ⋮ A new key recovery side-channel attack on HQC with chosen ciphertext ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Failing gracefully: decryption failures and the Fujisaki-Okamoto transform ⋮ Concrete security from worst-case to average-case lattice reductions ⋮ Tighter QCCA-secure key encapsulation mechanism with explicit rejection in the quantum random oracle model ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ Oblivious pseudorandom functions from isogenies ⋮ Receiver selective opening security for identity-based encryption in the multi-challenge setting ⋮ Non-malleable time-lock puzzles and applications ⋮ New technique for chosen-ciphertext security based on non-interactive zero-knowledge ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map ⋮ Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes ⋮ Fast, compact, and expressive attribute-based encryption ⋮ Supersingular Isogeny-based Cryptography: A Survey ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ Signcryption schemes with insider security in an ideal permutation model ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ On the Anonymity of Multi-Receiver Identity-Based Encryption Based on Fujisaki–Okamoto Transformation ⋮ Semi-generic construction of public key encryption and identity-based encryption with equality test ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Content-Based Encryption ⋮ (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes ⋮ Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes ⋮ Generic authenticated key exchange in the quantum random oracle model ⋮ Classical vs quantum random oracles ⋮ Fully secure ABE with outsourced decryption against chosen ciphertext attack ⋮ QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model ⋮ On the CCA compatibility of public-key infrastructure ⋮ Identity-based authenticated encryption with identity confidentiality ⋮ Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol ⋮ Indifferentiability for public key cryptosystems ⋮ Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists ⋮ Secure hybrid encryption in the standard model from hard learning problems
Uses Software
Cites Work
- Probabilistic encryption
- A uniform-complexity treatment of encryption and zero-knowledge
- Tag-KEM/DEM: A new framework for hybrid encryption
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Lossy trapdoor functions and their applications
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
- Chosen-Ciphertext Security via Correlated Products
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Nonmalleable Cryptography
- Secure integration of asymmetric and symmetric encryption schemes
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- The Twin Diffie-Hellman Problem and Applications
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
- How to protect DES against exhaustive key search (an analysis of DESX).
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Secure integration of asymmetric and symmetric encryption schemes