Cryptography and Coding
From MaRDI portal
Publication:5428158
DOI10.1007/b93924zbMath1123.94336OpenAlexW2478032277MaRDI QIDQ5428158
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b93924
Related Items (32)
On CCA-Secure Somewhat Homomorphic Encryption ⋮ Memory-Tight Reductions for Practical Key Encapsulation Mechanisms ⋮ Decryption Failure Is More Likely After Success ⋮ Rogue Decryption Failures: Reconciling AE Robustness Notions ⋮ Sponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Post-quantum anonymity of Kyber ⋮ Offline Assisted Group Key Exchange ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization ⋮ Generic constructions of identity-based and certificateless kEMs ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack ⋮ Failing gracefully: decryption failures and the Fujisaki-Okamoto transform ⋮ Wildcarded identity-based encryption ⋮ Tighter QCCA-secure key encapsulation mechanism with explicit rejection in the quantum random oracle model ⋮ Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ NTRU prime: reducing attack surface at low cost ⋮ Efficient Certificateless KEM in the Standard Model ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ Signcryption schemes with insider security in an ideal permutation model ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ Efficient KEMs with Partial Message Recovery ⋮ Randomness Reuse: Extensions and Improvements ⋮ (One) failure is not an option: bootstrapping the search for failures in lattice-based 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 ⋮ QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model ⋮ Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
This page was built for publication: Cryptography and Coding
