Lattice-based authenticated key exchange with tight security
From MaRDI portal
Publication:6190151
DOI10.1007/978-3-031-38554-4_20OpenAlexW4385654388MaRDI QIDQ6190151
Runzhi Zeng, Jia-xin Pan, Benedikt Wagner
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_20
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signed Diffie-Hellman key exchange with tight security
- Practical isogeny-based key-exchange with optimal tightness
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Two-round PAKE from approximate SPH and instantiations from lattices
- CSIDH: an efficient post-quantum commutative group action
- Hash proof systems over lattices revisited
- Practical and tightly-secure digital signatures and authenticated key exchange
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
- Generic authenticated key exchange in the quantum random oracle model
- Tightly-secure authenticated key exchange, revisited
- Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols
- Authenticated key exchange and signatures with tight security in the standard model
- Highly efficient key exchange protocols with optimal tightness
- Two-pass authenticated key exchange with explicit authentication and tight security
- Learning with Rounding, Revisited
- An Algebraic Framework for Diffie-Hellman Assumptions
- Stronger Security of Authenticated Key Exchange
- Trapdoors for hard lattices and new cryptographic constructions
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Tightly-Secure Authenticated Key Exchange
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Lattice-based signatures with tight adaptive corruptions and more
- Simulation-based bi-selective opening security for public key encryption
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
