Image Secret Sharing
WeiQi Yan, Jonathan Weir, and Mohan S. Kankanhalli · 2017
Interpolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 389 14.3.3 Color Image Sharing Based on Moving Lines . . . . . . . . . . . 392 14.3.4 Improved Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 396 14.4 Experiment and Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397 14.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400 Cryptography plays a very vital enabling role in our modern computing infrastructure. Almost all real-world applications require keys (such as passwords) for the purposes of confidentiality, authentication, and nonrepudiation. The strength of such cryptographic applications is based on the secrecy of a key. Therefore, the loss of a key can lead to disastrous consequences. Thus, many cryptographers have tackled the following problem: Suppose a secret s (a key) is divided into n > 1 parts (called secret shares) and it satisfies these properties: 1. The secret key s can be easily restored from k (k ≤ n) shares.