A simple provably secure AKE from the LWE problem
type: Item
instance of: scholarly article
title: A simple provably secure AKE from the LWE problem
zbMATH Open document ID: 1426.94154
DOI: 10.1155/2017/1740572
author: Limin Zhou
author: Fengju Lv
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: We first propose an authenticated key exchange (AKE) from the LWE problem. The AKE is simple since it does not involve any other cryptographic primitives to achieve authentication and depends on solely the LWE problem in the worst-case (e.g., SVP and SIVP). We give its security under the BR model, which captures wPFS and might be appealing in specific applications.
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6971789
Wikidata QID: Q59147307
describes a project that uses: NAXOS
describes a project that uses: HMQV
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/1740572
OpenAlex ID: W2606554233
cites work: Q4341751
cites work: Q3374905
cites work: Q2778861
cites work: HMQV: A High-Performance Secure Diffie-Hellman Protocol
cites work: Stronger Security of Authenticated Key Exchange
cites work: A New Security Model for Authenticated Key Agreement
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Lattice Cryptography for the Internet
cites work: Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
cites work: Lattice-based key exchange on small integer solution problem
cites work: Authenticated Key Exchange from Ideal Lattices
cites work: Strongly secure authenticated key exchange from factoring, codes, and lattices
cites work: Classical hardness of learning with errors
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
cites work: Examining Indistinguishability-Based Proof Models for Key Establishment Protocols
description: scientific article; zbMATH DE number 6971789