aqora

Cryptanalysis of lattice-based key exchange on small integer solution problem and its improvement

Zhengjun Jing, Chunsheng Gu, Zhimin Yu +2 more

Cluster ComputingMar 5, 201814 citations

A Key Exchange Based on the Short Integer Solution Problem and the Learning with Errors Problem

Jíntai Ding, Kevin Schmitt, Zheng Zhang

Lecture notes in computer scienceJan 1, 20196 citations

Cryptanalysis of Wang et al.’s lattice-based key exchange protocol

Daya Sagar Gupta, G. P. Biswas

Wang et al. proposed a new hard problem on lattices which is an extension of the small integer solution (SIS) on lattices. This new generated hard problem is named to be bilateral in-homogeneous small integer solution (Bi-ISIS). Using the hardness of Bi-ISIS, Wang et al. proposed a new key exchange protocol, which is based on the lattice-based cryptography. In this paper, we signalize that Wang et al.’s lattice-based key exchange protocol is vulnerable to an attack, namely, man-in-the-middle (MITM) attack. Through this attack, Eavesdropper can intercept the authenticated messages and communicate the unauthentic messages among the communicating parties.Wang et al. proposed a new hard problem on lattices which is an extension of the small integer solution (SIS) on lattices. This new generated hard problem is named to be bilateral in-homogeneous small integer solution (Bi-ISIS). Using the hardness of Bi-ISIS, Wang et al. proposed a new key exchange protocol, which is based on the lattice-based cryptography. In this paper, we signalize that Wang et al.’s lattice-based key exchange protocol is vulnerable to an attack, namely, man-in-the-middle (MITM) attack. Through this attack, Eavesdropper can intercept the authenticated messages and communicate the unauthentic messages among the communicating parties.

Perspectives in ScienceApr 30, 201622 citations

An Analysis of Lattice-Based Key Exchange Protocols

Susanne Rieß

Feb 1, 20160 citations

Reconciliation based key exchange schemes using lattices: a review

Vivek Dabra, Anju Bala, Saru Kumari

Telecommunication SystemsFeb 16, 20219 citations

a key exchange scheme based on lattice

Wulu Li

We construct a key exchange scheme with session key security and Alice's privacy, assuming the hardness of "small integer solution" (SIS) problem and "learning with errors" (LWE) problem, which have worst-case to average-case reductions from lattice problems. Our key exchange scheme is the first lattice-based key exchange scheme with provable security. Moreover, our scheme can be modified to be secure under impersonation attack by adding an authentication step, also, it can be modified to be more efficient using a new variant of LWE.We construct a key exchange scheme with session key security and Alice's privacy, assuming the hardness of "small integer solution" (SIS) problem and "learning with errors" (LWE) problem, which have worst-case to average-case reductions from lattice problems. Our key exchange scheme is the first lattice-based key exchange scheme with provable security. Moreover, our scheme can be modified to be secure under impersonation attack by adding an authentication step, also, it can be modified to be more efficient using a new variant of LWE.

IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)Dec 1, 20132 citations

Lattice-based key exchange on small integer solution problem

Related papers

Lattice-based key exchange on small integer solution problem

Related papers