电子学报 ›› 2019, Vol. 47 ›› Issue (2): 390-403.DOI: 10.3969/j.issn.0372-2112.2019.02.019

• 学术论文 • 上一篇    下一篇

多版本备份和限制性双重认证主密钥(t,s,k,n)图像分存

邵利平, 乐志芳   

  1. 陕西师范大学计算机科学学院, 陕西西安 710119
  • 收稿日期:2017-10-26 修回日期:2018-09-05 出版日期:2019-02-25 发布日期:2019-02-25
  • 通讯作者: 邵利平
  • 作者简介:乐志芳 女,1993年生于江西抚州,硕士,研究方向为数字图像分存.
  • 基金资助:
    国家自然科学基金(No.61100239);陕西省自然科学基金(No.2011JQ8009,No.2016JM6065);中央高校基本科研业务费支持项目(No.GK201402036,No.GK201703057)

(t,s,k,n)Image Sharing Sheme with Multi-Version Backups and Restricted Double Authentications

SHAO Li-ping, LE Zhi-fang   

  1. School of Computer Science, Shaanxi Normal University, Xi'an, Shaanxi 710119, China
  • Received:2017-10-26 Revised:2018-09-05 Online:2019-02-25 Published:2019-02-25

摘要: 传统影子图像连接的(t,s,k,n)分存易导致分发影子图像大小不等,基于伯克霍夫插值的(t,s,k,n)分存不能高效恢复;而双认证自修复图像分存对密图和备份图恢复能力十分有限.针对以上问题,采用随机参与值通过(k,s)和(k-t,n-s)分存来构造主密钥(t,s,k,n)分存并通过第3方公信方存储的MD5值以防止作弊.所提策略由主密钥对密图LL子带置乱来形成对显著比特多备份、对非显著比特少备份和经主密钥不同程度置乱的多版本备份图;引入限制性双重认证在保持认证精度的同时,将尽可能多的备份比特通过GF(2^8)域(k,n)分存嵌入来形成嵌密掩体.理论和实验表明,主密钥(t,s,k,n)分存可高效求解;随机参与值可避免参与者编号泄露,分发信息的篡改和认证比特的揣测;多版本备份可对备份图高置信度地恢复;而限制性双重认证在认证能力上不低于双认证自修复图像分存.

关键词: 图像分存, 限制性双重认证, 有限域, 多版本备份, (t, s, k, n)分存, (k, n)分存, p逆矩阵

Abstract: Conventional shadow image connection based(t,s,k,n) sharing is prone to different size shadow images and Birkhoff interpolation based(t,s,k,n) sharing leads to low recovery efficiency,while in double authentications based self-recovery image sharing,the recovery capabilities of secret image and backup image are very limited.To address these problems,random participation values were used to construct master key based(t,s,k,n) sharing by means of(k,s) and(k-t,n-s) schemes and MD5 values stored in the third party were used to prevent cheating.The proposed scheme scrambled LL subband of secret image by master key and formed multi-version backup images with different scrambling degrees where more backups for more significant bits.Restricted double authentication strategy can embed as many backup bits as possible while maintaining authentication accuracy by(k,n) sharing over GF(2^8) field to form stego carriers.Theoretical and experimental results show,master key based(t,s,k,n) scheme can be solved efficiently.Random participation values avoid the disclosure of participant numbers and prevent tampering distributed information or guessing authentication bits.Multi-version backup strategy can restore backup images with high confidence while authentication capability of restricted double authentication strategy is no less than that of double authentications based self-recovery image sharing scheme.

Key words: image sharing, restricted double authentications, Galois field, multi-version backups, (t,s,k,n) sharing, (k,n) sharing, inverse matrix modulus p

中图分类号: