.png){kind=icon}
返回
Two secret sharing schemes based on Boolean operations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2006.11.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Traditional secret sharing schemes involve complex computation. A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for grayscale images. Both use simple Boolean operations and both have no pixel expansion. The (2, n) scheme provides a better contrast and significantly smaller recognized areas than other methods. The (n, n) scheme gives an exact reconstruction. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
secret sharing scheme
visual secret sharing
visual cryptography
computation complexity
pixel expansion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Tissue distribution of tetrodotoxin and its analogs in Lagocephalus pufferfish collected in Vietnam
PREAI
分享收藏
分享收藏Non-linear argumental oscillators: Stability criterion and approximate implicit analytic solution
PREAI
分享收藏
查看更多内容