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

Lossless and Efficient Secret Image Sharing Based on Matrix Theory Modulo 256

Author

Listed:
  • Long Yu

    (College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
    Anhui Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China)

  • Lintao Liu

    (College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
    Anhui Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China)

  • Zhe Xia

    (Department of Computing, Wuhan University of Technology, Wuhan 430070, China)

  • Xuehu Yan

    (College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
    Anhui Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China)

  • Yuliang Lu

    (College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China
    Anhui Key Laboratory of Cyberspace Security Situation Awareness and Evaluation, Hefei 230037, China)

Abstract

Most of today’s secret image sharing (SIS) schemes are based on Shamir’s polynomial-based secret sharing (SS), which cannot recover pixels larger than 250. Many exiting methods of lossless recovery are not perfect, because several problems arise, such as large computational costs, pixel expansion and uneven pixel distribution of shadow image. In order to solve these problems and achieve perfect lossless recovery and efficiency, we propose a scheme based on matrix theory modulo 256, which satisfies ( k , k ) and ( k , k + 1 ) thresholds. Firstly, a sharing matrix is generated by the filter operation, which is used to encrypt the secret image into n shadow images, and then the secret image can be obtained by matrix inverse and matrix multiplication with k or more shadows in the recovery phase. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme.

Suggested Citation

  • Long Yu & Lintao Liu & Zhe Xia & Xuehu Yan & Yuliang Lu, 2020. "Lossless and Efficient Secret Image Sharing Based on Matrix Theory Modulo 256," Mathematics, MDPI, vol. 8(6), pages 1-17, June.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:6:p:1018-:d:374634
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xin Wang & Peng Li & Zihan Ren, 2022. "Two-in-One Secret Image Sharing Scheme with Higher Visual Quality of the Previewed Image," Mathematics, MDPI, vol. 10(5), pages 1-15, February.

    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:6:p:1018-:d:374634. 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.