QQ客服 官方微博 反馈留言

	Efficient construction of provably secure steganography under ordinary covert channels
	Zhu Yan ; Yu MengYang ; Hu HongXin ; Ahn, Gail-Joon ; Zhao HongJia
	2012
关键词	steganography cryptography indistinguishability sampler unpredictability adversary models
英文摘要	Steganography is the science of hiding information within seemingly harmless messages or innocent media. This paper addresses the problems of efficient construction of secure steganography in ordinary covert channels. Without relying on any sampling assumption, we provide a general construction of secure steganography under computational indistinguishability. Our results show that unpredictability of mapping function in covertext sampler is indispensable for secure stegosystem on indistinguishability against adaptive chosen hiddentext attacks. We completely prove that computationally secure steganography can be constructed on pseudorandom function and unbiased sampling function under ordinary covert channels, that is, its security is inversely proportional to the sum of errors of these two functions, as well as the legth of hiddentexts. More importantly, our research is not dependent upon pseudorandom ciphertext assumption of cryptosystem or perfect sampling assumption. Hence, our results are practically useful for construction and analysis of secure stegosystems.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000305330600015&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Information Systems; SCI(E); 2; ARTICLE; 7; 1639-1649; 55
语种	英语
出处	SCI
出版者	science china information sciences
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/161833]
专题	数学科学学院 信息科学技术学院
推荐引用方式 GB/T 7714	Zhu Yan,Yu MengYang,Hu HongXin,et al. Efficient construction of provably secure steganography under ordinary covert channels. 2012-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。