Secret Sharing Scheme: Based on LCD Code

Data privacy is one of the main issues in communication technology and affects our daily lives. Secret sharing is essential in secure communication and has numerous applications in information security. Secret sharing is a methodology for accessing sensitive data by a few approved members. It shares the secret key in different structures among a few approved members, a specific number expected to recover the secret. There are many ways to deal with the development of secret sharing schemes. One of them depends on coding theory. There are many secret sharing schemes based on linear codes, but it is complicated to determine the access structure. We present a perfect scheme using linear complementary dual (LCD) codes to give more proficient and adaptable choices for secret sharing. We use the properties of LCD codes involving generator matrix in secret distribution and secret recovery phases. Likewise, we use a one-way hash function to verify the authorized participants by the dealer in the recovery phase. The performance analysis indicates that the proposed scheme is suitable for implementation in secret sharing.