Abstract
The increase in networking along with communications taking place through the open network have resulted in multifarious intensification of rancorous and vengeful blitzkrieg. Our sensitive data, hence, is always at high risk of getting misused. In this paper, we present our proposed method of changeable threshold-based secrecy scheme, where, whenever required, the threshold can be easily changed. For this, we modify the original Shamir’s (t, n) scheme because it has some inherent flaws of cheating and also because it was not possible to change the threshold there. The transpiring blockchain technology has favorable properties like it being very secure, and so, we incorporate it in our technique. We make use of the high computation dependent proof-of-work to provide reliable security to our mechanism. Our method is capable to procure multiple secure keys for an individual group. However, all the participants must collaborate together. All different groups will have unique secret keys. Not only adversaries are prevented from cheating, but also fairness of dealer is ensured by preventing from getting involved in partiality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1–10 (1988)
D. Chaum, C. Crépeau, I. Damgård, Multiparty unconditionally secure protocols, in Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 11–19 (1988)
M. Naor, A. Wool, Access control and signatures via quorum secret sharing, in 3rd ACM Conference on Computer and Communications Security, pp. 157–167 (1996)
B. Waters, Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization, in PKC 2011, ed. by D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi. LNCS, vol. 6571 (Springer, Heidelberg, 2011), pp. 53–70
T. Tassa, Generalized oblivious transfer by secret sharing. Des. Codes Crypt. 58(1), 11–21 (2011)
A. Shamir, How to share a secret . Commun. ACM 22, 612–613 (1979)
G.R. Blakley, Safeguarding cryptographic keys, in Proceedings of AFIPS’79 National Computer Conference, Scientific Research, vol. 48, pp. 313–317 (1979)
L. Harn, C. Lin, Detection and identification of cheaters in (t, n) secret sharing scheme. Des. Codes Cryptogr. 52, 15–24 (2009)
Al. Sutjijana, Subanar, Suparna, A generalization of Shamir's secret sharing scheme. J. Algebra 9(6), 283—290 (2015)
Y.-x. Liu, Z.-x. Wang, W.-y. Yan, Linear (k, n) secret sharing scheme with cheating detection. Ubiquitous Comput. Commun. IEEE Computer Society, 1942–1947 (2015)
A.K. Biswas, M. Dasgupta, Cryptanalysis and enhancement of Harn-Lin’s secret sharing scheme with cheating detection, in 2020 First International Conference on Power, Control and Computing Technologies (ICPC2T), Raipur, India, pp. 27–32 (2020). https://doi.org/10.1109/ICPC2T48082.2020.9071470
S. Nakamoto, Bitcoin: A Peer-to-Peer electronic cash system (2008). https://bitcoin.org/bitcoin.pdf
A.K. Biswas, M. Dasgupta, Bitcoin cryptocurrency: its cryptographic weaknesses and remedies. Asia Pac. J. Inf. Syst. 30(1), 21–30 (2020). https://doi.org/10.14329/apjis.2020.30.1.21
M. Crosby, P. Pattanayak, S. Verma, V. Kalyanaraman, Blockchain technology: beyond bitcoin. Appl. Innov. 2(6–10), 71 (2016)
Author information
Authors and Affiliations
Corresponding author
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 paper
Cite this paper
Biswas, A.K., Dasgupta, M. (2021). Blockchain Enabled and Changeable Threshold-Based Group Specific Multiple Keys’ Negotiation. In: Sabut, S.K., Ray, A.K., Pati, B., Acharya, U.R. (eds) Proceedings of International Conference on Communication, Circuits, and Systems. Lecture Notes in Electrical Engineering, vol 728. Springer, Singapore. https://doi.org/10.1007/978-981-33-4866-0_18
Download citation
DOI: https://doi.org/10.1007/978-981-33-4866-0_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-33-4865-3
Online ISBN: 978-981-33-4866-0
eBook Packages: Computer ScienceComputer Science (R0)