Affiliations: [a] School of Computer Science and Engineering, XI’AN University of Technology, XI’AN City, China
| [b] Department of Computer Science and Information Engineering, National Dong Hwa University, TaiWan
Correspondence:
[*]
Corresponding author. Yan-Xiao Liu, School of Computer Science and Engineering, XI’AN University of Technology, XI’AN City, China. E-mail: liuyanxiao@xaut.edu.cn.
Abstract: Traditional (k, n) secret image sharing provides all-or-nothing decoding model and (k, n) scalable secret image sharing provides progress decoding model during image reconstruction. Both these two decoding models are significance in various applications. However, the security level for real applications would change due to the dynamical environment, only one single decoding model cannot satisfy the changeable security requirement. In this work, we construct scalable secret image sharing schemes that provides both all-or-nothing and progress decoding models to satisfy the dynamical secure requirement. Each participant in our schemes only needs to keep one initial-shadow. During image reconstruction, the dealer selects the decoding model according to current security requirement, if progress model is chosen, initial shadows can achieve image reconstruction in progress model without any modification; else if all-or-nothing model is chosen, the dealer does not need to resent new shadows to participants, the initial-shadows can be updated to satisfy all-or-nothing model efficiently.
