Secret sharing is one of the most important cryptographic protocols.Secret sharing schemes (SSS) have been created to that end.This protocol requires a dealer and several participants.The dealer divides the secret into several pieces ( the shares), Games and one share is given to each participant.The secret can be recovered once a subset of the participants (a coalition) shares their information.
In this paper, we present a new multisecret-sharing scheme inspired by Blakley’s method based on hyperplanes intersection but adapted to a coding theoretic situation.Unique Pants recovery requires the use of linear complementary (LCD) codes, that is, codes in which intersection with their duals is trivial.For a given code length and dimension, our system allows dealing with larger secrets and more users than other code-based schemes.