Scalable secret image sharing |
| |
| Affiliation: | 1. Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran;2. Laboratory of Systems and Intelligent Agents (SINA), Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran;3. Electrical and Computer Engineering Department, Yazd University, Yazd, Iran;1. Department of Computer Science, Jinan University, Guangzhou, China;2. Nanjing University of Information Science & Technology, Nanjing, China;3. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China;4. Guangdong Provincial Big Data Collaborative Innovation Center, Shenzhen University, Shenzhen, China;5. Department of Computer Science, Auckland University of Technology, Auckland, New Zealand |
| |
| Abstract: | In this paper, we propose an innovative scheme, namely the scalable secret image sharing scheme, for sharing an image O among n participants such that the clarity of the reconstructed image (i.e., the amount of information therein) scales with proportion with the number of the participants. The proposed scheme encodes O into n shadow images that exhibit the following features: (a) each shadow image reveals no information about O, (b) each shadow image is only half the size of O, (c) any k (2?k?n) shadow images can be used to reconstruct O in a scalable manner such that the amount of information about O is proportional to k, and (d) O can be reconstructed perfectly when all of the n shadow images are available. The clarity of O can be measured in terms of several metrics. We define three modes, namely the multisecret, priority, and progressive modes, for sharing O in our scheme. The scalability and flexibility of the proposed schemes indicate the wide range of potential applications for secret image sharing. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
