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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call