基于椭圆曲线的可验证的理性秘密共享方案

doi:10.7523/j.issn.2095-6134.2011.6.015

中国科学院大学学报 ›› 2011, Vol. 28 ›› Issue (6): 806-810.DOI: 10.7523/j.issn.2095-6134.2011.6.015

基于椭圆曲线的可验证的理性秘密共享方案

张恩^1,2, 蔡永泉¹

1. 北京工业大学计算机学院,北京 100022;
2. 河南师范大学计算机与信息技术学院,河南新乡 453007

收稿日期:2010-06-10 修回日期:2010-09-03 发布日期:2011-11-15
基金资助:
国家自然科学基金(61170221)、国家973重点基础研究发展规划项目(2007CB311106)、北京市自然科学基金(1102003)资助 

A verifiable rational secret sharing scheme based on the elliptic curve

ZHANG En^1,2, CAI Yong-Quan¹

1. College of Computer Science and Technology, Beijing University of Technology, Beijing 100022, China;
2. College of Computer and Information Technology, Henan Normal University, Xinxiang 453007, Henan, China

Received:2010-06-10 Revised:2010-09-03 Published:2011-11-15

摘要/Abstract

摘要：

采用博弈论的方法,提出一种新的理性秘密共享方案.该方案具有以下特点:基于椭圆曲线密码体制,能检验出分发者和参与者的欺骗行为;在密钥重构阶段,不需要可信者参与;将真秘密放在一系列假秘密之中,参与者不知当前轮是否是测试轮;参与者偏离协议不如遵守协议的收益大,理性的参与者有动机遵守协议;最终每位参与者公平地得到秘密.分析表明方案是简单、公平和有效的.

关键词: 秘密共享, 博弈论, 椭圆曲线, 公平

Abstract:

A new scheme for rational secret sharing is proposed in game theoretic settings. The scheme has the following characteristics. The scheme is based on elliptic curve cryptography and it is verifiable. The dealer's and the participants' cheat can be detected. In addition, the participation of the trusted party is not needed in the secret reconstruction stage. The scheme inserts the secret into a series of fake secrets, and participants do not know whether the current round is a test round. The scheme gives rational players incentives to abide by the protocol. Finally, every player can obtain the secret fairly. Analyses indicate that the scheme is simple, fair, and effective.

Key words: secret sharing, game theory, elliptic curve, fairness

中图分类号:

TP309

张恩, 蔡永泉. 基于椭圆曲线的可验证的理性秘密共享方案[J]. 中国科学院大学学报, 2011, 28(6): 806-810.

ZHANG En, CAI Yong-Quan. A verifiable rational secret sharing scheme based on the elliptic curve[J]. , 2011, 28(6): 806-810.

参考文献

[1] Shamir A. How to share a secret
[J]. Communications of the ACM, 1979, 22(1): 612-613.

[2] Blakeley G R. Safeguarding cryptographic keys //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 //Proceedings of the 26^th 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 //Proceedings of the 28^th IEEE Symp on Foundations of Comp, Science(FOCS' 87). Los Angeles: IEEE Computer Society, 1987: 427-437.

[5] Pedersen T P. Distributed provers with applications to undeniable signatures //Proceedings of Eurocrypt'91, Lecture Notes in Computer Science, LNCS 547. Berlin:Springer-Verlag, 1991: 221-238.

[6] Lin H Y, Harn L. Fair reconstruction of a secret
[J]. Information Processing Letters, 1995, 55(1): 45-47.

[7] Pang L J, Wang Y M. (t, n) threshold secret sharing scheme based on RSA cryptosystem
[J]. Journal on Communications, 2005, 26(6): 70-73 (in Chinese). 庞辽军,王育民. 基于RSA密码体制 (t, n) 门限秘密共享方案
[J]. 通信学报,2005, 26(6): 70-73.

[8] Pei Q Q, Ma J F, Pang L J, et al. An identity(ID)-based and self-certified secret sharing Scheme
[J]. Chinese Journal of Computers, 2010, 33(1):152-156 (in Chinese). 裴庆祺,马建峰,庞辽军,等. 基于身份自证实的秘密共享方案
[J]. 计算机学报,2010, 33(1):152-156.

[9] Halpern J, Teague V. Rational secret sharing and multiparty computation //Proceedings of the 36^th Annual ACM Symposium on Theory of Computing(STOC). New York: ACM Press, 2004: 623-632.

