Strongly secure authenticated key exchange from factoring, codes, and lattices
From MaRDI portal
Publication:494585
DOI10.1007/s10623-014-9972-2zbMath1344.94083MaRDI QIDQ494585
Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Kazuki Yoneyama
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
authenticated key exchange; identity-based authenticated key exchange; \(\mathrm {CK}^+\) model; key encapsulation mechanism
94A62: Authentication, digital signatures and secret sharing
Related Items
A simple provably secure AKE from the LWE problem, Multi-cast Key Distribution: Scalable, Dynamic and Provably Secure Construction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Semantic security for the McEliece cryptosystem without random oracles
- One-round key exchange in the standard model
- Computational Extractors and Pseudorandomness
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Ephemeral Key Leakage Resilient and Efficient ID-AKEs That Can Share Identities, Private and Master Keys
- Wild McEliece
- Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited
- On Forward Secrecy in One-Round Key Exchange
- The Group of Signed Quadratic Residues and Applications
- Authenticated Key Exchange and Key Encapsulation in the Standard Model
- Stronger Security of Authenticated Key Exchange
- Efficient One-Round Key Exchange in the Standard Model
- Lossy trapdoor functions and their applications
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security
- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead
- Generic One Round Group Key Exchange in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Cryptographic Extraction and Key Derivation: The HKDF Scheme
- A New Security Model for Authenticated Key Agreement
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Efficient Public Key Encryption Based on Ideal Lattices
- Chosen-Ciphertext Secure RSA-Type Cryptosystems
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Applied Cryptography and Network Security
- One-Round Authenticated Key Exchange with Strong Forward Secrecy in the Standard Model against Constrained Adversary
- Public-key cryptosystems from the worst-case shortest vector problem
- Making the Diffie-Hellman Protocol Identity-Based
- Smaller Decoding Exponents: Ball-Collision Decoding
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Advances in Cryptology - CRYPTO 2003
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
