Efficient construction of provably secure steganography under ordinary covert channels

Yan Zhu, MengYang Y. Yu, HongXin X. Hu, Gail-Joon Ahn, HongJia J. Zhao

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1639-1649
Number of pages11
JournalScience China Information Sciences
Volume55
Issue number7
DOIs
StatePublished - Jul 2012

Fingerprint

Steganography
Sampling
Cryptography

Keywords

  • adversary models
  • cryptography
  • indistinguishability
  • sampler
  • steganography
  • unpredictability

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Efficient construction of provably secure steganography under ordinary covert channels. / Zhu, Yan; Yu, MengYang Y.; Hu, HongXin X.; Ahn, Gail-Joon; Zhao, HongJia J.

In: Science China Information Sciences, Vol. 55, No. 7, 07.2012, p. 1639-1649.

Research output: Contribution to journalArticle

Zhu, Yan ; Yu, MengYang Y. ; Hu, HongXin X. ; Ahn, Gail-Joon ; Zhao, HongJia J. / Efficient construction of provably secure steganography under ordinary covert channels. In: Science China Information Sciences. 2012 ; Vol. 55, No. 7. pp. 1639-1649.
@article{361949e0b6924b54ba72c955ae8ef879,
title = "Efficient construction of provably secure steganography under ordinary covert channels",
abstract = "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.",
keywords = "adversary models, cryptography, indistinguishability, sampler, steganography, unpredictability",
author = "Yan Zhu and Yu, {MengYang Y.} and Hu, {HongXin X.} and Gail-Joon Ahn and Zhao, {HongJia J.}",
year = "2012",
month = "7",
doi = "10.1007/s11432-012-4598-3",
language = "English (US)",
volume = "55",
pages = "1639--1649",
journal = "Science China Information Sciences",
issn = "1674-733X",
publisher = "Science in China Press",
number = "7",

}

TY - JOUR

T1 - Efficient construction of provably secure steganography under ordinary covert channels

AU - Zhu, Yan

AU - Yu, MengYang Y.

AU - Hu, HongXin X.

AU - Ahn, Gail-Joon

AU - Zhao, HongJia J.

PY - 2012/7

Y1 - 2012/7

N2 - 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.

AB - 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.

KW - adversary models

KW - cryptography

KW - indistinguishability

KW - sampler

KW - steganography

KW - unpredictability

UR - http://www.scopus.com/inward/record.url?scp=84862628182&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862628182&partnerID=8YFLogxK

U2 - 10.1007/s11432-012-4598-3

DO - 10.1007/s11432-012-4598-3

M3 - Article

VL - 55

SP - 1639

EP - 1649

JO - Science China Information Sciences

JF - Science China Information Sciences

SN - 1674-733X

IS - 7

ER -