Strongly secure authenticated key exchange from factoring, codes, and lattices
From MaRDI portal
Publication:494585
DOI10.1007/S10623-014-9972-2zbMATH Open1344.94083OpenAlexW2051510359MaRDI QIDQ494585FDOQ494585
Koutarou Suzuki, Kazuki Yoneyama, Keita Xagawa, Atsushi Fujioka
Publication date: 1 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9972-2
Recommendations
authenticated key exchangeidentity-based authenticated key exchange\(\mathrm {CK}^+\) modelkey encapsulation mechanism
Cites Work
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- On ideal lattices and learning with errors over rings
- Public-key cryptosystems from the worst-case shortest vector problem
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Efficient public key encryption based on ideal lattices (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Title not available (Why is that?)
- Smaller Decoding Exponents: Ball-Collision Decoding
- Advances in Cryptology - EUROCRYPT 2004
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Advances in Cryptology – CRYPTO 2004
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Generalized Compact Knapsacks Are Collision Resistant
- Theory of Cryptography
- Title not available (Why is that?)
- Lossy trapdoor functions and their applications
- Title not available (Why is that?)
- Stronger Security of Authenticated Key Exchange
- Title not available (Why is that?)
- Generic one round group key exchange in the standard model
- Authenticated Key Exchange and Key Encapsulation in the Standard Model
- Applied Cryptography and Network Security
- Wild McEliece
- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Making the Diffie-Hellman Protocol Identity-Based
- Chosen-Ciphertext Secure RSA-Type Cryptosystems
- One-round key exchange in the standard model
- On Forward Secrecy in One-Round Key Exchange
- Semantic security for the McEliece cryptosystem without random oracles
- Computational Extractors and Pseudorandomness
- Pseudorandom Functions and Lattices
- Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys
- Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
- The Group of Signed Quadratic Residues and Applications
- Efficient One-Round Key Exchange in the Standard Model
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Adaptive trapdoor functions and chosen-ciphertext security
- Cryptographic extraction and key derivation: the HKDF scheme
- A New Security Model for Authenticated Key Agreement
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- One-Round Authenticated Key Exchange with Strong Forward Secrecy in the Standard Model against Constrained Adversary
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
Cited In (15)
- Revocable hierarchical identity-based authenticated key exchange
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- A simple provably secure AKE from the LWE problem
- Post-quantum anonymity of Kyber
- Post-quantum anonymous one-sided authenticated key exchange without random oracles
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Strong authenticated key exchange with auxiliary inputs
- New approach to practical leakage-resilient public-key cryptography
- Strongly secure authenticated key exchange from supersingular isogenies
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Multi-cast Key Distribution: Scalable, Dynamic and Provably Secure Construction
- Anonymity of NIST PQC round 3 KEMs
- Two-message key exchange with strong security from ideal lattices
- Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
- Provably Secure Key Assignment Schemes from Factoring
Uses Software
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)
