Abstract
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), 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 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.
Highlights
Secret sharing schemes (SSS) form one of the key management or establishment schemes introduced independently in 1979 by both Shamir [1] and Blakley [2]
We present a new multisecret-sharing scheme based on linear codes
We propose a new system to construct the multisecret-sharing schemes based on linear codes
Summary
Adel Alahmadi 1 , Alaa Altassan 1 , Ahmad AlKenani 1 , Selda Çalkavur 2 , Hatoon Shoaib 1 and Patrick Solé 3,∗. CNRS, Aix Marseille University, Centrale Marseille, I2M, 13009 Marseille, France. Received: 13 January 2020; Accepted: 12 February 2020; Published: 18 February 2020
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
