基于中国剩余定理的可验证理性秘密共享方案

doi:3724/SP.J.1087.2012.03143

计算机应用 ›› 2012, Vol. 32 ›› Issue (11): 3143-3146.DOI: 3724/SP.J.1087.2012.03143

基于中国剩余定理的可验证理性秘密共享方案

张利远,张恩

河南师范大学计算机与信息技术学院，河南新乡 453007

收稿日期:2012-05-28 修回日期:2012-07-01 发布日期:2012-11-12 出版日期:2012-11-01
通讯作者: 张利远
作者简介:张利远（1981-），男，河南南阳人，副教授，博士，主要研究方向：网络安全;张恩（1974-），男，河南新乡人，讲师，博士，主要研究方向：信息安全、计算机网络。

Verifiable Rational Secret Sharing Scheme Based on Chinese Remainder Theorem

ZHANG Li-yuan,ZHANG Li-yuan

College of Computer and Information Technology, Henan Normal University, Xinxiang Henan 453007,China

Received:2012-05-28 Revised:2012-07-01 Online:2012-11-12 Published:2012-11-01
Contact: ZHANG Li-yuan

摘要/Abstract

摘要： 针对目前理性秘密共享方案不能动态添加和删除参与者的问题，结合博弈论和密码学理论，提出一种动态理性秘密共享方案。方案基于中国剩余定理，在秘密重构过程，可以动态添加和删除参与者，另外方案采用可验证的随机函数，能检验参与者的欺骗行为。参与者不知当前轮是否是测试轮，偏离协议没有遵守协议的收益大，理性的参与者有动机遵守协议，最终每位参与者公平地得到秘密。方案不需要可信者参与，满足弹性均衡，能防止成员间的合谋攻击。

关键词: 理性秘密共享, 博弈论, 中国剩余定理, 可验证随机函数

Abstract: To address the problem that participant can not be added or deleted dynamically in rational secret sharing scheme so far, this paper proposed a dynamic rational secret sharing scheme which combined game theory with cryptography. The scheme based on Chinese remainder theorem, can add or delete the participant dynamically in the secret reconstruction phase. And it is verifiable by using the verifiable random function, and the cheat of participants cannot work. The participants did not know whether the current round was a testing round. And the gain of following the protocol was more than the gain of deviating, so rational player had an incentive to abide the protocol. Finally, every player could obtain the secret fairly. In addition, the scheme satisfied resilient equilibrium and could withstand the conspiracy attack.

Key words: rational secret sharing, game theory, Chinese remainder theorem, verifiable random function

中图分类号:

TP309

张利远张恩. 基于中国剩余定理的可验证理性秘密共享方案[J]. 计算机应用, 2012, 32(11): 3143-3146.

ZHANG Li-yuan ZHANG Li-yuan. Verifiable Rational Secret Sharing Scheme Based on Chinese Remainder Theorem[J]. Journal of Computer Applications, 2012, 32(11): 3143-3146.

参考文献

［1］ SHAMIR A. How to share a secret［J］. Communications of the ACM, 1979，22（11）： 612-613。［2］ BLAKELEY G R. Safeguarding cryptographic keys［C］// Proceedings of the National Computer Conference。New York:AFIPS Press, 1979：313-317。［3］ CHOR B, GOLDWASSER S, MICALI S. Verifiable secret sharing and achieving simultaneity in the presence of faults［C］// 26th Annual Symposium on Foundations of Computer Science. Washington, DC: IEEE Computer Society，1985：383-395. ［4］ FELDMAN P. A practical scheme for non-interactive verifiable secret sharing［C］// FOCS’ 87:28th IEEE Symposium on Foundations of Comp, Science。 Washington, DC: IEEE Computer Society, 1987: 427-437. ［5］ PEDERSEN T P. Distributed provers with applications to undeniable signatures［C］// Proceedings of Eurocrypt’91,LNCS 547。 Berlin: Springer, 1991: 221-238。［6］ LIN H Y, HARN L. Fair reconstruction of a secret［J］。 Information Processing Letters, 1995, 55(1): 45-47. ［7］ HALPERN J, TEAGUE V. Rational secret sharing and multiparty computation［C］// Proceedings of the 36th Annual ACM Symposium on Theory of Computing。 New York : ACM, 2004: 623-632. ［8］ KOL G, NAOR M. Cryptography and game theory: Designing protocols for exchanging information［C］// Proceedings of the 5th Theory of Cryptography Conference。 Berlin: Springer, 2008: 317-336. ［9］ MALEKA S, AMJED S, RANGAN C P. Rational secret sharing with repeated games［C］// 4th Information Security Practice and Experience Conference, LNCS 4991。 Berlin: Springer, 2008: 334-346. ［10］ MALEKA S, AMJED S, RANGAN C P. The deterministic protocol for rational secret sharing［C］// the 22 th IEEE International Parallel and Distributed Processing Symposium。 Washington, DC: IEEE Computer Society, 2008: 3651-3657. ［11］ IZMALKOV S, LEPINSKI M, MICALI S. Veriably secure devices［C］// TCC 2008:5th Theory of Cryptography Conference, LNCS 4948。 Berlin: Springer, 2008: 273-301. ［12］ MICALI S, SHELAT A. Purely rational secret sharing［C］// TCC 2009:6th Theory of Cryptography Conference, LNCS 5444。 Berlin: Springer, 2009：54-71. ［13］ TOSHIYHKI I, KOICHIRO W, KEISUKE T. A rational secret-sharing scheme based on RSA-OAEP ［J］. IEICE Transactions on Fundamentals of Electronics Communications and Computer Science, 2010, E93-A(1): 42-49. 〖HJ1.7mm〗［14］ KATZ J. Bridging game theory and cryptography: Recent results and future directions［C］// TCC 2008：5th Theory of Cryptography Conference， LNCS 4984. Berlin: Springer, 2008: 251-272. ［15］ ABRAHAM I, DOLEV D, GONEN R, et al。 Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation［C］// 25th ACM Symposium Annual on Principles of Distributed Computing. New York: ACM, 2006: 53-62. ［16］ MICALI S, RABIN M, VADHAN S. Verifiable random functions［C］// Proceedings of the 40th IEEE Symposium on Foundations of Computer Science。Washington, DC: IEEE Computer Society, 1999: 120-130. ［17］ DODIS Y, YAMPOLSKIY A. A verifiable random function with short proof and keys［C］// 8th International Workshop on Theory and Practice in Public Key Cryptography,LNCS 3386. Berlin: Springer, 2005: 416-431.

