Research ArticleOpen AccessGoogle Scholar indexed
Verifiable Secret Sharing Scheme Based on the Plane Parametric Curve
School of Mathematics, Chengdu Normal University, Chengdu, China
- 1 School of Mathematics, Chengdu Normal University, Chengdu, China
Applied Mathematics·Volume 12 (2021)·Pages 1021–1030·Published 8 November 2021·DOI10.4236/am.2021.1211066
Copy link · social · email
Abstract
Verifiable secret sharing is a special kind of secret sharing. In this paper, A secure and efficient threshold secret sharing scheme is proposed by using the plane parametric curve on the basis of the principle of secret sharing. And the performance of this threshold scheme is analyzed. The results reveal that the threshold scheme has its own advantage of one-parameter representation for a master key, and it is a perfect ideal secret sharing scheme. It can easily detect cheaters by single operation in the participants so that the probability of valid cheating is less than 1/ p (where p is a large prime).
KeywordsPlane Parameter CurveThreshold SchemeVerifiable Secret SharingCheaterInformation RateParticipating Members
- Shamir, A. (1979) How to Share a Secret. Communications of the ACM, 22, 612-613. https://doi.org/10.1145/359168.359176
- Blakley, G.R. (1979) Safeguarding Cryptographic Key. In: Proceedings of the National Computer Conference, AFIPS Press, Montvale, 313-317. https://doi.org/10.1109/MARK.1979.8817296
- Asmuth, C. and Bloom, J. (1983) A Modular Approach to Key Safeguarding. IEEE Transactions on Information Theory, 29, 208-210. https://doi.org/10.1109/TIT.1983.1056651
- Karnin, E.D., Green, J.W. and Hellman, M.E. (1983) On Secret Sharing System. IEEE Transactions on Information Theory, 29, 35-41. https://doi.org/10.1109/TIT.1983.1056621
- Chen, Q., Pei, D.Y., Tang, C.M., et al. (2013) A Note on Ramp Secret Sharing Schemes from Error-Correcting Codes. Mathematical and Computer Modelling, 57, 2695-2702. https://doi.org/10.1016/j.mcm.2011.07.024
- Zablocki, A. (2014) Admissible Tracks in Lai-Ding’s Secret Sharing Scheme. Finite Fields and Their Applications, 27, 72-87. https://doi.org/10.1016/j.ffa.2013.12.006
- Kamer, K. and Selcuk, A.A. (2014) Sharing DSS by the Chinese Remainder Theorem. Journal of Computational and Applied Mathematics, 259, 495-502. https://doi.org/10.1016/j.cam.2013.05.023
- Nojoumian, M. and Stinson, D.R. (2013) On Dealer-Free Dynamic Threshold Schemes. Advances in Mathematics of Communications, 7, 39-56. https://doi.org/10.3934/amc.2013.7.39
- Bogdanov, A., Guo, S. and Komargodski, H. (2020) Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory of Computing, 16, 168-172.
- Shao, J. (2014) Efficient Verifiable Multi-Secret Sharing Scheme Based on Hash Function. Information Sciences, 278, 104-109. https://doi.org/10.1016/j.ins.2014.03.025
- Samaneh, M. and Massoud, H.D. (2015) Two Verifiable Multi Secret Sharing Schemes Based on Nonhomogeneous Linear Recursion and LFSR Public-Key Cryptosystem. Information Sciences, 294, 31-40. https://doi.org/10.1016/j.ins.2014.08.046
- Ma, Z., Ma, Y. and Huang, X.H. (2020) Applying Cheating Identifiable Secret Sharing Scheme in Multimedia Security. EURASIP Journal on Image and Video Processing, 2020, 42. https://doi.org/10.1186/s13640-020-00529-z
- Chen, L.Q., Laing, T.M. and Martin, K.M. (2016) Efficient, XOR-Based, Ideal (t, n)-Threshold Schemes. In: The 15th International Conference on Cryptology and Network Security, Springer, Berlin, 467-483. https://doi.org/10.1007/978-3-319-48965-0_28