A Verifiable Secret Sharing Scheme using Elliptic Curve Cryptography
Haradhan Ghosh, Pramod Kumar Maurya, Satya Bagchi · 2023
One of the significant problems with communication technology is data privacy, which impacts our everyday activities. Sharing a secret is crucial for safe contact and has many uses in information security. Secret sharing allows a select group of authorised users to view private information. Few authorised members are given access to the secret key in various organisations, with a certain number of them being expected to figure out the secret. In secret sharing, all individuals are assumed to be trustworthy, but in reality, there is the chance of cheating. This study suggests a threshold method called verifiable secret sharing to detect a cheater and verify each individual’s honesty. The elliptic curve cryptosystem, hash function, XOR, and Lagrange interpolation technique do the sharing process. Only shadow shares, not the actual shares, are given to the participants, and before sending information, participants perform combiner authentication. Analysis of security and performance reveals that the proposed method is more effective.