Secure integration of asymmetric and symmetric encryption schemes

DOI10.1007/s00145-011-9114-1zbMath1291.94085WikidataQ121339381 ScholiaQ121339381MaRDI QIDQ1946596

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

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Fast, Compact, and Expressive Attribute-Based Encryption, Decryption Failure Is More Likely After Success, Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber, Supersingular Isogeny-based Cryptography: A Survey, On the Anonymity of Multi-Receiver Identity-Based Encryption Based on Fujisaki–Okamoto Transformation, Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption, Implicit rejection in Fujisaki-Okamoto: framework and a novel realization, KDM security for the Fujisaki-Okamoto transformations in the QROM, 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, Generalized closest substring encryption, Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol, Towards post-quantum security for signal's X3DH handshake, The wonderful world of global random oracles, 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, CCA-security from adaptive all-but-one lossy trapdoor functions, (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, 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, FO-like combiners and hybrid post-quantum cryptography, Efficient attribute-based proxy re-encryption with constant size ciphertexts, 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, 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, Classical misuse attacks on NIST round 2 PQC. The power of rank-based schemes, Fast, compact, and expressive attribute-based encryption, Semi-generic construction of public key encryption and identity-based encryption with equality test, Algebraic generalization of Diffie-Hellman key exchange, 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, Content-Based Encryption, Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction, Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map

Uses Software

KEM-DEM

Cites Work