期刊文献+

一种面向门限结构的操作式可视多秘密分享方案

Operational Visual Multi-secret Sharing Scheme for Threshold Structure
下载PDF
导出
摘要 可视秘密分享将数字图像处理和秘密共享相结合,将秘密图像加密成多个共享份,在秘密恢复时将符合条件的共享份进行叠加,通过人眼直接解密秘密信息,具有解密复杂度低、信息容量大等优点。特别地,可视多秘密分享可用于分享多幅秘密图像,可应用于群体参与或控制领域。然而,目前操作式分享方案的研究受限于(2,2,n)存取结构,即n个参与者中的任意2个拿出持有的共享份进行恢复时,通过旋转和叠加操作最多能恢复2幅秘密图像。文中针对现有多秘密分享方法仅局限于两个参与者的问题,设计了一种新的秘密分享和共享份旋转操作规则,通过对秘密图像进行纵向区域划分,采用异或(XOR)运算基础矩阵对像素点逐区域进行加密,在此基础上设计了面向门限结构的操作式多秘密分享方案,并通过理论证明了方案的安全性和有效性。实验结果表明,与已有方案相比,所提方案通过在秘密分享时对秘密图像进行划分和标记纵向区域,实现了所有共享份地位对等,提高了可分享秘密的数量,最多可以同时将WT幅秘密图像分享到k个环形共享份中。该方案在满足安全条件的前提下,增强了相对差,改善了秘密图像的恢复效果。 Visual secret sharing(VSS)combines digital image processing with secret sharing.It encodes the secret image into multiple shares.Then the secret information can be decoded by human eyes directly when the qualified shares are superimposed.It has the merits such as low decoding complexity and large information capacity.In particular,visual multi-secret sharing(VMSS)can be used to share multiple secret images and applied to the field of group participation and control.However,the current research on operational sharing schemes is limited by the(2,2,n)access structure,that is,when any 2 of the n participants take out their shares for recovery,2 secret images at most can be recovered through rotation and superposition operations.Aiming at the problem that existing multi-secret sharing schemes are limited to 2 participants,a new secret sharing and sharing rotation operation rule is designed in this paper.By partitioning the secret image longitudinally and encrypting the pixels region by region with XOR basic matrix,an operational visual multi-secret sharing scheme(OVMSS)oriented to threshold structure is designed.Moreover,the security and validity of the scheme are proved theoretically.The experimental results show that,compared with the existing schemes,the proposed scheme achieves the equality of all shares by dividing secret images and marking the vertical regions in secret sharing,and improves the number of secrets that can be shared.WT secret images can be shared into k ring shares simultaneously at most.On the premise of meeting the safety conditions,the proposed scheme enhances the relative difference and improves the recovery quality of secret image.
作者 董晨 季姝廷 张皓宇 李磊 DONG Chen;JI Shu-ting;ZHANG Hao-yu;LI Lei(School of Computer Science and Engineering,Tianjin University of Technology,Tianjin Key Laboratory of Intelligence Computer and Novel Software Technology,Tianjin 300384,China;Key Laboratory of Intelligence Computer and Novel Software Technology,Tianjing 300384,China;Big Data Management Center of Tianjin,Tianjin 300221,China)
出处 《计算机科学》 CSCD 北大核心 2020年第10期322-326,共5页 Computer Science
基金 国家级大学生创新创业训练计划项目(201810060008)。
关键词 可视秘密分享 多秘密 操作式方案 门限结构 异或 Visual secret sharing Multiple secrets Operational scheme Threshold structure XOR
  • 相关文献

参考文献4

二级参考文献38

  • 1XIE Qi 1,2, YU Xiu-yuan 3 1.Department of Mathematics, Zhejiang University, Hangzhou 310027, Zhejiang,China,2.School of Information and Engineering, Hangzhou Teachers College, Hangzhou 310012, Zhejiang, China,3.Hangzhou Teachers College, Hangzhou 310012, Zhejiang, China.A New (t, n) Threshold Signature Scheme Withstanding the Conspiracy Attack[J].Wuhan University Journal of Natural Sciences,2005,10(1):107-110. 被引量:13
  • 2PANGLiao-jun WANGYu-min.A Secure and Efficient (t, n) Multi-Secret Sharing Scheme[J].Wuhan University Journal of Natural Sciences,2005,10(1):191-194. 被引量:1
  • 3黄东平,刘铎,王道顺,戴一奇.一种安全的门限多秘密共享方案[J].电子学报,2006,34(11):1937-1940. 被引量:6
  • 4张文芳,何大可,王宏霞,王小敏.具有可追查性的抗合谋攻击(t,n)门限签名方案[J].西南交通大学学报,2007,42(4):461-467. 被引量:16
  • 5李慧贤,蔡皖东,庞辽军.一个安全的动态门限签名体制[J].计算机研究与发展,2007,44(9):1545-1549. 被引量:6
  • 6ARPITA M. A Resilient Quantum Secret Sharing Scheme[J].International Journal of Theoretical Physics, 2015, 54 (2) : 398-408.
  • 7TAVAKOLI A, HERBAUTS I, ZUKOWSKI M, et al.Secret Sharingwith a Single d-level Quantum System[EB/OL].http: //joumals.aps.org/pra/abstract/10.1103/PhysRevA.92.030302, 2015-09-21.
  • 8ZHANG Xiaoqian, TAN xiaoqing, LIANG Cui.High EfficientMulti-party Quantum Secret Sharing Scheme[C] //IEEE.InternationalConference on P2P, Parallel, Grid, Cloud and Internet Computing,November 8-10,2014. Guangdong,China.NJ:IEEE, 2014:245-250.
  • 9SHAMIR A. How to Share a Secret[J]. Communications of the ACM,1979,24(11): 612-613.
  • 10BRICKELL E F. Some Ideal Secret Sharing Schemes[J]. Journal ofCombinatorial Mathematics and Combinatorial Computing, 1989(9):105-113.

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部