首页> 外文会议>Euro-China Conference on Intelligent Data Analysis and Applications >Equivalence Proof of Traditional and Random Grid-Based (2, 2) Visual Secret Sharing
【24h】

Equivalence Proof of Traditional and Random Grid-Based (2, 2) Visual Secret Sharing

机译:基于传统和随机网格的等效证明(2,2)可视秘密共享

获取原文
获取外文期刊封面目录资料

摘要

Visual secret sharing (VSS) has attracted considerable attention to scientists and engineers as another branch alongside conventional cryptography to protect the sensitive visual information from several rapacious behaviors. In the literature, there are a number of several techniques used to protect the visual information, among which traditional VSS and random grid (RG)-based VSS are the primary branches. In this letter, we show, by examples, the two means are equal. In addition, the color representation of traditional VSS and RG-based VSS found it different from digital applications like images. Based on the given examples, it is demonstrated that the color representation of the two means can be the same and confirm with digital processing applications.
机译:视觉秘密共享(VSS)吸引了对科学家和工程师的相当大,作为另一个分支,以及传统的加密学,可以保护敏感的视觉信息免受几种贪婪的行为。在文献中,有许多用于保护视觉信息的技术,其中传统的VSS和随机网格(RG)是基于主要分支。在这封信中,我们通过示例显示两种方法是相等的。此外,传统的VSS和基于RG的VSS的颜色表示与图像不同的图像不同。基于给定的示例,证明两种装置的颜色表示可以是相同的并且用数字处理应用确认。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号