[1]	卿欣艺, 陈玉玲, 周正强, 涂园超, 李涛. 基于中国剩余定理的区块链存储扩展模型[J]. 计算机应用, 2021, 41(7): 1977-1982.
[2]	王艺洁, 凡佳飞, 王陈宇. 云边环境下基于博弈论的两阶段任务迁移策略[J]. 计算机应用, 2021, 41(5): 1392-1398.
[3]	张舒瑶, 李勇华, 范家佳. 基于博弈论的散货港口堆场堆位分配算法[J]. 计算机应用, 2021, 41(3): 867-874.
[4]	毛莺池, 徐雪松, 刘鹏飞. 基于稳定匹配的多用户任务卸载策略[J]. 计算机应用, 2021, 41(3): 786-793.
[5]	雷鹰, 郑万波, 魏嵬, 夏云霓, 李晓波, 刘诚武, 谢洪. 基于概率性能感知演化博弈策略的“云+边”混合环境中任务卸载方法[J]. 《计算机应用》唯一官方网站, 2021, 41(11): 3302-3308.
[6]	郑延斌, 樊文鑫, 韩梦云, 陶雪丽. 基于博弈论及Q学习的多Agent协作追捕算法[J]. 计算机应用, 2020, 40(6): 1613-1620.
[7]	范家佳, 刘洪星, 李勇华, 杨丽金. 基于博弈论的内河港口作业车辆协同选路方法[J]. 计算机应用, 2020, 40(1): 50-55.
[8]	程亚歌, 贾志娟, 胡明生, 公备, 王利朋. 适用于区块链电子投票场景的门限签名方案[J]. 计算机应用, 2019, 39(9): 2629-2635.
[9]	王甜甜, 于双元, 徐保民. 基于策略梯度算法的工作量证明中挖矿困境研究[J]. 计算机应用, 2019, 39(5): 1336-1342.
[10]	郑延斌, 王林林, 席鹏雪, 樊文鑫, 韩梦云. 基于蚁群算法及博弈论的多Agent路径规划算法[J]. 计算机应用, 2019, 39(3): 681-687.
[11]	刘亚州, 王静, 潘晓中, 付伟. 社交网络中考虑节点度的演化博弈[J]. 计算机应用, 2018, 38(4): 1029-1035.
[12]	王岩, 侯整风, 章雪琦, 黄梦洁. 基于中国剩余定理的动态门限签名方案[J]. 计算机应用, 2018, 38(4): 1041-1045.
[13]	樊自甫, 周凯恒, 姚杰. 基于博弈论的SDN主控制器重选机制[J]. 计算机应用, 2018, 38(3): 776-779.
[14]	孙文君, 苏旸, 曹镇. 非对称信息条件下APT攻防博弈模型[J]. 计算机应用, 2017, 37(9): 2557-2562.
[15]	朱江, 巴少为, 杜清敏. 认知网络中基于博弈论的联合功率控制与速率分配算法[J]. 计算机应用, 2017, 37(6): 1521-1526.

基于中国剩余定理的可验证理性秘密共享方案

Verifiable Rational Secret Sharing Scheme Based on Chinese Remainder Theorem

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics