多版本备份和限制性双重认证主密钥(t,s,k,n)图像分存
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:(t,s,k,n) Image Sharing Sheme with Multi-Version Backups and Restricted Double Authentications
  • 作者:邵利平 ; 乐志芳
  • 英文作者:SHAO Li-ping;LE Zhi-fang;School of Computer Science,Shaanxi Normal University;
  • 关键词:图像分存 ; 限制性双重认证 ; 有限域 ; 多版本备份 ; (t ; s ; k ; n)分存 ; (k ; n)分存 ; 模p逆矩阵
  • 英文关键词:image sharing;;restricted double authentications;;Galois field;;multi-version backups;;(t,s,k,n) sharing;;(k,n) sharing;;inverse matrix modulus p
  • 中文刊名:DZXU
  • 英文刊名:Acta Electronica Sinica
  • 机构:陕西师范大学计算机科学学院;
  • 出版日期:2019-02-15
  • 出版单位:电子学报
  • 年:2019
  • 期:v.47;No.432
  • 基金:国家自然科学基金(No.61100239);; 陕西省自然科学基金(No.2011JQ8009,No.2016JM6065);; 中央高校基本科研业务费支持项目(No.GK201402036,No.GK201703057)
  • 语种:中文;
  • 页:DZXU201902019
  • 页数:14
  • CN:02
  • ISSN:11-2087/TN
  • 分类号:136-149
摘要
传统影子图像连接的(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)分存可高效求解;随机参与值可避免参与者编号泄露,分发信息的篡改和认证比特的揣测;多版本备份可对备份图高置信度地恢复;而限制性双重认证在认证能力上不低于双认证自修复图像分存.
        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.
引文
[1]Shamir A. How to share a secret[J]. Communications ofthe Association for Computing M achinery,1979,22(11):612-613.
    [2] Blakley G R. Safeguarding cryptographic keys[A]. Pro-ceedings of 1979 National Computer Conference[C]. NewYork,USA:AFIPS,1979. 48:313-317.
    [3]Thien C C,Lin J C. Secret image sharing[J]. Computers&Graphics,2002,26(5):765-770.
    [4] Kanso A,Ghebleh M. An efficient(t,n)-threshold secretimage sharing scheme[J]. M ultimedia Tools&Applica-tions,2016,76(15):1-20.
    [5]Lin C C,Tsai W H. Secret image sharing with steganogra-phy and authentication[J]. Journal of Systems and Soft-w are,2004,73(3):405-414.
    [6]Yang C N,Chen T S,Yu K H,et al. Improvements of imagesharing with steganography and authentication[J]. Journalof Systems and Software,2007,80(7):1070-1076.
    [7]Chang C C,Hsieh Y P,Lin C H. Sharing secrets in stegoimages w ith authentication[J]. Pattern Recognition,2008,41(10):3130-3137.
    [8] Ulutas M,Ulutas G,Nabiyev V V. Secret image sharingw ith enhanced visual quality and authentication mechanism[J]. The Imaging Science Journal,2011,59(3):154-165.
    [9]欧阳显斌,邵利平,陈文鑫.结合调整差值变换的(K,N)有意义图像分存方案[J].中国图象图形学报,2015,20(5):633-642.Ouyang Xianbin,Shao Liping,Chen Wenxin. M eaningful(K,N)image sharing scheme combined with the adjustingdifference transformation[J]. Journal of Image and Graph-ics,2015,20(5):633-642.(In Chinese)
    [10]欧阳显斌,邵利平.一种基于GF(23)的(K,N)有意义无扩张图像分存方案[J].计算机科学,2015,42(12):251-256.Ouyang Xianbin,Shao Liping. M eaningful(K,N)free ex-pansion image sharing scheme based on GF(23)[J].Computer Science,2015,42(12):251-256.(in Chi-nese)
    [11]Chang C C,Chen Y H,Wang H C. Meaningful secret sha-ring technique w ith authentication and remedy abilities[J]. Information Sciences,2011,181(14):3073-3084.
    [12]Chen Y H,Chang C C. Image tamper detection and recov-ery based on dual w atermarks sharing strategy[J]. Journalof Digital Information M anagement,2012,10(1):39-49.
    [13] Wu X T,Sun W. Secret image sharing scheme with au-thentication and remedy abilities based on cellular autom-ata and discrete w avelet transform[J]. Journal of Systemsand Softw are,2013,86(4):1068-1088.
    [14]欧阳显斌,邵利平,乐志芳.非等量备份和双认证自修复有限域图像分存[J].软件学报,2017,28(12):3306-3346.Ouyang Xianbin,Shao Liping,Le Zhifang. Gloise fieldself-recovery image sharing scheme w ith non-equivalentbackup and double authentications[J]. Journal of Soft-w are,2017,28(12):3306-3346.(in Chinese)
    [15]Chan C K,Cheng L M. Hiding data in images by simpleLSB substitution[J]. Pattern Recognition,2004,37(3):469-474.
    [16]Li P,Yang C N,Wu C C,et al. Essential secret imagesharing scheme w ith different importance of shadow s[J].Journal of Visual Communication&Image Representa-tion,2013,24(7):1106-1114.
    [17]Yang C N,Li P,Wu C C,et al. Reducing shadow size inessential secret image sharing by conjunctive hierarchicalapproach[J]. Signal Processing Image Communication,2015,31:1-9.
    [18]Li P,Yang C N,Zhou Z. Essential secret image sharingscheme w ith the same size of shadow s[J]. Digital SignalProcessing,2016,50:51-60.
    [19]邵利平,覃征,衡星辰,等.基于矩阵变换的图像置乱逆问题求解[J].电子学报,2008,36(7):1355-1363.Shao Liping,Qin Zheng,Heng xingchen,et al. Solutionfor the inverse problem of matrix transform based imagescrambling[J]. Acta Electronica Sinica,2008,36(7):1355-1363.(in Chinese)
    [20]邵利平.数字图像置乱技术[M].北京:科学出版社,2016. 56-94.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700