基于格的最优轮数口令认证秘密共享协议

doi:10.3969/j.issn.1671-1122.2024.06.011

信息网络安全 ›› 2024, Vol. 24 ›› Issue (6): 937-947.doi: 10.3969/j.issn.1671-1122.2024.06.011

基于格的最优轮数口令认证秘密共享协议

胡丞聪¹, 胡红钢¹^,²()

1.中国科学技术大学网络空间安全学院，合肥 230027
2.中国科学院电磁空间信息重点实验室，合肥 230027

收稿日期:2024-03-20 出版日期:2024-06-10 发布日期:2024-07-05
通讯作者: 胡红钢 hghu2005@ustc.edu.cn
作者简介:胡丞聪（1998—），男，广东，硕士研究生，主要研究方向为多方安全计算|胡红钢（1978—），男，四川，教授，博士，主要研究方向为密码、编码、网络安全
基金资助:
国家自然科学基金(61972370)

Lattice-Based Round-Optimal Password Authenticated Secret Sharing Protocol

HU Chengcong¹, HU Honggang¹^,²()

1. School of Cyber Science and Technology, University of Science and Technology of China, Hefei 230027, China
2. Key Laboratory of Electromagnetic Space Information, Chinese Academy of Science, Hefei 230027, China

Received:2024-03-20 Online:2024-06-10 Published:2024-07-05

摘要/Abstract

摘要：

口令认证秘密共享将口令认证和秘密共享相结合，是一个贴合实际用户需求的分布式方案。该协议允许一个用户在多个服务器间共享秘密，并且只需要记忆一个简短口令即可在后续同时完成身份验证以及秘密恢复。协议安全性保证只要敌手控制的服务器不超过阈值，敌手就不能从协议中窃取任何有关口令和秘密的信息。口令认证秘密共享方案最初基于离散对数及其变体的假设，不能抵抗量子攻击，因此找到量子安全的构造成为亟需解决的问题。ROY等人提出一种恶意安全且量子安全的构造，但其通信轮数并非最优，在有恶意敌手干扰的情况下，轮数甚至不再是常数。针对轮数优化问题，文章利用可验证不经意伪随机函数原语，给出了基于格的最优轮数的量子安全构造并严格证明了其安全性。此外，协议保证多数诚实服务器场景时，诚实用户一定能在最优轮数内成功恢复正确的秘密，具有很强的鲁棒性。

关键词: 口令认证, 秘密共享, 后量子密码, 可验证不经意伪随机函数

Abstract:

The combination of password authentication and secret sharing in Password-Protected Secret Sharing (PPSS) schemes presents a distributed solution that aligns with practical user needs. This protocol allows a user to share secrets among multiple servers, only requiring the memorization of a short password for subsequent simultaneous authentication and secret reconstruction. The security ensures that as long as the adversary does not corrupt servers beyond a threshold, it cannot reveal any information related to password or the secrets from the protocol.The PPSS schemes were initially based on discrete-log-hardness assumptions and their variants, making them vulnerable to quantum attacks. Finding a quantum-secure construction has thus become an urgent problem to address. Roy et al. introduced a quantum-secure construction against malicious adversaries, but its communication rounds are not optimal and even not be constant in the presence of malicious adversaries. Addressing the issue of optimizing protocol rounds, this paper firstly introduced a lattice-based quantum-secure construction with optimal rounds, using a Verifiable Oblivious Pseudorandom Function (V-OPRF) primitive and then rigorously proved security of the protocol. Furthermore, the protocol ensured that in scenarios with a majority of honest servers, an honest user will always successfully reconstruct the correct secret within the optimal number of rounds, demonstrating strong robustness.

Key words: password authentication, secret sharing, post-quantum cryptography, verifiable oblivious pseudorandom function

中图分类号:

TP309

胡丞聪, 胡红钢. 基于格的最优轮数口令认证秘密共享协议[J]. 信息网络安全, 2024, 24(6): 937-947.

HU Chengcong, HU Honggang. Lattice-Based Round-Optimal Password Authenticated Secret Sharing Protocol[J]. Netinfo Security, 2024, 24(6): 937-947.

参考文献 20

