Two-layered structure for optimally essential secret image sharing scheme |
| |
| Affiliation: | 1. Beijing Key Laboratory of Digital Media, School of Computer Science and Engineering, Beihang University, Beijing 100191, China;2. State Key Laboratory of Virtual Reality Technology and Systems, Beihang University, Beijing 100191, China;1. School of Computer and Information, AnHui Polytechnic University, WuHu, AnHui 241000, China;2. Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information, Ministry of Education, Nanjing University of Science and Technology, Nanjing 210094, China;1. Department of Electrical and Computer Engineering, University of Missouri, Columbia, MO 65211, USA;2. Department of Computer Science, Shenzhen University, Shenzhen, Guangdong Providence 518060, China |
| |
| Abstract: | This paper presents a two-layered structure for optimally sharing a secret image among s essential and n − s non-essential shared shadows using the (t, s, k, n) essential thresholds, that t essential shared shadows and totally k shared shadows are needed to recover the secret image. The presented two-layered structure includes one user-defined parameter m to determine different kinds of optimal results. m = 1 leads to minimum size of total shared shadows (ST) and size of an essential shared shadow is close to size of a non-essential shared shadow. On the other hand, m = t leads to size of an essential shared shadow being twice of size of a non-essential shared shadow to signify the importance of an essential shared shadow. Moreover, the proposed structure overcomes the threshold fulfillment problem in Chen’s scheme (Chen, 2016). Theoretical analyses and experimental results show that the proposed scheme exhibits secure with optimal sharing ratios among related works. |
| |
| Keywords: | Secret image sharing Essential Non-essential Two-layered structure Optimal sharing ratios |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
