IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i2p272-d322131.html
   My bibliography  Save this article

A Multisecret-Sharing Scheme Based on LCD Codes

Author

Listed:
  • Adel Alahmadi

    (Math Department, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Alaa Altassan

    (Math Department, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Ahmad AlKenani

    (Math Department, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Selda Çalkavur

    (Math Department, Köseköy Vocational School, Kocaeli University, Kocaeli 41135, Turkey)

  • Hatoon Shoaib

    (Math Department, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Patrick Solé

    (CNRS, Aix Marseille University, Centrale Marseille, I2M, 13009 Marseille, France)

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.

Suggested Citation

  • Adel Alahmadi & Alaa Altassan & Ahmad AlKenani & Selda Çalkavur & Hatoon Shoaib & Patrick Solé, 2020. "A Multisecret-Sharing Scheme Based on LCD Codes," Mathematics, MDPI, vol. 8(2), pages 1-10, February.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:272-:d:322131
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/272/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/272/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:272-:d:322131. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.