Abstract
In (t, n) threshold secret sharing scheme, the dealer distributes secret among a group of n participants, and any t threshold number of participants can reconstruct the secret. However, \(t-1\) or lesser number of participants can not retrieve the secret. In verifiable secret sharing schemes (VSSS), participants can verify their share after receiving shares from the dealer to ensure that a dealer is not malicious. In multipartite secret sharing based on CRT scheme, a set of participants is divided into disjoint partitions, and whatever action performed at a single level is repeated at all other partitions. However, till date there is no mechanism to verify if dealer is malicious or not in multipartite secret sharing based on CRT. Two schemes are proposed for verification of a dealer, namely multipartite verifiable secret sharing based on CRT by using Iften, and multipartite verifiable secret sharing-based CRT by using kameer Kaya. Both proposed schemes are perfectly secure, and the security of both the schemes dependent on discrete logarithm problem.
Supported by organization x.
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
References
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge. IEEE Computer Society (1979)
Benaloh, J.C.: Secret sharing homomorphisms: Keeping shares of a secret secret. In: Conference on the Theory and Application of Cryptographic Techniques. Springer, Berlin, Heidelberg (1986)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (SFCS), pp. 427–438. IEEE (1987)
Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Annual International Cryptology Conference. Springer, Berlin, Heidelberg (1991)
Stinson, D.R., Wei, R.: Unconditionally secure proactive secret sharing scheme with combinatorial structures. In: International Workshop on Selected Areas in Cryptography, Springer, Berlin, Heidelberg (1999)
Patra, A., Choudhary, A., Pandu Rangan, C.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: International Conference on Information Theoretic Security. Springer, Berlin, Heidelberg (2009)
Lin, C., Harn, L.: Unconditionally secure verifiable secret sharing scheme. AISS Adv. Inf. Sci. Service Sci. 4(17), 514–518 (2012)
Iftene, S.: Secret sharing schemes with applications in security protocols. Sci. Ann. Cuza Univ. 16, 63–96 (2006)
Qiong, L., et al.: A non-interactive modular verifiable secret sharing scheme. In: Proceedings. International Conference on Communications, Circuits and Systems, vol. 1. IEEE (2005)
Kaya, K., Selçuk, A.A.: A verifiable secret sharing scheme based on the Chinese remainder theorem. International Conference on Cryptology in India. Springer, Berlin, Heidelberg (2008)
Hsu, C.-F., Harn, L.: Multipartite secret sharing based on CRT. Wireless Pers. Commun. 78(1), 271–282 (2014)
Farrs, O., Jaume, M., Padr, C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(3), 434–463 (2012)
Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208–210 (1983)
Boudot, F.: Efficient proofs that a committed number lies in an interval. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Subrahmanyam, R., Rukma Rekha, N., Subba Rao, Y.V. (2022). Multipartite Verifiable Secret Sharing Based on CRT. In: Smys, S., Bestak, R., Palanisamy, R., Kotuliak, I. (eds) Computer Networks and Inventive Communication Technologies . Lecture Notes on Data Engineering and Communications Technologies, vol 75. Springer, Singapore. https://doi.org/10.1007/978-981-16-3728-5_17
Download citation
DOI: https://doi.org/10.1007/978-981-16-3728-5_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-3727-8
Online ISBN: 978-981-16-3728-5
eBook Packages: EngineeringEngineering (R0)