Bin Yu, Liguo Fang, Xiaohui Xu
Abstract
To solve the problem of cheating in the reconstructing process of visual cryptography, a verifiable visual cryptography was proposed by adding a verifier to common visual cryptography scheme (VCS). This scheme can be used in any access structure and can check every share to prevent attackers from spoiling and grabbing the secret information.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To solve the problem of cheating in the reconstructing process of visual cryptography, a verifiable visual cryptography was proposed by adding a verifier to common visual cryptography scheme (VCS). This scheme can be used in any access structure and can check every share to prevent attackers from spoiling and grabbing the secret information.
Key concepts: Visual cryptography, Verifiable secret sharing, Cryptography, Scheme (mathematics), Cheating, Computer science, Computer security, Access structure