Provably secure quantum resistance two-server password-authenticated key exchange protocol

Aiming at the problem that the lattice-based single-sever password-authenticated key exchange (PAKE) protocols are not resistant to server compromise attack, while the existing lattice-based multi-server PAKE protocols are inefficient and incompatible with two-server scenarios.The first lattice-base...

Full description

Saved in:
Bibliographic Details
Main Authors: Anqi YIN, Yuanbo GUO, Ding WANG, Tongzhou QU, Lin CHEN
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2022-03-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022052/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841539979429281792
author Anqi YIN
Yuanbo GUO
Ding WANG
Tongzhou QU
Lin CHEN
author_facet Anqi YIN
Yuanbo GUO
Ding WANG
Tongzhou QU
Lin CHEN
author_sort Anqi YIN
collection DOAJ
description Aiming at the problem that the lattice-based single-sever password-authenticated key exchange (PAKE) protocols are not resistant to server compromise attack, while the existing lattice-based multi-server PAKE protocols are inefficient and incompatible with two-server scenarios.The first lattice-based two-party smooth projective hash function (SPHF) was proposed by utilizing the learning with errors (LWE), which was indistinguishability under adaptive chosen-ciphertext attack(IND-CCA2) secure.The parameters of the based public key encryption (PKE) scheme were also identified.On this basis, pertinent two-server PAKE protocols from lattices were designed countering both passive and active attackers.The two quantum resistance protocols were able to achieve password-only settings and the expensive cryptographic primitives were not used, including signature/verification, fully homomorphic encryption and secret sharing.The utilization of zero knowledge proofs were avoided by the protocol under the passive attackers.In the standard model, rigorous security proofs were provided for the two proposed protocols.Experimental results show that the proposed SPHF and PAKE protocols exhibit higher execution efficiency.
format Article
id doaj-art-81e9f5bea26b436c89339332b0dd7180
institution Kabale University
issn 1000-436X
language zho
publishDate 2022-03-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-81e9f5bea26b436c89339332b0dd71802025-01-14T06:29:06ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2022-03-0143142959392764Provably secure quantum resistance two-server password-authenticated key exchange protocolAnqi YINYuanbo GUODing WANGTongzhou QULin CHENAiming at the problem that the lattice-based single-sever password-authenticated key exchange (PAKE) protocols are not resistant to server compromise attack, while the existing lattice-based multi-server PAKE protocols are inefficient and incompatible with two-server scenarios.The first lattice-based two-party smooth projective hash function (SPHF) was proposed by utilizing the learning with errors (LWE), which was indistinguishability under adaptive chosen-ciphertext attack(IND-CCA2) secure.The parameters of the based public key encryption (PKE) scheme were also identified.On this basis, pertinent two-server PAKE protocols from lattices were designed countering both passive and active attackers.The two quantum resistance protocols were able to achieve password-only settings and the expensive cryptographic primitives were not used, including signature/verification, fully homomorphic encryption and secret sharing.The utilization of zero knowledge proofs were avoided by the protocol under the passive attackers.In the standard model, rigorous security proofs were provided for the two proposed protocols.Experimental results show that the proposed SPHF and PAKE protocols exhibit higher execution efficiency.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022052/password-authenticated key exchange protocoltwo-serversmooth projective hash functionprovably securequantum resistance
spellingShingle Anqi YIN
Yuanbo GUO
Ding WANG
Tongzhou QU
Lin CHEN
Provably secure quantum resistance two-server password-authenticated key exchange protocol
Tongxin xuebao
password-authenticated key exchange protocol
two-server
smooth projective hash function
provably secure
quantum resistance
title Provably secure quantum resistance two-server password-authenticated key exchange protocol
title_full Provably secure quantum resistance two-server password-authenticated key exchange protocol
title_fullStr Provably secure quantum resistance two-server password-authenticated key exchange protocol
title_full_unstemmed Provably secure quantum resistance two-server password-authenticated key exchange protocol
title_short Provably secure quantum resistance two-server password-authenticated key exchange protocol
title_sort provably secure quantum resistance two server password authenticated key exchange protocol
topic password-authenticated key exchange protocol
two-server
smooth projective hash function
provably secure
quantum resistance
url http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022052/
work_keys_str_mv AT anqiyin provablysecurequantumresistancetwoserverpasswordauthenticatedkeyexchangeprotocol
AT yuanboguo provablysecurequantumresistancetwoserverpasswordauthenticatedkeyexchangeprotocol
AT dingwang provablysecurequantumresistancetwoserverpasswordauthenticatedkeyexchangeprotocol
AT tongzhouqu provablysecurequantumresistancetwoserverpasswordauthenticatedkeyexchangeprotocol
AT linchen provablysecurequantumresistancetwoserverpasswordauthenticatedkeyexchangeprotocol