Beaver三元组主动性生成协议研究

doi:10.3969/j.issn.1671-1122.2022.12.003

信息网络安全 ›› 2022, Vol. 22 ›› Issue (12): 16-24.doi: 10.3969/j.issn.1671-1122.2022.12.003

Beaver三元组主动性生成协议研究

吕克伟¹^,²(), 陈驰¹^,²

1.中国科学院信息工程研究所信息安全国家重点实验室，北京 100093
2.中国科学院大学网络空间安全学院，北京 100049

收稿日期:2022-05-06 出版日期:2022-12-10 发布日期:2022-12-30
通讯作者: 吕克伟 E-mail:lvkewei@iie.ac.cn
作者简介:吕克伟（1970—），男，山东，副研究员，博士，主要研究方向为理论密码和计算复杂性理论|陈驰（1978—），男，山东，高级工程师，博士，主要研究方向为云计算安全、系统安全
基金资助:
国家重点研发计划(2017YFB0802500);“十三五”国家密码发展基金(MMJJ20180208)

Research on Proactive Generation Protocol of Beaver Triples

LYU Kewei¹^,²(), CHEN Chi¹^,²

1. State Key Laboratory of Information Security, Institute of Information Engineering, CAS, Beijing 100093, China
2. School of Cyber Security, University of Chinese Academy of Sciences, Beijing 100049, China

Received:2022-05-06 Online:2022-12-10 Published:2022-12-30
Contact: LYU Kewei E-mail:lvkewei@iie.ac.cn

摘要/Abstract

摘要：

在安全多方计算中，Beaver三元组是实现加法和乘法有效安全计算的基本技术之一，其可以将协议轮数降低至参与方个数的多项式大小。文章对移动敌手模型下Beaver三元组的安全生成协议开展研究，提出抵御半诚实移动敌手攻击的安全协议。首先，文章利用Paillier公钥系统设计了计算安全的有效两方主动性Beaver三元组生成协议，协议轮数为分享片段更新次数的2倍，每轮通信复杂度为3个Paillier密文；然后利用Shamir秘密分享等初等密码工具设计出信息论安全的有效n方Beaver三元组主动性生成协议，其中n≥3，协议发送元素总数至多为6nκ+6n个，执行轮数不多于2κ+2，其中κ为分享片段更新次数，且敌手控制参与方数不超过n?2。最后，针对恶意敌手文章给出协议设计思路。

关键词: 安全的多方计算, Beaver三元组, Shamir秘密分享, 移动敌手, 主动性秘密分享

Abstract:

In secure multi-party computation, Beaver triples have been one of basic technique to realize the secure computation of addition and multiplication under secret sharing, which can make the number of protocol rounds reach the polynomial of the number of participating parties. This paper studied secure generation protocol of Beaver triples in the mobile adversary model. First, a computational security, effective two-party active Beaver triple generation protocol was designed based on Paillier public key cryptosystem, whose number of rounds was twice the number of renew operations and sent three ciphertexts of Paillier cryptosystem in each round. Then the effective n-party Beaver triplet initiative generation protocol for information theory security was designed using primary cryptographic tools such as Shamir secret sharing, where n ≥ 3, the total number of elements sent by the protocol was at most 6nκ+6n, and the number of execution rounds is not more than 2κ+2, where к was the number of sharing fragment updates and the number of adversary control participants does not exceed n-2. Finally, protocol design ideas were given for malicious adversary articles.

Key words: secure multi-party computation, Beaver triples, Shamir secret sharing, mobile adversary, proactive secret sharing

中图分类号:

TP309

吕克伟, 陈驰. Beaver三元组主动性生成协议研究[J]. 信息网络安全, 2022, 22(12): 16-24.

LYU Kewei, CHEN Chi. Research on Proactive Generation Protocol of Beaver Triples[J]. Netinfo Security, 2022, 22(12): 16-24.

参考文献 16

[1]	GOLDREICH O. Foundations of Cryptography Volume II: Basic Applications[M]. London: Cambridge University Press, 2004.
[2]	DEMMLER D, SCHNEIDER T, ZOHNER M. ABY-A Framework for Efficient Mixed-Protocol Secure Two-Party Computation[C]// ISOC.Network and Distributed System Security Symposium. San Diego: ISOC, 2015: 8-11.
[3]	MA Jie, QI Bin, LYU Kewei. BSA: Enabling Biometric-Based Storage and Authorization on Blockchain[C]// IEEE. IEEE TrustCom 2021. New York: IEEE, 2021: 1077-1084.
[4]	BEAVER D. Efficient Multiparty Protocols Using Circuit Randomization[C]// Springer.Annual International Cryptology Conference. Berlin:Springer, 1991: 420-432.
[5]	LINDELL Y. Secure Multiparty Computation[J]. Communications of the ACM, 2020, 64(1): 86-96.
[6]	HIRT M, MAURER U. Robustness for Free in Unconditional Multi-Party Computation[C]// ACM. Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology. New York: ACM, 2001: 101-118.
[7]	SEO M. Fair and Secure Multi-Party Computation with Cheater Detection[EB/OL]. (2021-08-12) [2022-05-02]. https://doi.org/10.3390/cryptography5030019.
[8]	CANETTI R, Damgaard I, DZIEMBOWSKI S, et al. On Adaptive vs. Non-Adaptive Security of Multiparty Protocols[C]// Springer. International Conference on the Theory and Applications of Cryptographic Techniques. Berlin:Springer, 2001: 262-279.
[9]	CUNNINGHAM R, FULLER B, YAKOUBOV S. Catching MPC Cheaters: Identification and Openability[C]// Springer. International Conference on Information Theoretic Security. Berlin:Springer, 2017: 110-134.
[10]	AUMANN Y, LINDELL Y. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries[C]// Springer.Theory of Cryptography Conference. Berlin:Springer, 2010: 281-343.
[11]	HE Yunxiao, XU Haixia, LYU Kewei, et al. Secure Constant Round Protocols for Determining Co-Prime of Polynomials[J]. Journal of Graduate School of Chinese Academy of Sciences, 2004, 21(2): 179-184.
	何云筱, 徐海霞, 吕克伟, 等. 常数轮多项式互素多方安全判定协议[J]. 中科院研究生院学报, 2004, 21(2):179-184.
