A verifiable rational secret sharing scheme based on the elliptic curve

doi:10.7523/j.issn.2095-6134.2011.6.015

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

CLC Number:

TP309

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

References

[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.