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 条
  • [41] Efficient collusion resistant multi-secret image sharing
    Mishra, Kapil
    Kavala, Sannihith
    Singh, Satish Kr.
    Nagabhushan, P.
    MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (43-44) : 33233 - 33252
  • [42] Blockchain-based authenticable (k,n) multi-secret image sharing scheme
    Sarkar, Puja
    Nag, Amitava
    Singh, Jyoti Prakash
    JOURNAL OF ELECTRONIC IMAGING, 2023, 32 (05)
  • [43] A verifiable multi-secret image sharing scheme using XOR operation and hash function
    Chattopadhyay, Arup Kumar
    Nag, Amitava
    Singh, Jyoti Prakash
    Singh, Amit Kumar
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (28-29) : 35051 - 35080
  • [44] Efficient collusion resistant multi-secret image sharing
    Kapil Mishra
    Sannihith Kavala
    Satish Kr. Singh
    P. Nagabhushan
    Multimedia Tools and Applications, 2020, 79 : 33233 - 33252
  • [45] A verifiable multi-secret image sharing scheme using XOR operation and hash function
    Arup Kumar Chattopadhyay
    Amitava Nag
    Jyoti Prakash Singh
    Amit Kumar Singh
    Multimedia Tools and Applications, 2021, 80 : 35051 - 35080
  • [46] Multi-secret sharing scheme based on the general access structure
    Pang, Liaojun
    Jiang, Zhengtao
    Wang, Yumin
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2006, 43 (01): : 33 - 38
  • [47] A Secure and Efficient (t, n) Multi-Secret Sharing Scheme
    PANG Liao-jun
    WuhanUniversityJournalofNaturalSciences, 2005, (01) : 191 - 194
  • [48] A verifiable multi-secret sharing scheme based on cellular automata
    Eslami, Z.
    Ahmadabadi, J. Zarepour
    INFORMATION SCIENCES, 2010, 180 (15) : 2889 - 2894
  • [49] A Novel Visual Multi-Secret Sharing Scheme Based on Folding-up Operation
    Wang Xiang
    Pei Qingqi
    Yan Peimin
    Li Hui
    Wang Yong
    CHINESE JOURNAL OF ELECTRONICS, 2013, 22 (04): : 795 - 798
  • [50] An efficient (t, n) multi-secret sharing scheme with verification
    Pang, L. J.
    Li, H. X.
    Jiao, L. C.
    Wang, Y. M.
    2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 2, 2008, : 552 - 557