A verifiable rational secret sharing scheme based on bilinear pairing

被引：0

作者：

机构：

[1] College of Computer Science and Technology, Beijing University of Technology

[2] College of Computer and Information Technology, Henan Normal University, Xinxiang

来源：

Zhang, E. (zhangenzdrj@163.com) | 1600年 / Chinese Institute of Electronics卷 / 40期

关键词：

Bilinear pairing; Game theory; One-way function; Rational secret sharing;

D O I：

10.3969/j.issn.0372-2112.2012.05.031

中图分类号：

学科分类号：

摘要：

To correct the problem that traditional secret sharing scheme can not take precautions against cheat, in this paper, we propose a rational secret sharing scheme. The proposed scheme based on bilinear pairing is verifiable and the participants' cheat can not work. The dealer doesn't need a secret share distribution. Therefore, the scheme greatly improves the efficiency of secret distribution. In addition, the trusted party is eliminated in the secret reconstruction phase. The gain of following the protocol is more than the gain of deviating, so rational player has an incentive to abide by the protocol. Finally, every player can obtain the secret fairly. Moreover, the scheme can withstand the conspiracy attack with at most m-1 players. By analysis, we find the scheme is secure and effective.

引用

页码：1050 / 1054

页数：4

共 13 条

[1]

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

[2]

Blakeley G.R., Safeguarding cryptographic keys, Proceedings of the National Computer Conference, pp. 313-317, (1979)

[3]

Chor B., Goldwasser S., Micali S., Verifiable secret sharing and achieving simultaneity in the presence of faults, Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 383-395, (1985)

[4]

Feldman P., A practical scheme for non-interactive verifiable secret sharing, Proceedings of the 28th IEEE Symp. On Foundations of Comp, Science (FOCS'87), pp. 427-437, (1987)

[5]

Pedersen T.P., Distributed provers with applications to undeniable signatures, Proceedings of Eurocrypt'91, pp. 221-238, (1991)

[6]

Lin H.Y., Harn L., Fair reconstruction of a secret, Information Processing Letters, 55, 1, pp. 45-47, (1995)

[7]

Pang L., Liu Y., Wang Y., An efficient (t, n) threshold multi-secret sharing scheme, Acta Electroncia Sinica, 34, 4, pp. 585-589, (2006)

[8]

Halpern J., Teague V., Rational secret sharing and multiparty computation, Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 623-632, (2004)

[9]

Kol G., Naor M., Games for exchanging information, Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 423-432, (2008)

[10]

Maleka S., Amjed S., Rangan C.P., Rational secret sharing with repeated games, 4th Information Security Practice and Experience Conference, pp. 334-346, (2008)

← 1 2 →