Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange
Abstract Password‐authenticated key exchange (PAKE) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | IET Information Security |
| Online Access: | https://doi.org/10.1049/ise2.12094 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849690827066966016 |
|---|---|
| author | Peixin Ren Xiaozhuo Gu Ziliang Wang |
| author_facet | Peixin Ren Xiaozhuo Gu Ziliang Wang |
| author_sort | Peixin Ren |
| collection | DOAJ |
| description | Abstract Password‐authenticated key exchange (PAKE) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post‐quantum PAKE scheme becomes an open research question. In this paper, the authors construct a quantum‐safe PAKE protocol, which is a horizontal extension of the password‐authenticated key (PAK) protocol in the field of module lattices. Subsequently, the authors accompany the proposed protocol with a rigorous security proof in the random oracle model with two adaptions: applying the CDF‐Zipf model to characterise the ability of the adversary and using the pairing with errors assumption to simplify the proof. Taking the flexibility of the module learning with errors (MLWE) problem, the authors elaborately select three parameter sets to meet different application scenarios. Specifically, the authors’ Recommended‐PAKE implementation achieves 177‐bit post‐quantum security with a generous margin to cope with later improvement in cryptanalysis. The performance results indicate that the authors’ MLWE‐PAKE is quite practical: compared with the latest Yang‐PAK, the authors’ Recommended‐PAK reduces the communication cost and the running time by 36.8% and 13.8%, respectively. |
| format | Article |
| id | doaj-art-ef28dad56786460d9d09af55a80ff47c |
| institution | DOAJ |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2023-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-ef28dad56786460d9d09af55a80ff47c2025-08-20T03:21:12ZengWileyIET Information Security1751-87091751-87172023-01-0117131710.1049/ise2.12094Efficient module learning with errors‐based post‐quantum password‐authenticated key exchangePeixin Ren0Xiaozhuo Gu1Ziliang Wang2Institute of Information Engineering Chinese Academy of Sciences Beijing ChinaInstitute of Information Engineering Chinese Academy of Sciences Beijing ChinaJD.com, Inc Shenzhen ChinaAbstract Password‐authenticated key exchange (PAKE) is a cryptographic primitive that can establish secure remote communications between the client and the server, especially with the advantage of amplifying memorable passwords into strong session keys. However, the arrival of the quantum computing era has brought new challenges to traditional PAKE protocols. Thus, designing an efficient post‐quantum PAKE scheme becomes an open research question. In this paper, the authors construct a quantum‐safe PAKE protocol, which is a horizontal extension of the password‐authenticated key (PAK) protocol in the field of module lattices. Subsequently, the authors accompany the proposed protocol with a rigorous security proof in the random oracle model with two adaptions: applying the CDF‐Zipf model to characterise the ability of the adversary and using the pairing with errors assumption to simplify the proof. Taking the flexibility of the module learning with errors (MLWE) problem, the authors elaborately select three parameter sets to meet different application scenarios. Specifically, the authors’ Recommended‐PAKE implementation achieves 177‐bit post‐quantum security with a generous margin to cope with later improvement in cryptanalysis. The performance results indicate that the authors’ MLWE‐PAKE is quite practical: compared with the latest Yang‐PAK, the authors’ Recommended‐PAK reduces the communication cost and the running time by 36.8% and 13.8%, respectively.https://doi.org/10.1049/ise2.12094 |
| spellingShingle | Peixin Ren Xiaozhuo Gu Ziliang Wang Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange IET Information Security |
| title | Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange |
| title_full | Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange |
| title_fullStr | Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange |
| title_full_unstemmed | Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange |
| title_short | Efficient module learning with errors‐based post‐quantum password‐authenticated key exchange |
| title_sort | efficient module learning with errors based post quantum password authenticated key exchange |
| url | https://doi.org/10.1049/ise2.12094 |
| work_keys_str_mv | AT peixinren efficientmodulelearningwitherrorsbasedpostquantumpasswordauthenticatedkeyexchange AT xiaozhuogu efficientmodulelearningwitherrorsbasedpostquantumpasswordauthenticatedkeyexchange AT ziliangwang efficientmodulelearningwitherrorsbasedpostquantumpasswordauthenticatedkeyexchange |