Threshold changeable secret image sharing scheme based on interpolation polynomial

被引:76
|
作者
Liu, Yan-Xiao [1 ]
Yang, Ching-Nung [2 ]
Wu, Chi-Ming [2 ]
Sun, Qin-Dong [1 ]
Bi, Wei [3 ]
机构
[1] Xian Univ Technol, Dept Comp Sci & Engn, Xian, Shaanxi, Peoples R China
[2] Natl Dong Hwa Univ, Dept CSIE, Shoufeng Township, Hualien County, Taiwan
[3] SeeleTech Corp, San Francisco, CA USA
关键词
Secret image sharing; Threshold changeable; Interpolation polynomial; BOOLEAN-OPERATIONS;
D O I
10.1007/s11042-019-7205-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In previous (k,n) secret image sharing scheme, the threshold k is decided by dealer according to the security requirement, and this threshold value is fixed without considering the dynamic secure environment in future. In this work, we propose a novel threshold changeable secret image sharing scheme where the threshold value can be changed according to the changeable security requirement. In our scheme, each participant only needs to keep one initial shadow. When reconstructing image, the dealer decides the threshold according to security level. If the threshold is unchanged, any k or more initial shadows can recover the image; else if the threshold is increased or decreased, dealer publishes additional information, each participant update their shadows accordingly such that the threshold of updated shadows is changed correspondingly. The contribution of our work is that the threshold of shadows can be changed flexibly to satisfy the dynamic secure environment, and each participant only need to keep one initial shadows. The feature of threshold changeable makes our scheme more practical than previous secret image sharing in some complicated applications.
引用
收藏
页码:18653 / 18667
页数:15
相关论文
共 50 条
  • [31] A novel weighted threshold secret image sharing scheme
    Li, Mingchu
    Ma, Shu
    Guo, Cheng
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (17) : 3083 - 3093
  • [32] A scheme for (t, n) threshold secret image sharing
    Chan, Chao-Wen
    Chang, Thin-Chen
    IMECS 2006: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, 2006, : 619 - +
  • [33] A Novel Hierarchical Threshold Secret Image Sharing Scheme
    Qin, Shiyue
    Tan, Zhenhua
    Li, Hong
    2020 IEEE INTL SYMP ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, INTL CONF ON BIG DATA & CLOUD COMPUTING, INTL SYMP SOCIAL COMPUTING & NETWORKING, INTL CONF ON SUSTAINABLE COMPUTING & COMMUNICATIONS (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2020), 2020, : 1163 - 1167
  • [34] Full threshold change range of threshold changeable secret sharing
    Ding, Jian
    Lin, Changlu
    Lin, Fuchun
    Wang, Huaxiong
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (07) : 2421 - 2447
  • [35] Full threshold change range of threshold changeable secret sharing
    Jian Ding
    Changlu Lin
    Fuchun Lin
    Huaxiong Wang
    Designs, Codes and Cryptography, 2023, 91 : 2421 - 2447
  • [36] Polynomial Based Progressive Secret Image Sharing Scheme With Smaller Shadow Size
    Guo, Yongzhen
    Ma, Zhuo
    Zhao, Meng
    IEEE ACCESS, 2019, 7 : 73782 - 73789
  • [37] Weighted Polynomial-Based Secret Image Sharing Scheme with Lossless Recovery
    Wang, Yongjie
    Chen, Jia
    Gong, Qinghong
    Yan, Xuehu
    Sun, Yuyuan
    SECURITY AND COMMUNICATION NETWORKS, 2021, 2021
  • [38] Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery
    Ding, Wanmeng
    Liu, Kesheng
    Yan, Xuehu
    Liu, Lintao
    INTERNATIONAL JOURNAL OF DIGITAL CRIME AND FORENSICS, 2018, 10 (02) : 120 - 136
  • [39] Sure Interpolation and Its Application to Hierarchical Threshold Secret Sharing Scheme
    Zhang Yanshuo
    Liu Zhuojun
    Huang Guifang
    ISCSCT 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 447 - +
  • [40] A Compact Secret Image Sharing Scheme Based on Flexible Secret Matrix Sharing Scheme
    Wang, Lingfu
    Wang, Jing
    Zhang, Mingwu
    Huang, Weijia
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT III, 2022, 13157 : 411 - 431