Author:
Alahmadi Adel,Altassan Alaa,AlKenani Ahmad,Çalkavur Selda,Shoaib Hatoon,Solé Patrick
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.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Binary and ternary leading-systematic LCD codes from special functions;Finite Fields and Their Applications;2024-08
2. Hermitian hull of constacyclic codes over a class of non-chain rings and new quantum codes;Computational and Applied Mathematics;2024-06-04
3. LCD codes and almost optimally extendable codes from self-orthogonal codes;Designs, Codes and Cryptography;2024-05-17
4. On quantum and LCD codes from the cyclic codes over the ring $$\mathbb {F}_q[\textsf{u}, \textsf{v},\textsf{w}]/\langle \textsf{u}^3-\textsf{u},\textsf{v}^2-\textsf{v}, \textsf{w}^2-\textsf{w}, \textsf{u}\textsf{v}, \textsf{v}\textsf{u}, \textsf{u}\textsf{w}, \textsf{w}\textsf{u}, \textsf{v}\textsf{w}-\textsf{w}\textsf{v} \rangle $$;Journal of Applied Mathematics and Computing;2024-02-17
5. DNA multi-secret sharing schemes based on linear codes over $${\mathbb {Z}}_{4} \times R$$;Journal of Applied Mathematics and Computing;2023-12