Abstract
In this paper we mainly focus on the cheating problem and the incapability problem existed in rational secret sharing schemes. Based on current schemes and the related knowledge of bit commitment agreement, we proposed a verifiable rational multi-secret sharing scheme in which players can verify the identity of the dealer. In this way, it is feasible to prevent the forger from cheating. The correctness of the secret share is also guaranteed by discrete logarithm problem. The secret shares are divided into groups so that the distribution phase is well designed. The game theory model is also adopted to realize the rational multi secret sharing. The efficient of our scheme has remarkably improved in this protocol as well as the security and feasibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Diffie, W., Hellman, M.: New Directions in Cryptography. J. IEEE Transaction on Information Theory 22(6), 644–654 (1976)
Shamir, A.: How to share a secret. J. Communications of the ACM 22(11), 612–613 (1979)
Blakely, G.R.: Safeguarding Cryptographic Keys. In: Proc. AFIPS 1979 National Computer Conference, New York, NY, pp. 313–317 (1979)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science, pp. 383–395 (1985)
Stadler, M.: Publicly Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)
Schoenmakers, B.: A Simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)
LiaoJun, P., QingQi, P., LiCheng, J., Yu-Min, W.: An Identity (ID)-Based Threshold Multi-Secret Sharing Scheme. Journal of Software 19(10), 2739–2745 (2008)
Dawson, H.J., Dawson, E.: Multisecret-sharing Scheme Based on One-way Function. J. Electronic Letters 31(2), 93–95 (1995)
Harn, L.: Efficient sharing (broadcasting) of multiple secrets. J. IEE Proc. Comput. Digit. Tech. 142(3), 237–240 (1995)
Halpern, J., Teague, V.: Rational Secret Sharing and Multiparty Computation. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 623–632 (2004)
Abraham, I., Dolev, D., Gonen, R.: Distributed computing meets game theory. Robust mechanisms for rational secret sharing and multiparty computation. In: Proc. of 25th ACM PODC, pp. 53–62. ACM Press, Denver (2006)
Gordon, S.D., Katz, J.: Rational Secret Sharing. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229–241. Springer, Heidelberg (2006)
Maleka, S., Shareef, A., Pandu, R.C.: Rational Secret Sharing with Repeated Games. J. Information Security Practice and Experience, 334–346 (2008)
Kol, G., Naor, M.: Cryptography and Game Theory: Designing Protocols for Exchanging Information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320–339. Springer, Heidelberg (2008)
Zhang, E., Cai, Y.Q.: A New Rational Secret Sharing Scheme. J. China Communications 7(4), 18–22 (2010)
Li, D.-w., Yang, G., Yu, C.-g.: A Survey of Rational Secret Sharing schemes. Journal of Nan**g University of Posts and Telecommunications (Natural Science) 30(2), 89–94 (2010)
Shareef, A.: Brief Announcement: Collusion Free Protocol for Rational Secret Sharing. In: 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Zurich, Switzerland, July 25-28, pp. 402–403 (2010)
Halevi, S., Micali, S.: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 22–24. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, Y., Luo, Z., Yang, Y. (2011). Verifiable Rational Multi-secret Sharing Scheme. In: Liu, C., Chang, J., Yang, A. (eds) Information Computing and Applications. ICICA 2011. Communications in Computer and Information Science, vol 244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27452-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-27452-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27451-0
Online ISBN: 978-3-642-27452-7
eBook Packages: Computer ScienceComputer Science (R0)