Provably Secure Generative Steganography Based on Autoregressive Model

被引:0
作者
Yang, Kuan [1 ]
Chen, Kejiang [1 ]
Zhang, Weiming [1 ]
Yu, Nenghai [1 ]
机构
[1] Univ Sci & Technol China, CAS Key Lab Electromagnet Space Informat, Hefei, Peoples R China
来源
DIGITAL FORENSICS AND WATERMARKING, IWDW 2018 | 2019年 / 11378卷
基金
中国国家自然科学基金;
关键词
Steganography; Provable security; Steganalysis; Generative model; PixelCNN; STEGANALYSIS;
D O I
10.1007/978-3-030-11389-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Synthetic data and generative models have been more and more popular with the rapid development of machine learning and artificial intelligence (AI). Consequently, generative steganography, a novel steganographic method finishing the operation of steganography directly in the process of image generation, tends to get more attention. However, most of the existing generative steganographic methods have more or less shortcomings, such as low security, small capacity or limited to certain images. In this paper, we propose a novel framework for generative steganography based on autoregressive model, or rather, PixelCNN. Theoretical derivation has been taken to prove the security of the framework. A simplified version is also proposed for binary embedding with lower complexity, for which the experiments show that the proposed method can resist the existing steganalytic methods.
引用
收藏
页码:55 / 68
页数:14
相关论文
共 25 条
[1]  
[Anonymous], ANIME DATASET
[2]  
[Anonymous], FREY DATASET
[3]  
Denemark T, 2014, IEEE INT WORKS INFOR, P48, DOI 10.1109/WIFS.2014.7084302
[4]   Gibbs Construction in Steganography [J].
Filler, Tomas ;
Fridrich, Jessica .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2010, 5 (04) :705-720
[5]   Rich Models for Steganalysis of Digital Images [J].
Fridrich, Jessica ;
Kodovsky, Jan .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (03) :868-882
[6]  
Goodfellow IJ, 2014, ADV NEUR IN, V27, P2672
[7]  
Hayes Jamie, 2017, P ADV NEUR INF PROC, P1954
[8]  
Holub V., 2013, ACM INFORM HIDING MU, P59
[9]  
Holub V, 2012, IEEE INT WORKS INFOR, P234, DOI 10.1109/WIFS.2012.6412655
[10]  
Hopper NJ, 2002, LECT NOTES COMPUT SC, V2442, P77