Computer Science ›› 2020, Vol. 47 ›› Issue (10): 322-326.doi: 10.11896/jsjkx.190800069

• Information Security • Previous Articles     Next Articles

Operational Visual Multi-secret Sharing Scheme for Threshold Structure

DONG Chen1,2, JI Shu-ting3, ZHANG Hao-yu3, LI Lei3   

  1. 1 School of Computer Science and Engineering,Tianjin University of Technology,Tianjin Key Laboratory of Intelligence Computer and Novel Software Technology,Tianjin 300384,China
    2 Key Laboratory of Intelligence Computer and Novel Software Technology,Tianjing 300384,China
    3 Big Data Management Center of Tianjin,Tianjin 300221,China
  • Received:2019-08-15 Revised:2019-11-12 Online:2020-10-15 Published:2020-10-16
  • About author:DONG Chen,born in 1976,master,is a member of China Computer Federation.Her main research interests include di-gital image processing,data mining and visual secret sharing.
  • Supported by:
    National Innovation and Entrepreneurship Training Program for College Students (201810060008)

Abstract: 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.

Key words: Multiple secrets, Operational scheme, Threshold structure, Visual secret sharing, XOR

CLC Number: 

  • TP309.7
[1] SHAO L P,LE Z F.Multiple Thresholds Progressive Secret Image Sharing Scheme Based on DCT[J].Netinfo Security,2018,18(3):54-62.
[2] XIONG J B MA R,ZHANG Y Y,et al.Image Information Hiding Method and Implementation for Social Network[J].Netinfo Security,2017,17(3):6-8.
[3] ZHANG Y S,WANG X M,QIU G G.Research on a New Dynamic Threshold Digital Signature Scheme[J]. Netinfo Security,2016,16(6):62-67.
[4] LI Z H,XU T T,ZHANG N.The Construction of a Type of Ideal Access Structures[J].Netinfo Security,2016,16(5):15-22.
[5] NAOR M,SHAMIR A.Visual cryptography[C]//Advances in Cryptology-Eurocrypt’94.Lecture Notes in Computer Science,1995,950:1-12.
[6] HU H,SHEN G,YU B,et al.XOR-based region incrementingvisual cryptography scheme by random grids[J].Chinese Journal of Computer Research and Development,2016,53(8):1857-1866.
[7] KABIRIRAD S,ESLAMI Z.Improvement of (n,n)-multi-secret image sharing schemes based on Boolean operations[J].Journal of Information Security and Applications,2019,47:16-27.
[8] YAN X,XIN L,YANG C.An enhanced threshold visual secret sharing based on random grids[J].Journal of Real-Time Image Processing,2018,14(1):61-73.
[9] MEGHRAJANI Y,DESAI L,MAZUMDAR H.Secure and efficient arithmetic-based multi-secret image sharing scheme using universal share[J].Journal of Information Security and Applications,2019,47:267-274.
[10]JOY C,HUANG B,JUAN J.A new visual multi-secrets sharing scheme by random grids[J].Cryptography,2018,2(3):24.
[11]WU Z.Two new visual cryptography schemes:visual multi-secrets sharing scheme and colored visual secret sharing scheme[D].Taiwan:National Dong Hwa University,2001.
[12]CHEN L.A study on visual cryptography[D].Taiwan:National Chiao Tung University,Master Thesis,1998.
[13]HSU H,CHEN T,LIN Y.The ring shadow image technology of visual cryptography by applying diverse rotating angles to hide the secret sharing[C]//Proceedings of the 2004 IEEE International Conference on Networking,Sensing & Control.2004:996-1001.
[14]FU Z X,YU B.Ideal secure multi-secret visual cryptographyscheme with ring shares[M].Transactions on Data Hiding and Multimedia Security IX.Springer,Berlin,Heidelberg,2014:42-56.
[15]DROSTE S.New results on visual cryptography[C]//Advances in Cryptography-CRYPTO’96.1996,LNCS 1109:401-415.
[16]FU Z X,YU B.Research on rotation visual cryptographyscheme[C]//Proceedings of the International Symposium on Information Engineering and Electronic Commerce.IEEE,2016:533-536.
[17]FENG J,WU B H,TSAIC C,et al.Visual secret sharing formultiple secrets[J].Pattern Recognition,2010(41):3572-3581.
[18]SHEN G.Analysis and design of visual cryptography scheme[D].Strategic Support Force Information Engineering University,2017.
[1] ZHU Shu-qin, LI Jun-qing and GE Guang-ying. New Image Encryption Algorithm Based on New Four-dimensional Discrete-time Chaotic Map [J]. Computer Science, 2017, 44(1): 188-193.
[2] XU Zhong-Li, XIE Dan-Ming ,LI Bing-Feng ,GAO Chuan-Shan (Computer Science and Engineering Department,Fudan Univ, Shanghai 200433). [J]. Computer Science, 2007, 34(4): 273-275.
[3] GUO Fang-Fang ,YANG Yong-Tian (School of Computer Science and Technology, Harbin Engineering University, Harbin 150001). [J]. Computer Science, 2006, 33(11): 34-37.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!