Abstract
Secret-key negotiations are important that enable any user to achieve information security as well as data privacy. Two efficient key negotiation schemes, which provide base security for developing different cryptographic techniques, are proposed. We work with Shamir’s (t, n) threshold secret sharing scheme (SSS) and provide protection against misbehaved activities of dealer and/or dishonest participants as they exist in the scheme unfortunately. The first SSS is designed based on subset secret such that if the reconstructed secret belongs to this set, then probably, no share cheating is occurred. The other scheme has two variations―(1) a dealer-based (t, t) SS and (2) a KGC-based (t, n) SS, where shares’ cheating and both dealer and shares’ cheating are protected as key generation center (KGC) is cryptographically trusted and used in variety of security applications. As performance study, a comparison of the proposed SSSs with Shamir’s one is given.
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
Li S, Zhuge JW, Li X (2013) Study on BGP security. Chin J Softw 24(1):121–138
Saini H, Rao YS, Panda TC (2012) Cyber-crimes and their impacts: a review. Int J Eng Res Appl (IJERA) 2(2):202–209. ISSN: 2248–9622
Lagazio M et al (2014) A multi-level approach to understanding the impact of cybercrime on the financial sector. Comput Secur Elsevier 45:58–74
Kim J, Tong L, Thomas RJ (2014) Dynamic attacks on power systems economic dispatch. In: 48th Asilomar conference on signals, systems and computers, IEEE, pp 345–349
Gutub A, AlKhodaidi T (2020) Smart expansion of target key for more handlers to access multimedia counting-based secret sharing. Multimed Tools Appl 79:17373–17401
Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theor IT-22(6):644–654
Shamir A (1979) How to share a secret. Commun ACM 22:612–613
Tompa M, Woll H (1989) How to share a secret with cheaters. J Cryptol 1:133–138
Harn L, Lin C (2009) Detection and identification of cheaters in (t, n) secret sharing scheme. Des Codes Cryptograph ACM Dig Libr 52:15–24
Biswas AK, Dasgupta M (2020) Cryptanalysis and enhancement of Harn-Lin’s secret sharing scheme with cheating detection. In: 2020 1st international conference on power, control and computing technologies (ICPC2T), Raipur, India, pp. 27–31. https://doi.org/10.1109/ICPC2T48082.2020.9071470
Fujii Y, Tada M, Hosaka N, Tochikubo K, Kato T (2005) A Fast (2, n)-Threshold scheme and its application. CSS 2005:631–636
Tassa T (2007) Hierarchical threshold secret sharing. J Cryptol 20(2):237–264
Concone F, Lo Re G, Morana MSMCP (2020) A secure mobile crowd sensing protocol for fog-based applications. Hum Cent Comput Inf Sci 10:28
Biswas AK, Dasgupta M (2020) Two polynomials based (t, n) threshold secret sharing scheme with cheating detection. Cryptologia:1–14. https://doi.org/10.1080/01611194.2020.1717676
Li C, Xu C, Zhao Y, Chen K, Zhang X (2020) Certificateless identity-concealed authenticated encryption under multi-KGC. In: Liu Z, Yung M (eds) Information security and cryptology. Inscrypt 2019. Lecture notes in computer science, vol 12020. Springer, Cham
Sun H, Li L, Zhang J, Huang W (2020) An improved dynamic certificateless authenticated asymmetric group key agreement protocol with trusted KGC. In: Tian Y, Ma T, Khan M (eds) Big data and security. ICBDS 2019. Communications in computer and information science, vol 1210. Springer, Singapore
Boneh D, Franklin M (2003) Identity-based encryption from the Weil pairing. SIAM J Comput 32(3):586–615
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Biswas, A.K., Dasgupta, M. (2021). Cheating-Tolerant and Threshold-Based Secure Information Exchange Among Propinquity of Adversaries. In: Singh, B., Coello Coello, C.A., Jindal, P., Verma, P. (eds) Intelligent Computing and Communication Systems. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-16-1295-4_11
Download citation
DOI: https://doi.org/10.1007/978-981-16-1295-4_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-1294-7
Online ISBN: 978-981-16-1295-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)