arrow
返回

An efficient XOR-based verifiable visual cryptographic scheme

delete2018-10-23
delete14
PRE
AI
X
Xingxing Jia *
D
Daoshun Wang
Q
Qimeng Chu
Z
Zhenhua Chen
DOI:10.1007/s11042-018-6779-6delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Visual cryptographic (VC) schemes have been widely used in secure multimedia systems for data transmission and data storage. It divides a secret image into n random-seemingly share images printed on the transparencies. Superimposing the designed shares will display the recovered secret image which can be recognized by human visual system. It is very convenient to decode the secret since it requires no cryptographic knowledge and computation. However, there is a high chance for dishonest shareholders to present faked shares in the secret reconstruction phase, which would result in a huge damage to the honest shareholders. In this article, a secure approach to verify the cheating shares has been proposed to achieve fair reconstruction of the image secret. It is designed to share a verification image among the original shares of the XOR based VC scheme. It only increases pixel expansion by one to achieve the verification function. Cheating detection ability is attained by pairwise superimposing the shares so that any cheating behavior can be detected by the honest participant. The secret image is recovered and its recovered contrast becomes 1times of the original contrast where m denotes the pixel expansion of the original scheme. The verification image is probabilistically recovered and its recovered contrast is 12(m+1) Compared with traditional verifiable (k,n)-VC schemes against cheating, it overcomes the drawbacks such as requiring additional shares, additional large pixel expansion, or lower contrast. The experimental results show that the visual quality of the recovered secret image is as good as expected. The security analysis and comparative results based on various aspects of VC schemes demonstrate the better efficiency of the proposed approach over existing schemes.
Keyword:
Visual cryptography
Verifiable visual cryptographic scheme
Pixel expansion
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Multimedia Tools and Applications 封面图
Multimedia Tools and Applications
IF:
3
论文数:
2.0W
被引数:
3.2W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
X
xi'an university of science & technology
学者数:
6.9K
论文数: 4.8K
被引数: 5
L
lanzhou university
学者数:
4.2W
论文数: 2.6W
被引数: 27
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Comment on Cheating Prevention in Visual Cryptography
err2012-07-01
err40
PREAI
errChen, Yu-Chi; Horng, Gwoboa; Tsai, Du-Shiau
err分享
err收藏
On-line building damage assessment based on earthquake records
err2005-05-26
err0
PREAI
errChi-Chang Lin; Chieh-Erh Wang; Huang-Wen Wu; Jer-Fu Wang
err分享
err收藏
Analysis of the Characteristics of EIA Review System in Taiwan, A Case Study of Pinnan Industrial Park
err2012-01-30
err0
errOAAI
errBinghua Li; Jing Du; Sachihiko Harashina; Shigeo Nishikizawa; Kuang-huei Huang
err分享
err收藏
A (n, n) threshold non-expansible XOR based visual cryptography with unique meaningful shares
err2018-01-01
err30
PREAI
errSingh, Priyanka; Raman, Balasubramanian; Misra, Manoj
err分享
err收藏
Two secret sharing schemes based on Boolean operations
err2007-10-01
err207
PREAI
errWang, Daoshun; Zhang, Lei; Ma, Ning; Li, Xiaobo
err分享
err收藏
A generic “micro-Stoney” method for the measurement of internal stress and elastic modulus of ultrathin films
err2016-01-20
err0
PREAI
errAudrey Favache; Sophie Ryelandt; Maxime Melchior; Gul Zeb; Pierre Carbonnelle; Jean-Pierre Raskin; Thomas Pardoen
err分享
err收藏
学者 查看更多内容