Progressive Secret Image Sharing Scheme Based on Semantic Segmentation

被引:1
作者
Zhang, Lina [1 ,2 ]
Zheng, Xiangqin [1 ]
Liu, Ying [3 ]
机构
[1] Xian Univ Sci & Technol, Coll Comp Sci & Technol, Xian 710054, Peoples R China
[2] Shaanxi Normal Univ, Sch Comp Sci, Xian 710119, Peoples R China
[3] Natl Key Lab Complex Syst Simulat, Beijing 100020, Peoples R China
来源
IEEE ACCESS | 2020年 / 8卷
基金
中国国家自然科学基金;
关键词
Cryptography; Semantics; Image restoration; Image segmentation; Image reconstruction; Interpolation; PSIS; semantic segmentation; interpolated polynomial; VISUAL CRYPTOGRAPHY; ENCRYPTION; CONSTRUCTION;
D O I
10.1109/ACCESS.2020.3025836
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Secret Image Sharing (SIS) plays an important role in the field of information security. At present, from the perspective of image restoration, SIS schemes are roughly divided into two categories: traditional threshold SIS schemes and Progressive SIS (PSIS) schemes. The former provides an all-or-nothing recovery mode in image reconstruction phase. If one of these shadows is damaged or lost, the reconstruction will fail. In contrast, the latter can present the original image progressively during the reconstruction phase. In this paper, a PSIS scheme based on semantic segmentation is proposed, where only specific objects or sensitive areas in the image are shared. After simple processing, the remaining background images can be publicly transmitted on insecure channels of the network. The background image will be regarded as a normal picture by people without shares. Owners who have reached the share of trapdoor numbers can recover a key target in an image. As the share increases, more key targets can be recovered. This paper is the first to propose secure secret sharing of images based on semantic targets. Through this method, it is possible to perform permission control on the target that needs to be divided and shared. Since the shared object is not the entire image, it can save storage space to a certain extent. Finally, through the analysis of the experimental results and comparison with other works, it can be concluded that the proposed scheme has a higher level of security and the amount of data that needs to be transmitted is small.
引用
收藏
页码:173289 / 173297
页数:9
相关论文
共 35 条
[1]   Quality optimized medical image information hiding algorithm that employs edge detection and data coding [J].
Al-Dmour, Hayat ;
Al-Ani, Ahmed .
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 2016, 127 :24-43
[2]  
Al-Haj A, 2017, 2017 3RD INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT (ICIM 2017), P437, DOI 10.1109/INFOMAN.2017.7950423
[3]   An Application of Virtual Reality with Android Device for Tourism Assistant [J].
Bastian, Ade ;
Prasetyo, Tri Ferga ;
Atmaja, Nanda Juanda Dipura .
2019 2ND INTERNATIONAL CONFERENCE OF COMPUTER AND INFORMATICS ENGINEERING (IC2IE 2019): ARTIFICIAL INTELLIGENCE ROLES IN INDUSTRIAL REVOLUTION 4.0, 2019, :1-5
[4]  
Brindha K, 2017, CYBERN INF TECHNOL, V17, P128, DOI 10.1515/cait-2017-0034
[5]   Random-grid based progressive visual secret sharing scheme with adaptive priority [J].
Chao, Her-Chang ;
Fan, Tzuo-Yau .
DIGITAL SIGNAL PROCESSING, 2017, 68 :69-80
[6]   Efficient multi-secret image sharing based on Boolean operations [J].
Chen, Tzung-Her ;
Wu, Chang-Sian .
SIGNAL PROCESSING, 2011, 91 (01) :90-97
[7]   Image encryption using a synchronous permutation-diffusion technique [J].
Enayatifar, Rasul ;
Abdullah, Abdul Hanan ;
Isnin, Ismail Fauzi ;
Altameem, Ayman ;
Lee, Malrey .
OPTICS AND LASERS IN ENGINEERING, 2017, 90 :146-154
[8]   A novel fast and provably secure (t,n)-threshold secret sharing construction for digital images [J].
Faraoun, Kamel Mohamed .
JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2014, 19 (06) :331-340
[9]   Polynomial Based Progressive Secret Image Sharing Scheme With Smaller Shadow Size [J].
Guo, Yongzhen ;
Ma, Zhuo ;
Zhao, Meng .
IEEE ACCESS, 2019, 7 :73782-73789
[10]   Progressive Visual Cryptography with Unexpanded Shares [J].
Hou, Young-Chang ;
Quan, Zen-Yu .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2011, 21 (11) :1760-1764