可证明安全的抗量子两服务器口令认证密钥交换协议

尹安琪; 郭渊博; 汪定; 曲彤洲; 陈琳

doi:10.11959/j.issn.1000-436x.2022052

您当前的位置：

首页 >

文章列表页 >

可证明安全的抗量子两服务器口令认证密钥交换协议

学术论文 | 更新时间：2024-06-05

- 可证明安全的抗量子两服务器口令认证密钥交换协议
- Provably secure quantum resistance two-server password-authenticated key exchange protocol
- 通信学报 2022年43卷第3期页码：14-29
- 作者机构：
  
  1. 信息工程大学密码工程学院，河南郑州 450001
  2. 南开大学网络空间安全学院，天津 300350
  3. 南开大学天津市网络与数据安全技术重点实验室，天津 300350
- 作者简介：
  
  [ " 尹安琪（1995- ），女，山东临沂人，信息工程大学博士生，主要研究方向为安全协议设计及格密码理论等" ]
  [ "郭渊博（1975- ），男，陕西周至人，博士，信息工程大学教授、博士生导师，主要研究方向为网络防御、数据挖掘、机器学习和人工智能安全等" ]
  [ "汪定（1985- ），男，湖北十堰人，博士，南开大学教授、博士生导师，主要研究方向为公钥密码学、系统安全、人工智能等" ]
  [ "曲彤洲（1994- ），男，辽宁铁岭人，信息工程大学博士生，主要研究方向为网络安全和安全专用芯片设计等" ]
  [ "陈琳（1975- ），女，河南开封人，博士，信息工程大学副教授、硕士生导师，主要研究方向为信息安全、安全专用芯片设计等" ]
- 基金信息：
  
  国家自然科学基金资助项目(61501515)
- DOI：10.11959/j.issn.1000-436x.2022052
  中图分类号： TN918.1
- 网络出版日期：2022-03，
  
  纸质出版日期：2022-03-25
- 稿件说明：
移动端阅览
尹安琪, 郭渊博, 汪定, 等. 可证明安全的抗量子两服务器口令认证密钥交换协议[J]. 通信学报, 2022,43(3):14-29.

Anqi YIN, Yuanbo GUO, Ding WANG, et al. Provably secure quantum resistance two-server password-authenticated key exchange protocol[J]. Journal on communications, 2022, 43(3): 14-29.
尹安琪, 郭渊博, 汪定, 等. 可证明安全的抗量子两服务器口令认证密钥交换协议[J]. 通信学报, 2022,43(3):14-29. DOI： 10.11959/j.issn.1000-436x.2022052.

Anqi YIN, Yuanbo GUO, Ding WANG, et al. Provably secure quantum resistance two-server password-authenticated key exchange protocol[J]. Journal on communications, 2022, 43(3): 14-29. DOI： 10.11959/j.issn.1000-436x.2022052.

摘要

针对基于格的单服务器口令认证密钥交换（PAKE）协议不能抵抗服务器泄露攻击，而目前基于格的多服务器 PAKE 协议的执行效率较低且不适用于两服务器场景的问题，利用带误差学习（LWE），提出了格上第一个非适应性两方平滑投影哈希函数（SPHF），具备不可区分适应性选择密文攻击（IND-CCA2）的安全性，并约束了所基于的公钥加密（PKE）方案中相关参数的大小。基于此，分别针对被动和主动敌手的攻击，提出了相应的格上可证明安全的两服务器PAKE协议。所提出的2个协议可抵御量子攻击且实现了唯口令设置，也不需要使用签名/验签、全同态加密、秘密共享等昂贵密码原语来保证安全性，被动敌手攻击下的协议还避免了零知识证明的使用。此外，在标准模型下，对所提出的2个协议进行了严格的安全性证明。实验结果表明，所提出的两方SPHF和两服务器PAKE协议的执行效率较高。

Abstract

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.

关键词

Keywords

references

