Linear complementary dual code-based Multi-secret sharing scheme

TL;DR

This paper introduces a multi-secret sharing scheme based on linear complementary dual codes over a local ring, providing a larger secret space and a perfect, almost ideal scheme for secure information distribution.

Contribution

It proposes a novel multi-secret sharing scheme utilizing linear complementary dual codes over a local ring, enhancing secret space and scheme efficiency.

Findings

Achieves a larger secret space than existing code-based schemes.

Provides a perfect and almost ideal secret sharing scheme.

Utilizes Blakley's method for scheme construction.

Abstract

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.