A simple provably secure AKE from the LWE problem
From MaRDI portal
Publication:1992397
DOI10.1155/2017/1740572zbMath1426.94154OpenAlexW2606554233WikidataQ59147307 ScholiaQ59147307MaRDI QIDQ1992397
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/1740572
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Lattice-based key exchange on small integer solution problem
- Lattice Cryptography for the Internet
- Authenticated Key Exchange from Ideal Lattices
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Stronger Security of Authenticated Key Exchange
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- A New Security Model for Authenticated Key Agreement
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-key cryptosystems from the worst-case shortest vector problem
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Examining Indistinguishability-Based Proof Models for Key Establishment Protocols
- 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
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: A simple provably secure AKE from the LWE problem
