A novel approach for multilevel multi-secret image sharing scheme

被引:9
作者
Bisht, Kanchan [1 ]
Deshmukh, Maroti [1 ]
机构
[1] Natl Inst Technol, Srinagar, Uttarakhand, India
关键词
Multilevel multi-secret image sharing; Secret sharing; Boolean XOR; Reversebits; Modular arithmetic; EFFICIENT; LOSSLESS; SECURE; STEGANOGRAPHY; XOR;
D O I
10.1007/s11227-021-03747-y
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-secret sharing (MSS) is an effective technique that securely encodes multiple secrets to generate shares and distributes them among the participants in such a way that these shares can be used later to reconstruct the secrets. MSS schemes have a considerable advantage over the single-secret sharing schemes for secure multimedia data transmission. This paper presents a novel secret image sharing approach, namely '(n, m, l)-Multilevel Multi-Secret Image Sharing (MMSIS) scheme.' The proposed MMSIS scheme encodes 'n' distinct secret images to generate 'm' shares and distributes them among 'm' participants allocated to T distinct levels. The paper proposes two variants of the MMSIS scheme. The first variant is an (n, n + 1, l)-MMSIS scheme which encodes 'n' secret images each having a unique level id L-k into (n + 1) shares. The image shares are then distributed among (n + 1) participants assigned to 'l = n' different levels. With the increase in level id, the number of shares required to reconstruct the secret image also increases. To reconstruct a secret image of a particular level L-k, all the shares at level Lk and its preceding levels need to be acquired, which requires the consensus of all participants holding the shares up to level Lk. The second variant, namely extended-MMSIS (EMMSIS) scheme is a generalized (n, m, l) version of the former scheme that allows to generate more shares for a specific secret image at a particular level in accordance with the consensus requirements for its reconstruction. The multilevel structure of the scheme makes it useful for multi-secret distribution in a multilevel organizational structure.
引用
收藏
页码:12157 / 12191
页数:35
相关论文
共 40 条
  • [1] Agarwal, 2021, INT J INF TECHNOL, P1
  • [2] A MODULAR APPROACH TO KEY SAFEGUARDING
    ASMUTH, C
    BLOOM, J
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) : 208 - 210
  • [3] Basit A, 2017, 2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND AUTOMATION (ICCCA), P557, DOI 10.1109/CCAA.2017.8229863
  • [4] Blakley G R., 1979, INT WORKSH MAN REQ K, P313, DOI [10.1109/MARK.1979.8817296, 10.1109/AFIPS.1979.98, DOI 10.1109/MARK.1979.8817296]
  • [5] XOR-based progressive visual secret sharing using generalized random grids
    Chao, Her-Chang
    Fan, Tzuo-Yau
    [J]. DISPLAYS, 2017, 49 : 6 - 15
  • [6] A secure Boolean-based multi-secret image sharing scheme
    Chen, Chien-Chang
    Wu, Wei-Jie
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2014, 92 : 107 - 114
  • [7] An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages
    Chen, Dong
    Lu, Wei
    Xing, Weiwei
    Wang, Na
    [J]. IEEE ACCESS, 2019, 7 : 107104 - 107110
  • [8] Efficient multi-secret image sharing based on Boolean operations
    Chen, Tzung-Her
    Wu, Chang-Sian
    [J]. SIGNAL PROCESSING, 2011, 91 (01) : 90 - 97
  • [9] Secret sharing scheme based on binary trees and Boolean operation
    Deshmukh, Maroti
    Nain, Neeta
    Ahmed, Mushtaq
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2019, 60 (03) : 1377 - 1396
  • [10] Efficient and secure multi secret sharing schemes based on boolean XOR and arithmetic modulo
    Deshmukh, Maroti
    Nain, Neeta
    Ahmed, Mushtaq
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2018, 77 (01) : 89 - 107