Lattice-based authenticated key exchange with tight security
From MaRDI portal
Recommendations
- Tighter security for generic authenticated key exchange in the QROM
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Tightly-secure authenticated key exchange, revisited
- Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
- Authenticated key exchange from ideal lattices
Cites work
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- An algebraic framework for Diffie-Hellman assumptions
- Authenticated key exchange and signatures with tight security in the standard model
- Classical hardness of learning with errors
- CSIDH: an efficient post-quantum commutative group action
- Generic authenticated key exchange in the quantum random oracle model
- Hash proof systems over lattices revisited
- Highly efficient key exchange protocols with optimal tightness
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- Lattice-based signatures with tight adaptive corruptions and more
- Learning with rounding, revisited. New reduction, properties and applications
- On lattices, learning with errors, random linear codes, and cryptography
- On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments
- Practical and tightly-secure digital signatures and authenticated key exchange
- Practical isogeny-based key-exchange with optimal tightness
- Public-key cryptosystems from the worst-case shortest vector problem
- Signed Diffie-Hellman key exchange with tight security
- Simulation-based bi-selective opening security for public key encryption
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Stronger Security of Authenticated Key Exchange
- Tighter proofs for the SIGMA and TLS 1.3 key exchange protocols
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Tightly-secure authenticated key exchange
- Tightly-secure authenticated key exchange, revisited
- Trapdoors for hard lattices and new cryptographic constructions
- Two-pass authenticated key exchange with explicit authentication and tight security
- Two-round PAKE from approximate SPH and instantiations from lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(9)- A generic construction of tightly secure password-based authenticated key exchange
- Tighter security for generic authenticated key exchange in the QROM
- Key exchange with tight (full) forward secrecy via key confirmation
- Tightly secure inner-product functional encryption revisited: compact, lattice-based, and more
- Anamorphic authenticated key exchange: double key distribution under surveillance
- Tightly-secure group key exchange with perfect forward secrecy
- Efficient asymmetric PAKE compiler from KEM and AE
- Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
This page was built for publication: Lattice-based authenticated key exchange with tight security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190151)
