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 条
  • [31] A new multi-secret sharing scheme with multi-policy
    Geng Yong-Jun
    Fan Xiao-Hong
    Hong Fan
    9th International Conference on Advanced Communication Technology: Toward Network Innovation Beyond Evolution, Vols 1-3, 2007, : 1515 - 1517
  • [32] A practical (t, n) multi-secret sharing scheme
    Chien, HY
    Jan, JK
    Tseng, YM
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (12) : 2762 - 2765
  • [33] A new double layer multi-secret sharing scheme
    Gunasekaran, Elavarasi
    Muthuraman, Vanitha
    CHINA COMMUNICATIONS, 2024, 21 (01) : 287 - 309
  • [34] Multi-secret sharing scheme based on cellular automata
    Institute of Hydropower System and Hydroinformatics, Dalian Univ. of Tech, Dalian 116024, China
    不详
    不详
    Xitong Gongcheng Lilum yu Shijian, 2006, 6 (113-116):
  • [35] Design and Analysis of a New Multi-secret Sharing Scheme
    Liu Feng
    Gao Dong-Mei
    2009 ETP INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION (FCC 2009), 2009, : 241 - 243
  • [36] An ideal multi-secret sharing scheme based on MSP
    Hsu, Ching-Fang
    Cheng, Qi
    Tang, Xueming
    Zeng, Bing
    INFORMATION SCIENCES, 2011, 181 (07) : 1403 - 1409
  • [37] Multi-secret sharing scheme with general access structures
    Li, Hui-Xian
    Cheng, Chun-Tian
    Pang, Liao-Jun
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2006, 34 (06): : 95 - 98
  • [38] AN IDEAL MULTI-SECRET SHARING SCHEME BASED ON MSP
    Hei, Zan
    Li, Zhi-Hui
    Wu, Xingxing
    QUANTITATIVE LOGIC AND SOFT COMPUTING, 2012, 5 : 246 - 251
  • [39] A New Approach to Weighted Multi-Secret Sharing
    Zou, Xukai
    Maino, Fabio
    Bertino, Elisa
    Sui, Yan
    Wang, Kai
    Li, Feng
    2011 20TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2011,
  • [40] A Publicly Verifiable Multi-Secret Sharing Scheme With Outsourcing Secret Reconstruction
    Lin, Changlu
    Hu, Huidan
    Chang, Chin-Chen
    Tang, Shaohua
    IEEE ACCESS, 2018, 6 : 70666 - 70673