[1]	GU Xiaoyu. Apple Steps in to Investigate Hollywood Celebrity Photo Scandal; iCloud Suspected of Being Hacked[EB/OL]. (2014-09-03)[2024-03-14]. http://it.people.com.cn/n/2014/0903/c1009-25596161.html.
	古晓宇. 苹果介入调查好莱坞艳照门 iCloud被指遭攻击[EB/OL]. (2014-09-03)[2024-03-14]. http://it.people.com.cn/n/2014/0903/c1009-25596161.html.
[2]	Apple. Report: 2.6 Billion Personal Records Compromised by Data Breaches in Past Two Years—Underscoring Need for End-to-End Encryption[EB/OL]. (2023-12-07)[2024-03-14]. https://www.apple.com/newsroom/2023/12/report-2-point-6-billion-records-compromised-by-data-breaches-in-past-two-years/.
[3]	SHAMIR A. How to Share a Secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
[4]	BAGHERZANDI A, JARECKI S, SAXENA N, et al. Password-Protected Secret Sharing[C]// ACM. Proceedings of the 18th ACM Conference on Computer and Communications Security. New York: ACM, 2011: 433-444.
[5]	CAMENISCH J, LEHMANN A, LYSYANSKAYA A, et al. Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment[C]// Springer. Advances in Cryptology-CRYPTO 2014: 34th Annual Cryptology Conference. Heidelberg: Springer, 2014: 256-275.
[6]	JARECKI S, KIAYIAS A, KRAWCZYK H, et al. TOPPSS: Cost-Minimal Password-Protected Secret Sharing Based on Threshold OPRF[C]// Springer. Applied Cryptography and Network Security:15th International Conference(ACNS 2017). Heidelberg: Springer, 2017: 39-58.
[7]	DAS P, HESSE J, LEHMANN A. DPaSE: Distributed Password-Authenticated Symmetric-Key Encryption, or How to Get Many Keys from One Password[C]// ACM. Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security. New York: ACM, 2022: 682-696.
[8]	MACKENZIE P, SHRIMPTON T, JAKOBSSON M. Threshold Password-Authenticated Key Exchange[C]// Springer. Annual International Cryptology Conference. Heidelberg: Springer, 2002: 385-400.
[9]	DI RAIMONDO M, GENNARO R. Provably Secure Threshold Password-Authenticated Key Exchange[C]// Springer. Advances in Cryptology—EUROCRYPT 2003:International Conference on the Theory and Applications of Cryptographic Techniques. Heidelberg: Springer, 2003: 507-523.
[10]	ABDALLA M, CHEVASSUT O, FOUQUE P A, et al. A Simple Threshold Authenticated Key Exchange from Short Secrets[C]// Springer. Advances in Cryptology-ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security. Heidelberg: Springer, 2005: 566-584.
[11]	JARECKI S, KIAYIAS A, KRAWCZYK H. Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model[C]// Springer. Advances in Cryptology-ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security. Heidelberg: Springer, 2014: 233-253.
[12]	CAMENISCH J, LYSYANSKAYA A, NEVEN G. Practical Yet Universally Composable Two-Server Password-Authenticated Secret Sharing[C]// ACM. Proceedings of the 2012 ACM Conference on Computer and Communications Security. New York: ACM, 2012: 525-536.
[13]	KATZ J, MACKENZIE P, TABAN G, et al. Two-Server Password-Only Authenticated Key Exchange[C]// Springer. Applied Cryptography and Network Security: Third International Conference(ACNS 2005). Heidelberg: Springer, 2005: 1-16.
[14]	ABDALLA M, FOUQUE P A, POINTCHEVAL D. Password-Based Authenticated Key Exchange in the Three-Party Setting[C]// Springer. Public Key Cryptography-PKC 2005: 8th International Workshop on Theory and Practice in Public Key Cryptography. Heidelberg: Springer, 2005: 65-84.
[15]	JARECKI S, KIAYIAS A, KRAWCZYK H, et al. Highly-Efficient and Composable Password-Protected Secret Sharing (or: How to Protect Your Bitcoin Wallet Online)[C]// IEEE. 2016 IEEE European Symposium on Security and Privacy (EuroS&P). New York: IEEE, 2016: 276-291.
[16]	ROY P S, DUTTA S, SUSILO W, et al. Password Protected Secret Sharing from Lattices[C]// Springer. International Conference on Applied Cryptography and Network Security. Heidelberg: Springer, 2021: 442-459.
[17]	ALBRECHT M R, DAVIDSON A, DEO A, et al. Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices[C]// Springer. IACR International Conference on Public-Key Cryptography. Heidelberg: Springer, 2021: 261-289.
[18]	FREEDMAN M J, ISHAI Y, PINKAS B, et al. Keyword Search and Oblivious Pseudorandom Functions[C]// Springer. Theory of Cryptography:Second Theory of Cryptography Conference(TCC 2005). Heidelberg: Springer, 2005: 303-324.
[19]	DI CRESCENZO G, ISHAI Y, OSTROVSKY R. Non-Interactive and Non-Malleable Commitment[C]// ACM. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. New York: ACM, 1998: 141-150.
[20]	BANERJEE A, PEIKERT C. New and Improved Key-Homomorphic Pseudorandom Functions[C]// Springer. Advances in Cryptology-CRYPTO 2014: 34th Annual Cryptology Conference. Heidelberg: Springer, 2014: 353-370.