[12]	HERZBERG A, JARECKI S, KRAWCZYK H, et al. Proactive Secret Sharing or: How to Cope with Perpetual Leakage[C]// Springer. Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology. Berlin:Springer, 1995: 339-352
[13]	NIKOV V, NIKOVA S, PRENEEL B, et al. Applying General Access Structure to Proactive Secret Sharing Schemes[C]// Springer. Proceedings of the 23rd Symposium on Information Theory. Berlin:Springer, 2002: 197-206.
[14]	MARAM S, ZHANG F, WANG L, et al. CHURP: Dynamic-Committee Proactive Secret Sharing[C]// ACM. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2019: 2369-2386.
[15]	PAILLIER P. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes[C]// Springer. International Conference on the Theory and Applications of Cryptographic Techniques. Berlin:Springer, 1999: 223-238.
[16]	SU Dong, LYU Kewei. Paillier's Trapdoor Function Hides Θ(n) bits[J]. Science China Information Sciences, 2011, 54(9): 1827-1836. doi: 10.1007/s11432-011-4269-9 URL

Beaver三元组主动性生成协议研究

Research on Proactive Generation Protocol of Beaver Triples

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献 16

相关文章 15

编辑推荐

Metrics

本文评价

[1]	闫苗, 马占友, 姜子姝, 秦国丽. 基于N抢占策略且播放器数可变的P2P网络性能分析[J]. 信息网络安全, 2022, 22(12): 87-95.
[2]	汪勍, 徐国天. 基于改进Logistic映射和双图混合的加密算法[J]. 信息网络安全, 2022, 22(12): 76-86.
[3]	郭森森, 王同力, 慕德俊. 基于生成对抗网络与自编码器的网络流量异常检测模型[J]. 信息网络安全, 2022, 22(12): 7-15.
[4]	王思蝶, 马兆丰, 罗守山, 徐单恒. 面向异构多链的区块链链上数据隐私保护方案[J]. 信息网络安全, 2022, 22(12): 67-75.
[5]	银鹰, 周志洪, 姚立红. 基于LSTM的CAN入侵检测模型研究[J]. 信息网络安全, 2022, 22(12): 57-66.
[6]	王勇, 陈莉杰, 钟美玲. 基于零知识证明的区块链方案研究进展[J]. 信息网络安全, 2022, 22(12): 47-56.
[7]	徐茹枝, 吕畅冉, 龙燕, 刘远彬. 工业控制系统高隐蔽性数据攻击防御方法研究[J]. 信息网络安全, 2022, 22(12): 34-46.
[8]	张昱, 孙光民, 翟鹏, 李煜. 一种基于切比雪夫混沌映射的可证明安全的溯源认证协议[J]. 信息网络安全, 2022, 22(12): 25-33.
[9]	陈妍, 韦湘, 陆臻. 云计算环境下网络安全产品检测方法研究[J]. 信息网络安全, 2022, 22(12): 1-6.
[10]	晏燕, 张雄, 冯涛. 大数据统计划分发布的等比差分隐私预算分配方法[J]. 信息网络安全, 2022, 22(11): 24-35.
[11]	刘振亚, 林璟锵. 基于OpenSSL密码软件的SM2算法加解密漏洞分析[J]. 信息网络安全, 2022, 22(11): 47-54.
[12]	彭舒凡, 蔡满春, 刘晓文, 马瑞. 基于图像细粒度特征的深度伪造检测算法[J]. 信息网络安全, 2022, 22(11): 77-84.
[13]	黄子龙, 詹东阳, 叶麟, 张宏莉. 一种基于虚拟机自省的安全容器管理方法[J]. 信息网络安全, 2022, 22(11): 55-61.
[14]	林发鑫, 张健. 虚拟化平台异常行为检测系统的设计与实现[J]. 信息网络安全, 2022, 22(11): 62-67.
[15]	宋晶, 刁润, 周杰, 戚建淮. 工业控制系统功能安全和信息安全策略优化方法[J]. 信息网络安全, 2022, 22(11): 68-76.