首页> 外文会议>International Symposium on Information Theory and its Applications >Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security
【24h】

Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security

机译:具有有意义股份的视觉密码方案的最佳基矩阵及其安全性分析

获取原文

摘要

The extended visual cryptography scheme (EVCS) proposed by Ateniese et al. is one variation of the visual cryptography scheme such that a secret image is recovered from certain qualified collections of meaningful shares that are distributed to respective participants. In this paper, we give a new definition of the EVCS for improving visibility of the recovered secret image as well as the shares. We construct optimal basis matrices with the minimum number of pixel expansion by solving a certain integer programming problem. We also analyze security of the EVCS meeting the new definition from information-theoretic viewpoint.
机译:Ateniese等人提出的扩展视觉加密方案(EVC)。是视觉加密方案的一种变型,使得从分发给各个参与者的某些合格的有意义股票的特定合格集合中恢复秘密图像。在本文中,我们给出了EVC的新定义,以改善恢复的秘密形象的可见性以及股份。通过解决某个整数编程问题,我们通过求解最小像素扩展来构造最佳基矩阵。我们还分析了EVC的安全性,从信息理论观点符合新的定义。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号