Abstract
Secret sharing scheme is an important method to share secrets among all participants. Though there are many secret sharing schemes proposed, however, most of the schemes are unfair. For a fair secret sharing scheme, even if there are participants are dishonest, the probability to recover the shared secret is still equal for all participants without releasing their shadows simultaneously. In this article, we propose a simple (v, t, n)-fairness secret sharing scheme. The (v, t, n)-fairness secret sharing scheme is a (t, n) secret sharing scheme with the feature that if there are v, v < t/2, share holders being dishonest, all other share holders still have equal probability to obtain the secret without releasing their shadows simultaneously. The merit of the proposed scheme is that each participant holds only one shadow such that it is convenient and practical for all users, and the computational complexity is quite low for cheater detection or identification.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the National Computer Conference, American Federation of Information Processing Societies, vol. 48, pp. 242–268 (1979)
He, J., Dawson, E.: How to fairly reconstruct a shared secret. In: Cryptography: Policy and Algorithms Conference, Australia, pp. 381–390 (1995)
Hwang, R.J., Chang, C.C.: Enhancing the Efficiency of (v, r, n)-Fairness Secret Sharing Scheme. In: Proceedings of the 18th International Conference on Advanced Information Networking and Application (AINA 2004), vol. 1, pp. 208–212 (2004)
Laih, C.S., Lee, Y.C.: A v-Fairness (t, n) Secret Sharing Scheme. IEE Proceedings Computers and Digital Techniques 144(4), 245–248 (1997)
Lin, H.Y., Harn, L.: Fair Reconstruction of a secret. Information Processing Letters 55, 45–47 (1995)
Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proceedings 21st ACM Symposium on the Theory of Computing, pp. 73–85 (1989)
Secure Hash Standard, Federal Information Processing Standards Publication 180-2 (2002)
Shamir, A.: How to Share a Secret. Communications of ACM 22, 612–613 (1979)
Tompa, M., Woll, H.: How to Share a Secret with Cheaters. Journal of Cryptology 1, 133–138 (1988)
Wu, T.C., Wu, T.S.: Cheating Detection and Cheater Identification in Secret Sharing Schemes. IEE Proceedings-Computers and Digital Techniques 142(5), 367–369 (1995)
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
Lee, YC. (2011). A Simple (v, t, n)-Fairness Secret Sharing Scheme with One Shadow for Each Participant. In: Gong, Z., Luo, X., Chen, J., Lei, J., Wang, F.L. (eds) Web Information Systems and Mining. WISM 2011. Lecture Notes in Computer Science, vol 6987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23971-7_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-23971-7_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23970-0
Online ISBN: 978-3-642-23971-7
eBook Packages: Computer ScienceComputer Science (R0)