Abstract
There are many schemes to detect and identify cheaters when the number of participants is exactly equal to \( t \) in secret sharing schemes. However, most of them need dealers or redundant information to detect the dishonest participants when participants are greater than threshold \( t \). Harn et al. proposed a dynamic threshold secret reconstruction scheme, which the threshold can be improved to \( k \) during reconstruction. Less than \( k - 1 \) participants cannot recover the shared secret. Their scheme uses the symmetric polynomial to resist the external adversary. However, each participant needs to hold a polynomial. Thus, the complexity of storage of the scheme is high. Furthermore, the scheme cannot detect and identify the cheaters who present falsified information during secret reconstruction. In this paper, we propose a secret sharing scheme with dynamic threshold \( k \) that can identify up to \( k - 1 \) dishonest participants who have no legal share information. The scheme does not need the help of the dealer to detect cheaters. The dealer uses the traditional polynomial to distribute a secret to each participant. In the secret reconstruction phase, the share information of each participant is transformed and then presents to other participants who verify it using the public key of the sender. If the presented information is falsified, it will fail the verification and the related participant is identified as a cheater. Otherwise, the secret can be correctly reconstructed. Meanwhile, our scheme ensures that the external adversary who eavesdrops the reconstruction messages cannot recover the secret. The trade-off is that our scheme has additional computation overhead.
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
Similar content being viewed by others
References
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science, pp. 383–395. IEEE (1985)
Laih, C.S., Harn, L., Lee, J.Y., Hwang, T.: Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space. In: Advances in Cryptology, pp. 286–298. Springer, New York (1989)
Min, Z., Huang, T.L., Min, Z.: A RSA keys sharing scheme based on dynamic threshold secret sharing algorithm for WMNs. In: International Conference on Intelligent Computing and Integrated Systems, pp. 160–163 (2010)
Wang, F., Zhou, Y.S., Li, D.F.: Dynamic threshold changeable multi-policy secret sharing scheme. Secur. Commun. Netw. 8(11), 1002–1008 (2015)
Tadayon, M.H., Khanmohammadi, H., Arabi, S.: An attack on a dynamic multi-secret sharing scheme and enhancing its security. In: Electrical Engineering, pp. 1–5 (2013)
Yuan, L., Li, M., Guo, C., Choo, K.R., Ren, Y.: Novel threshold changeable secret sharing schemes based on polynomial interpolation. PLoS ONE 11(10), 1–19 (2016)
Qu, J., Zou, L., Zhang, J.: A practical dynamic multi-secret sharing scheme. In: IEEE International Conference on Information Theory and Information Security, pp. 629–631. IEEE (2010)
Harn, L.: Secure secret reconstruction and multi-secret sharing schemes with unconditional security. Secur. Commun. Netw. 7(3), 567–573 (2014)
Tadayon, M.H., Khanmohammadi, H., Sayad Haghighi, M.: Dynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps. IET Inf. Secur. 9(4), 234–239 (2014)
Pilaram, H., Eghlidos, T.: A lattice-based changeable threshold multi-secret sharing scheme and its application to threshold cryptography. Scientia Iranica 24(3), 1448–1457 (2017)
Wei, C., Xiang, L., Bai, Y., Gao, X.: A new dynamic threshold secret sharing scheme from bilinear maps. In: International Conference on Parallel Processing Workshops, pp. 19–22. IEEE Computer Society (2007)
Harn, L., Hsu, C.F.: A novel threshold cryptography with membership authentication and key establishment. Wirel. Pers. Commun. 97(11), 1–8 (2017)
Harn, L., Hsu, C.F.: Dynamic threshold secret reconstruction and its application to the threshold cryptography. Inf. Process. Lett. 115(11), 851–857 (2015)
Traverso, G., Demirel, D., Buchmann, J.: Dynamic and verifiable hierarchical secret sharing. In: Information Theoretic Security. Springer (2016)
Harn, L., Lin, C.: Detection and identification of cheaters in \( (t,n) \) secret sharing scheme. Des. Codes Cryptogr. 52(1), 15–24 (2009)
Acknowledgment
This work was supported in part by the National key R&D program of China under Grant 2017YFC0820102, the National Natural Science Foundation of China under Grant U1536102, and Grant U1536116, in part by China Mobile Research Fund Project (MCM20170407), and State Administration of Press, Publication, Radio, Film and Television (SAPPRFT) Key Laboratory of Digital Content Anti-Counterfeiting and Security Forensics.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
He, YZ., Xu, XJ., Wang, DS., Li, SD., Zhao, XH., Yang, CN. (2020). A Secret Sharing Scheme of Dynamic Threshold with Cheaters Detection and Identification. In: Yang, CN., Peng, SL., Jain, L. (eds) Security with Intelligent Computing and Big-data Services. SICBS 2018. Advances in Intelligent Systems and Computing, vol 895. Springer, Cham. https://doi.org/10.1007/978-3-030-16946-6_52
Download citation
DOI: https://doi.org/10.1007/978-3-030-16946-6_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16945-9
Online ISBN: 978-3-030-16946-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)