A novel approach for multilevel multi-secret image sharing scheme

被引:1
|
作者
Kanchan Bisht
Maroti Deshmukh
机构
[1] National Institute of Technology,
[2] Uttarakhand,undefined
来源
关键词
Multilevel multi-secret image sharing; Secret sharing; Boolean XOR; Reversebits; Modular arithmetic;
D O I
暂无
中图分类号
学科分类号
摘要
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 ‘l’ distinct levels. The paper proposes two variants of the MMSIS scheme. The first variant is an (n,n+1,l)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n,n+1,l)$$\end{document}-MMSIS scheme which encodes ‘n’ secret images each having a unique level id Lk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_k$$\end{document} into (n+1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n+1)$$\end{document} shares. The image shares are then distributed among (n+1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n+1)$$\end{document} participants assigned to ‘l=n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l=n$$\end{document}’ 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 Lk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_k$$\end{document}, all the shares at level Lk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_k$$\end{document} and its preceding levels need to be acquired, which requires the consensus of all participants holding the shares up to level Lk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_k$$\end{document}. 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
页数:34
相关论文
共 50 条
  • [1] A novel approach for multilevel multi-secret image sharing scheme
    Bisht, Kanchan
    Deshmukh, Maroti
    [J]. JOURNAL OF SUPERCOMPUTING, 2021, 77 (10): : 12157 - 12191
  • [2] On Novel Verifiable Multi-Secret Sharing Scheme
    Wang, Jian
    Liu, Yanheng
    Wang, Yanxi
    [J]. ADVANCED SCIENCE LETTERS, 2011, 4 (11-12) : 3709 - 3715
  • [3] Multi-Secret Image Sharing Scheme by Boolean Operations
    Chen, Chien-Chang
    Lin, Cheng-Shian
    Chen, Jia-Zhan
    [J]. 2022 IEEE 18TH INTERNATIONAL COLLOQUIUM ON SIGNAL PROCESSING & APPLICATIONS (CSPA 2022), 2022, : 397 - 402
  • [4] A Novel Approach of an (n, n) Multi-Secret Image Sharing Scheme Using Additive Modulo
    Deshmukh, Maroti
    Nain, Neeta
    Ahmed, Mushtaq
    [J]. PROCEEDINGS OF INTERNATIONAL CONFERENCE ON COMPUTER VISION AND IMAGE PROCESSING, CVIP 2016, VOL 1, 2017, 459 : 149 - 158
  • [5] A new multi-secret image sharing scheme based on DCT
    Oinam Bidyapati Chanu
    Arambam Neelima
    [J]. The Visual Computer, 2020, 36 : 939 - 950
  • [6] A scheme for threshold multi-secret sharing
    Chan, CW
    Chang, CC
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2005, 166 (01) : 1 - 14
  • [7] An efficient Boolean based multi-secret image sharing scheme
    Amitava Nag
    Jyoti Prakash Singh
    Amit Kumar Singh
    [J]. Multimedia Tools and Applications, 2020, 79 : 16219 - 16243
  • [8] An efficient Boolean based multi-secret image sharing scheme
    Nag, Amitava
    Singh, Jyoti Prakash
    Singh, Amit Kumar
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (23-24) : 16219 - 16243
  • [9] A new multi-secret image sharing scheme based on DCT
    Chanu, Oinam Bidyapati
    Neelima, Arambam
    [J]. VISUAL COMPUTER, 2020, 36 (05): : 939 - 950
  • [10] A VERIFIABLE MULTI-SECRET SHARING SCHEME
    Wang, Yong
    Zhu, Yanqin
    Luo, Xizhao
    [J]. INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE & TECHNOLOGY, PROCEEDINGS, 2009, : 136 - 138