SHIN J S , JO M , HWANG J Y , et al . A verifier-based password-authenticated key exchange using tamper-proof hardware [J ] . The Computer Journal , 2021 , 64 ( 8 ): 1293 - 1302 .

汪定 . 口令安全关键问题研究 [D ] . 北京:北京大学 , 2017 .

WANG D . Research on key issues in password security [D ] . Beijing:Peking University , 2017 .

SHOR P W , . Algorithms for quantum computation:discrete logarithms and factoring [C ] // Proceedings of the 35th Annual Symposium on Foundations of Computer Science . Piscataway:IEEE Press , 1994 : 124 - 134 .

叶茂 . 基于格的口令认证密钥交换协议和相关加密算法研究 [D ] . 郑州:信息工程大学 , 2013 .

YE M . Research on password-based authenticated key exchange protocols and associated encryption algorithms from lattices [D ] . Zhengzhou:Information Engineering University , 2013 .

ASIF R . Post-quantum cryptosystems for Internet-of-things:a survey on lattice-based algorithms [J ] . IoT , 2021 , 2 ( 1 ): 71 - 91 .

ROY P S , DUTTA S , SUSILO W , et al . Password protected secret sharing from Lattices [C ] // Applied Cryptography and Network Security . Berlin:Springer , 2021 : 442 - 459 .

HALEVI S , KRAWCZYK H . Public-key cryptography and password protocols [J ] . ACM Transactions on Information and System Security , 1999 , 2 ( 3 ): 230 - 268 .

GONG L , LOMAS M A , NEEDHAM R M , et al . Protecting poorly chosen secrets from guessing attacks [J ] . IEEE Journal on Selected Areas in Communications , 1993 , 11 ( 5 ): 648 - 656 .

YI X , HAO F , BERTINO E . ID-based two-server password-authenticated key exchange [C ] // Computer Security ESORICS 2014 . Berlin:Springer , 2014 : 257 - 276 .

YI X , RAO F Y , TARI Z , et al . ID2S password-authenticated key exchange protocols [J ] . IEEE Transactions on Computers , 2016 , 65 ( 12 ): 3687 - 3701 .

RAIMONDO D M , GENNARO R . Provably secure threshold password-authenticated key exchange [J ] . Journal of Computer and System Sciences , 2006 , 72 ( 6 ): 978 - 1001 .

LI Z P , WANG D . Two-round PAKE protocol over lattices without NIZK [C ] // Information Security and Cryptology . Berlin:Springer , 2019 : 138 - 159 .

LI Z P , WANG D . Achieving one-round password-based authenticated key exchange over lattices [J ] . IEEE Transactions on Services Computing , 2022 , 15 ( 1 ): 308 - 321 .

BENHAMOUDA F , BLAZY O , DUCAS L , et al . Hash proof systems over lattices revisited [C ] // Public-Key Cryptography PKC 2018 . Berlin:Springer , 2018 : 644 - 674 .

