Journal ArticleDOI
Multi-secret visual cryptography with deterministic contrast
Reads0
Chats0
TLDR
An (k, n)-MVCS with deterministic contrast is proposed on the basis of the share rotation algorithm and the basis matrices of single secret sharing visual cryptography, which makes the number of secret images not restricted.Abstract:
The multi-secret visual cryptography scheme (MVCS) allows for the encryption of multiple secret images into a given image area. The previous works on MVCS with probabilistic contrast can not guarantee that every original pixel will be reconstructed correctly. However, MVCS with deterministic contrast can reconstruct every original pixel with simple computation for high-end applications, but they are all simple 2-out-of-2 cases. These drawbacks limit the applicability of MVCSs existed. Based on ringed shares, MVCS with deterministic contrast has been defined in this paper. Furthermore, an (k, n)-MVCS with deterministic contrast, which makes the number of secret images not restricted, is proposed on the basis of the share rotation algorithm and the basis matrices of single secret sharing visual cryptography. Experimental results show that our scheme is the first (k, n)-MVCS with deterministic contrast, which can be applied on any k and n.read more
Citations
More filters
Journal ArticleDOI
Perfect contrast XOR-based visual cryptography schemes via linear algebra
TL;DR: This paper puts forward constructions of perfect contrast XVCS using the linear algebraic technique without any assumptions such as participants may carry multiple shares or prior information about the shares are to be submitted during the secret reconstruction phase.
Journal ArticleDOI
Improved schemes for visual secret sharing based on random grids
TL;DR: Two improved schemes are proposed, namely RG-based VSS for general access structure (GAS) with improved contrast and extended RG- based VSS with improved access structure, both of which can achieve better contrast than previous schemes.
Journal ArticleDOI
General construction for XOR-based visual cryptography and its extended capability
TL;DR: This paper focuses on strong access structures and proposes a general construction of VCSXOR, which provides flexible sharing strategies, perfect reconstruction of secret image, and a new region incrementing VCS based on XOR (RIVCSX OR) is presented, which exploits the proposed V CSXOR.
Journal ArticleDOI
Priority visual secret sharing of random grids for threshold access structures
Her-Chang Chao,Tzuo-Yau Fan +1 more
TL;DR: The priority-based (k, n)-threshold VSSRG scheme proposed in this study enables the assignment of different priority weights to each share to create different priority levels.
Journal ArticleDOI
Visual cryptograms of random grids via linear algebra
TL;DR: A new construction of VCRG for general access structures is put forward, based on new insight into linear algebraic technique to construct VCS, where it is able to Construct VCS by solving a linear system of more equations at a time.
References
More filters
Journal ArticleDOI
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Proceedings ArticleDOI
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys in a DES cryptos system, 3 are so important that they present a dilemma.
Visual Cryptography
Moni Naor,Adi Shamir +1 more
TL;DR: In this paper, a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is proposed, which is called k-out-of-n secret sharing.
Safeguarding cryptographic keys
TL;DR: Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosSystem,1,5 or the system master key and certain other keys in a DES cryptosystem,3 are so important that they present a dilemma.
Journal ArticleDOI
Visual Cryptography for General Access Structures
TL;DR: This paper examines graph-based access structures, i.e., access structures in which any qualified set of participants contains at least an edge of a given graph whose vertices represent the participants of the scheme, and provides a novel technique for realizing threshold visual cryptography schemes.