Strongly secure authenticated key exchange from factoring, codes, and lattices
From MaRDI portal
Publication:494585
Recommendations
Cites work
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- A New Security Model for Authenticated Key Agreement
- Adaptive trapdoor functions and chosen-ciphertext security
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Applied Cryptography and Network Security
- Authenticated Key Exchange and Key Encapsulation in the Standard Model
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Bonsai trees, or how to delegate a lattice basis
- Chosen ciphertext secure encryption under factoring assumption revisited
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Chosen-Ciphertext Secure RSA-Type Cryptosystems
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Computational extractors and pseudorandomness
- Cryptographic extraction and key derivation: the HKDF scheme
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Efficient One-Round Key Exchange in the Standard Model
- Efficient lattice (H)IBE in the standard model
- Efficient public key encryption based on ideal lattices (extended abstract)
- Ephemeral key leakage resilient and efficient ID-AKEs that can share identities, private and master keys
- Generalized Compact Knapsacks Are Collision Resistant
- Generic one round group key exchange in the standard model
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lossy trapdoor functions and their applications
- Making the Diffie-Hellman Protocol Identity-Based
- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
- On Forward Secrecy in One-Round Key Exchange
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- One-round authenticated key exchange with strong forward secrecy in the standard model against constrained adversary
- One-round key exchange in the standard model
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Pseudorandom functions and lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Semantic security for the McEliece cryptosystem without random oracles
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Smaller decoding exponents: ball-collision decoding
- Stronger Security of Authenticated Key Exchange
- The Group of Signed Quadratic Residues and Applications
- Theory of Cryptography
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Wild McEliece
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(23)- Two-message key exchange with strong security from ideal lattices
- Multi-cast key distribution: scalable, dynamic and provably secure construction
- Post-quantum anonymity of Kyber
- Authenticated key exchange with entities from different settings and varied groups
- A simple provably secure AKE from the LWE problem
- Modeling noise-accepting key exchange
- Authenticated key exchange from ideal lattices
- Authenticated key exchange protocols based on factoring assumption
- Generic authenticated key exchange in the quantum random oracle model
- Converting PKI-based authenticated key exchange to identity-based
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Strongly secure authenticated key exchange from supersingular isogenies
- New approach to practical leakage-resilient public-key cryptography
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Strong authenticated key exchange with auxiliary inputs
- Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
- Provably Secure Key Assignment Schemes from Factoring
- Revocable hierarchical identity-based authenticated key exchange
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- Lattice-based authenticated key exchange with tight security
- Anonymity of NIST PQC round 3 KEMs
This page was built for publication: Strongly secure authenticated key exchange from factoring, codes, and lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494585)
