A simple provably secure AKE from the LWE problem

DOI10.1155/2017/1740572MaRDI QIDQ1992397zbMATH OpenOpenAlexWikidataFDO

Authors Limin Zhou, Fengju Lv

Publication date 5 November 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/1740572

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
• Cryptanalysis of RLWE-based one-pass authenticated key exchange
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Authenticated key exchange from ideal lattices
• Strongly leakage-resilient authenticated key exchange

Cites work

• scientific article; zbMATH DE number 1722690 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• A New Security Model for Authenticated Key Agreement
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Authenticated key exchange from ideal lattices
• Authenticated key exchange secure against dictionary attacks
• Classical hardness of learning with errors
• Examining Indistinguishability-Based Proof Models for Key Establishment Protocols
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• Lattice cryptography for the internet
• Lattice-based key exchange on small integer solution problem
• Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Public-key cryptosystems from the worst-case shortest vector problem
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Stronger Security of Authenticated Key Exchange
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(3)

• An LWE-based key transfer protocol with anonymity
• Cryptanalysis of RLWE-based one-pass authenticated key exchange
• Verifying solutions to LWE with implications for concrete security

Describes a project that uses

Uses Software

• NAXOS
• HMQV

This page was built for publication: A simple provably secure AKE from the LWE problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992397)