基于格的最优轮数口令认证秘密共享协议

Lattice-Based Round-Optimal Password Authenticated Secret Sharing Protocol

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献 20

相关文章 15

编辑推荐

Metrics

本文评价

[1]	朱敏, 肖昊. 一种面积高效的双态可配置NTT硬件加速器[J]. 信息网络安全, 2024, 24(6): 959-967.
[2]	郭建胜, 关飞婷, 李志慧. 一种带作弊识别的动态(t,n)门限量子秘密共享方案[J]. 信息网络安全, 2024, 24(5): 745-755.
[3]	李志慧, 罗双双, 韦性佳. 基于一类受限存取结构上的量子秘密共享方案[J]. 信息网络安全, 2023, 23(8): 32-40.
[4]	许春根, 薛少康, 徐磊, 张盼. 基于安全两方计算的高效神经网络推理协议[J]. 信息网络安全, 2023, 23(7): 22-30.
[5]	陈晶, 彭长根, 谭伟杰, 许德权. 基于差分隐私和秘密共享的多服务器联邦学习方案[J]. 信息网络安全, 2023, 23(7): 98-110.
[6]	杨宇光, 卢嘉煜. 一种基于星型簇态的动态的分级的量子秘密共享协议[J]. 信息网络安全, 2023, 23(6): 34-42.
[7]	秦宝东, ，陈从正, ，何俊杰, 郑东. 基于可验证秘密共享的多关键词可搜索加密方案[J]. 信息网络安全, 2023, 23(5): 32-40.
[8]	裴蓓, 张水海, 吕春利. 用于云存储的主动秘密共享方案[J]. 信息网络安全, 2023, 23(5): 95-104.
[9]	马敏, 付钰, 黄凯. 云环境下基于秘密共享的安全外包主成分分析方案[J]. 信息网络安全, 2023, 23(4): 61-71.
[10]	张学旺, 张豪, 姚亚宁, 付佳丽. 基于群签名和同态加密的联盟链隐私保护方案[J]. 信息网络安全, 2023, 23(3): 56-61.
[11]	吕凯欣, 李志慧, 黑吉辽, 宋云. 一类图存取结构的最优信息率计算[J]. 信息网络安全, 2022, 22(4): 77-85.
[12]	刘璐, 李志慧, 芦殿军, 闫晨红. 基于线性码的量子秘密共享方案[J]. 信息网络安全, 2021, 21(8): 62-69.
[13]	陈柏沩, 夏璇, 钟卫东, 吴立强. 基于秘密共享的LBlock的S盒防御方案[J]. 信息网络安全, 2021, 21(7): 80-86.
[14]	刘晓芬, 陈晓峰, 连桂仁, 林崧. 基于d级单粒子的可认证多方量子秘密共享协议[J]. 信息网络安全, 2020, 20(3): 51-55.
[15]	郎为民, 王雪丽, 张汉, 裴云祥. 一种基于秘密共享算法的安全数据去重方案[J]. 信息网络安全, 2020, 20(11): 43-50.