...
首页> 外文期刊>Procedia Computer Science >An Optimal (k,n)Visual Secret Sharing Scheme for Information Security
【24h】

An Optimal (k,n)Visual Secret Sharing Scheme for Information Security

机译:信息安全的最佳(k,n)视觉秘密共享方案

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Recently, based on the concept of Visual Secret Sharing (VSS) scheme proposed by Naor and Shamir in 1994, many of schemes have been proposed to protect the security of binary image. Yet, the problems of pixel expansion, extensive codebook designs, and lossy recovery are still unsolved. The current paper attempts to propose a new (k,n) scheme to refute the pixel expansion based on codebook and transpose of matrices. This scheme will offer promising solutions for the security condition, computation complexity, storage requirement, fast network transmission, and reconstructing the secret image accurately without any distortion.
机译:近来,基于Naor和Shamir在1994年提出的视觉秘密共享(VSS)方案的概念,已经提出了许多方案来保护二进制图像的安全性。但是,像素扩展,广泛的代码本设计以及有损恢复的问题仍未解决。本文试图提出一种新的(k,n)方案来驳斥基于码本和矩阵转置的像素扩展。该方案将为安全性条件,计算复杂性,存储要求,快速的网络传输以及准确地重建秘密图像而没有任何失真提供有希望的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号