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

Visual Cryptography Scheme with Essential Participants

Author

Listed:
  • Peng Li

    (Department of Mathematics and Physics, North China Electric Power University, Baoding 071003, China)

  • Liping Yin

    (Department of Mathematics and Physics, North China Electric Power University, Baoding 071003, China)

  • Jianfeng Ma

    (Department of Mathematics and Physics, North China Electric Power University, Baoding 071003, China)

Abstract

Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows printed on transparencies. Stacking shadows can visually decode the secret image without computational resources. Specifically, a ( k , n ) threshold VCS (( k , n )-VCS) shares a secret image into n shadows, stacking any k shadows can reveal the secret image by human visual system, while any less than k shadows cannot decode any information regarding the secret image. In practice, some participants (essentials) play more important roles than others (non-essentials). In this paper, we propose a ( t , s , k , n ) VCS with essential participants (so called ( t , s , k , n )-EVCS). The secret image is shared into n shadows with s essentials and n - s non-essentials. Any k shadows, including at least t essentials, can reveal the secret image. The proposed scheme is constructed from a monotonic ( K , N )-VCS. The condition and optimal choice of ( K , N )-VCS to construct ( t , s , k , n )-EVCS are given by solving integer programming model. The experimental results are conducted to verify the feasibility of our scheme.

Suggested Citation

  • Peng Li & Liping Yin & Jianfeng Ma, 2020. "Visual Cryptography Scheme with Essential Participants," Mathematics, MDPI, vol. 8(5), pages 1-19, May.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:5:p:838-:d:361686
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Dong Xie & Lixiang Li & Haipeng Peng & Yixian Yang, 2017. "A Secure and Efficient Scalable Secret Image Sharing Scheme with Flexible Shadow Sizes," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-17, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zihan Ren & Peng Li & Xin Wang, 2022. "An Implementation of Image Secret Sharing Scheme Based on Matrix Operations," Mathematics, MDPI, vol. 10(6), pages 1-18, March.
    2. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yue Jiang & Xuehu Yan & Jianqing Qi & Yuliang Lu & Xuan Zhou, 2020. "Secret Image Sharing with Dealer-Participatory and Non-Dealer-Participatory Mutual Shadow Authentication Capabilities," Mathematics, MDPI, vol. 8(2), pages 1-20, February.
    2. Qindong Sun & Han Cao & Shancang Li & Houbing Song & Yanxiao Liu, 2022. "Changing the Threshold in a Bivariate Polynomial Based Secret Image Sharing Scheme," Mathematics, MDPI, vol. 10(5), pages 1-11, 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:5:p:838-:d:361686. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.