[10] Kol G, Naor M. Cryptography and game theory: designing protocols for exchanging information //Proceedings of the 5^th Theory of Cryptography Conference (TCC). Berlin:Springer-Verlag, 2008: 317-336.

[11] Maleka S, Amjed S, Rangan C P. Rational secret sharing with repeated games //4^th Information Security Practice and Experience Conference, LNCS 4991. Berlin:Springer-Verlag, 2008: 334-346.

[12] Maleka S, Amjed S, Rangan C P. The deterministic protocol for rational secret sharing //22^th IEEE International Parallel and Distributed Processing Symposium. Miami, FL: IEEE Computer Society, 2008: 1-7.

[13] Izmalkov S, Lepinski M, Micali S. Veriably secure devices //5^th Theory of Cryptography Conference, LNCS 4948. Berlin:Springer-Verlag, 2008: 273-301.

[14] Micali S, Shelat A. Purely rational secret sharing //6^th Theory of Cryptography Conference, LNCS 5444. Berlin:Springer-Verlag, 2009: 54-71.

[15] Katz J. Bridging game theory and cryptography: recent results and future directions //5^th Theory of Cryptography Conference-TCC 2008, LNCS 4984. Berlin:Springer-Verlag, 2008: 251-272.

[16] Goldreich O. Foundations of cryptography: basic tools
[M]. London: Cambridge University Press, 2001.

基于椭圆曲线的可验证的理性秘密共享方案

A verifiable rational secret sharing scheme based on the elliptic curve

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

访问统计

联系我们

[1]	王静, 陈岚, 张贺, 王海永. 基于EDA仿真软件的多资源调度算法[J]. 中国科学院大学学报, 2021, 38(5): 696-701.
[2]	孙富玲, 周展飞, 俞扬. 不完美信息扩展博弈下的理性秘密共享协议[J]. 中国科学院大学学报, 2013, 30(4): 539-546.
[3]	张格非, 张玉清. 基于IPv6的P2P-SIP可证明安全无证书匿名通信协议[J]. 中国科学院大学学报, 2013, 30(4): 547-554.
[4]	贾刚勇, 李曦, 周学海, 朱宗卫. 一个平衡功耗、性能和公平性的组管理方法[J]. 中国科学院大学学报, 2013, 30(4): 555-561.
[5]	徐茂, 张光荣, 陈晓辉, 王卫东. 基于调和均值公平的多小区干扰协调功率分配算法[J]. 中国科学院大学学报, 2012, 29(5): 659-666.
[6]	田博, 唐国平, 陈虹. 关于费玛曲线x^N+y^N=1的K₂群的一些注记[J]. 中国科学院大学学报, 2012, (2): 154-161.
[7]	黄操, 刘发林. 面向LEO卫星网的显式TCP方法[J]. 中国科学院大学学报, 2012, 29(1): 76-80.
[8]	马赟琪, 卢汉成. 车辆网络中基于网络编码机会的调度算法[J]. 中国科学院大学学报, 2010, 27(5): 677-683.
[9]	李明, 王鲲鹏. 局部环Z/pZ上的椭圆曲线密码系统[J]. 中国科学院大学学报, 2009, 26(5): 695-702.
[10]	张蕾杨寿保王大鹏孙伟峰. 无线Mesh网络中TCP公平性建模与分析 [J]. 中国科学院大学学报, 2007, 24(3): 342-350.
[11]	黄根勋; 石巧连; 高峰修; 周然. 一种基于一般接入结构的抗欺骗秘密共享体制[J]. 中国科学院大学学报, 2006, 23(5): 647-652.
[12]	王芷玲; 张玉清; 杨波. 公平交换协议设计原则[J]. 中国科学院大学学报, 2006, 23(4): 555-560.
[13]	杜红珍; 李艳平; 张建中. 一个优化的基于半可信第三方的公平不可否认协议[J]. 中国科学院大学学报, 2006, 23(3): 377-381.
[14]	谭作文, 刘卓军. 公开可验证的秘密重新分配门限方案(英文)[J]. 中国科学院大学学报, 2004, 21(2): 210-217.
[15]	王明生, 冯登国, 王贵林. 基于Plücker坐标的秘密共享方案(英文)[J]. 中国科学院大学学报, 2002, 19(3): 282-287.