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

A k , n -Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

Author

Listed:
  • Ji-Hwei Horng

    (Department of Electronic Engineering, National Quemoy University, Kinmen 89250, Taiwan)

  • Si-Sheng Chen

    (School of Big Data and Artificial Intelligence of Fujian Polytechnic Normal University, Fuzhou 350030, China
    Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, Taiwan)

  • Chin-Chen Chang

    (Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, Taiwan)

Abstract

Secret image sharing is a hot issue in the research field of data hiding schemes for digital images. This paper proposes a general k , n threshold secret image sharing scheme, which distributes secret data into n meaningful image shadows based on a non-full rank linear model. The image shadows are indistinguishable from their corresponding distinct cover images. Any k combination of the n shares can perfectly restore the secret data. In the proposed scheme, the integer parameters k , n , with k ≤ n , can be set arbitrarily to meet the application requirement. The experimental results demonstrate the applicability of the proposed general scheme. The embedding capacity, the visual quality of image shadows, and the security level are satisfactory.

Suggested Citation

  • Ji-Hwei Horng & Si-Sheng Chen & Chin-Chen Chang, 2022. "A k , n -Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model," Mathematics, MDPI, vol. 10(3), pages 1-19, February.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:3:p:524-:d:743950
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/3/524/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/3/524/
    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:10:y:2022:i:3:p:524-:d:743950. 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.