Linear complementary dual code-based Multi-secret sharing scheme
This work addresses secure information protection in cryptography, but it appears incremental as it builds on existing code-based schemes with specific improvements.
The paper tackles the problem of multi-secret sharing by proposing a scheme based on linear complementary dual codes over a local ring, achieving a perfect and almost ideal scheme with a larger secret space than other code-based methods.
Hiding a secret is needed in many situations. Secret sharing plays an important role in protecting information from getting lost, stolen, or destroyed and has been applicable in recent years. A secret sharing scheme is a cryptographic protocol in which a dealer divides the secret into several pieces of share and one share is given to each participant. To recover the secret, the dealer requires a subset of participants called access structure. In this paper, we present a multi-secret sharing scheme over a local ring based on linear complementary dual codes using Blakley's method. We take a large secret space over a local ring that is greater than other code-based schemes and obtain a perfect and almost ideal scheme.