A New Visual Multi-Secrets Sharing Scheme by Random Grids
AbstractIn (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding process and refining encoding to pass more secret images through two identical shares. However, limited secret images are retrieved, and the quality of the recovered images is low. This paper proposes an advanced (2, 2)-VSS scheme that can embed N secret images into two rectangular shares. Compared with other related VSS schemes, more secret images can be encrypted and the distortion is adjustable in the proposed scheme, yielding more flexibility in theory and practice. View Full-Text
Share & Cite This Article
Chang, J.J.-Y.; Huang, B.-Y.; Juan, J.S.-T. A New Visual Multi-Secrets Sharing Scheme by Random Grids. Cryptography 2018, 2, 24.
Chang JJ-Y, Huang B-Y, Juan JS-T. A New Visual Multi-Secrets Sharing Scheme by Random Grids. Cryptography. 2018; 2(3):24.Chicago/Turabian Style
Chang, Joy J.-Y.; Huang, Bo-Yuan; Juan, Justie S.-T. 2018. "A New Visual Multi-Secrets Sharing Scheme by Random Grids." Cryptography 2, no. 3: 24.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.