ZHANG J , YU Y . Two-round PAKE from approximate SPH and instantiations from lattices [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Berlin:Springer , 2017 : 37 - 67 .

KATZ J , MACKENZIE P , TABAN G , et al . Two-server password-only authenticated key exchange [J ] . Journal of Computer and System Sciences , 2012 , 78 ( 2 ): 651 - 669 .

BELLOVIN S M , MERRITT M . Encrypted key exchange:password-based protocols secure against dictionary attacks [C ] // Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy . Piscataway:IEEE Press , 1992 : 72 - 84 .

KATZ J , OSTROVSKY R , YUNG M . Efficient password-authenticated key exchange using human-memorable passwords [C ] // Lecture Notes in Computer Science . Berlin:Springer , 2001 : 475 - 494 .

GENNARO R , LINDELL Y . A framework for password-based authenticated key exchange [J ] . ACM Transactions on Information and System Security (TISSEC) , 2006 , 9 ( 2 ): 181 - 234 .

JIANG S Q , GONG G . Password based key exchange with mutual authentication [C ] // International Workshop on Selected Areas in Cryptography . Berlin:Springer , 2004 : 267 - 279 .

GROCE A , KATZ J . A new framework for efficient password-based authenticated key exchange [C ] // Proceedings of the 17th ACM conference on Computer and communications security . New York:ACM Press , 2010 : 516 - 525 .

ABDALLA M , BENHAMOUDA F , POINTCHEVAL D . Public-key encryption indistinguishable under plaintext-checkable attacks [J ] . IET Information Security , 2016 , 10 ( 6 ): 288 - 303 .

KATZ J , VAIKUNTANATHAN V . Round-optimal password-based authenticated key exchange [C ] // Theory of Cryptography . Berlin:Springer , 2011 : 293 - 310 .

KATZ J , VAIKUNTANATHAN V . Smooth projective hashing and password-based authenticated key exchange from lattices [C ] // Advances in Cryptology - ASIACRYPT 2009 . Berlin:Springer , 2009 : 636 - 652 .

CRAMER R , SHOUP V . Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption [C ] // Advances in Cryptology - EUROCRYPT 2002 . Berlin:Springer , 2002 : 45 - 64 .

PEIKERT C , VAIKUNTANATHAN V , WATERS B . A framework for efficient and composable oblivious transfer [C ] // Advances in Cryptology - CRYPTO 2008 Berlin:Springer , 2008 : 554 - 571 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller [C ] // Annual International Conference on the Theory and Applications of Cryptographic Techniques . Berlin:Springer , 2012 : 700 - 718 .

BLAZY O , CHEVALIER C , DUCAS L , et al . Exact smooth projective hash function based on LWE [R ] . 2013 .

尹安琪 , 曲彤洲 , 郭渊博 , 等 . 格上基于密文标准语言的可证明安全两轮口令认证密钥交换协议 [J ] . 电子学报 , 2021 :doi.org/10.12263/DZXB.20210517.

YIN A Q , QU T Z , GUO Y B , et al . Provably secure two-round PAKE based on ciphertext standard language over lattices [J ] . Acta Electronica Sinica ， 2021 :doi.org/10.12263/DZXB.20210517.

BENHAMOUDA F , BLAZY O , CHEVALIER C , et al . New techniques for SPHFs and efficient one-round PAKE protocols [C ] // Advances in Cryptology-CRYPTO 2013 . Berlin:Springer , 2013 : 449 - 475 .

CANETTI R , GOLDREICH O , HALEVI S . The random oracle methodology,revisited [J ] . Journal of the ACM , 2004 , 51 ( 4 ): 557 - 594 .

ZHANG J , YU Y , FAN S Q , et al . Improved lattice-based CCA2-secure PKE in the standard model [J ] . Science China Information Sciences , 2020 , 63 ( 8 ): 1 - 22 .

REGEV O . On lattices,learning with errors,random linear codes,and cryptography [J ] . Journal of the ACM , 2009 , 56 ( 6 ): 1 - 40 .

BELLARE M , POINTCHEVAL D , ROGAWAY P . Authenticated key exchange secure against dictionary attacks [C ] // International conference on the theory and applications of cryptographic techniques . Berlin:Springer , 2000 : 139 - 155 .

WANG D , CHENG H B , WANG P , et al . Zipf’s law in passwords [J ] . IEEE Transactions on Information Forensics and Security , 2017 , 12 ( 11 ): 2776 - 2791 .

WANG D , WANG P . On the implications of Zipf’s law in passwords [C ] // Computer Security - ESORICS 2016 . Berlin:Spinger , 2016 : 111 - 131 .

BAUM C , BOOTLE J , CERULLI A , et al . Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits [C ] // Advances in Cryptology - CRYPTO 2018 . Berlin:Springer , 2018 : 669 - 699 .

浏览量

266

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于格的口令认证密钥交换协议综述

基于格的用户匿名三方口令认证密钥协商协议

基于双线性变换的可证明安全的秘密共享方案

跨域基于口令认证的密钥交换协议的安全模型