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 条
  • [21] A Hierarchical Threshold Multi-secret Sharing Scheme
    Shi Runhua
    Zhong Hong
    2008 2ND INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY AND IDENTIFICATION, 2008, : 231 - 234
  • [22] DNA based Multi-Secret Image Sharing
    Anbarasi, L. Jani
    Mala, G. S. Anandha
    Narendra, Modigari
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES, ICICT 2014, 2015, 46 : 1794 - 1801
  • [23] An Efficient and Secure Multi-Secret Image Sharing Scheme with General Access Structure
    Lee, Ching-Fan
    Juan, Justie Su-Tzu
    2009 THIRD IEEE INTERNATIONAL CONFERENCE ON SECURE SOFTWARE INTEGRATION AND RELIABILITY IMPROVEMENT, PROCEEDINGS, 2009, : 253 - 259
  • [24] A New Double Layer Multi-Secret Sharing Scheme
    Elavarasi Gunasekaran
    Vanitha Muthuraman
    ChinaCommunications, 2024, 21 (01) : 297 - 309
  • [25] Multi-secret sharing threshold visual cryptography scheme
    Yu, Bin
    Xu, Xiaohui
    Fang, Liguo
    CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 815 - +
  • [26] A generalized multi-secret sharing scheme to identify cheaters
    Huang, Zhi-Xiong
    Li, Qun-Hui
    Wei, Ren-Yong
    Li, Zhi-Yong
    Tiedao Xuebao/Journal of the China Railway Society, 2007, 29 (06): : 52 - 56
  • [27] A New (t, n) Multi-secret Sharing Scheme
    Tan, Xiao-qing
    Wang, Zhi-guo
    ICCEE 2008: PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, 2008, : 861 - +
  • [28] A Modified Multi-secret Sharing Visual Cryptography Scheme
    Yu, Bin
    Fu, Zhengxin
    Fang, Liguo
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 912 - 915
  • [29] Extended Visual Cryptography Scheme for Multi-secret Sharing
    Reddy, L. Siva
    Prasad, Munaga V. N. K.
    PROCEEDINGS OF 3RD INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING, NETWORKING AND INFORMATICS, ICACNI 2015, VOL 2, 2016, 44 : 249 - 257
  • [30] A hierarchical weighted threshold multi-secret sharing scheme
    Chang, CC
    Pan, YP
    Proceedings of the Second International Conference on Information and Management Sciences, 2002, 2 : 333 - 340