Article

Provably Secure Steganography

Authors:

Nicholas J. Hopper,

John Langford,

Luis von AhnAuthors Info & Claims

CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Pages 77 - 92

Published: 18 August 2002 Publication History

Abstract

Informally, steganography is the process of sending a secret message from Alice to Bob in such a way that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In this work, we initiate the study of steganography from a complexity-theoretic point of view. We introduce definitions based on computational indistinguishability and we prove that the existence of one-way functions implies the existence of secure steganographic protocols.

References

[1]

Ross J. Anderson and Fabien A. P. Petitcolas. On The Limits of Steganography . IEEE Journal of Selected Areas in Communications, 16(4). May 1998.

Crossref

Google Scholar

[2]

Mihir Bellare and Chanathip Namprempre. Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm . In: Advances in Cryptology - Asiacrypt '00 . December 2000.

Crossref

Google Scholar

Cited By

View all

Bauer LHowes JMarkelon SBindschaedler VShrimpton TVilela JSchulmann HLi N(2024)Leveraging Generative Models for Covert Messaging: Challenges and Tradeoffs for "Dead-Drop" DeploymentsProceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy10.1145/3626232.3653264(67-78)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3626232.3653264
Likiewicz MReischuk RWlfel U(2017)Security levels in steganography Insecurity does not imply detectabilityTheoretical Computer Science10.1016/j.tcs.2017.06.007692:C(25-45)Online publication date: 5-Sep-2017
https://dl.acm.org/doi/10.1016/j.tcs.2017.06.007
Berndt SLiśkiewicz MPérez-González FBas PIgnatenko TCayre F(2016)Provable Secure Universal Steganography of Optimal RateProceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security10.1145/2909827.2930796(81-92)Online publication date: 20-Jun-2016
https://dl.acm.org/doi/10.1145/2909827.2930796
Show More Cited By

Provably Secure Steganography

Recommendations

Provably Secure Steganography

Steganography is the problem of hiding secret messages in "innocent-looking” public communication so that the presence of the secret messages cannot be detected. This paper introduces a cryptographic formalization of steganographic security in terms of ...
Secure steganography based on embedding capacity

Mostly the embedding capacity of steganography methods is assessed in non-zero DCT coefficients. Due to unequal distribution of non-zero DCT coefficients in images with different contents, images with the same number of non-zero DCT coefficients may ...
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext, the resulting stegotext is required to have exactly the same probability ...

Comments

Information & Contributors

Information

Published In

CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

August 2002

628 pages

ISBN:354044050X

Editor:
Moti Yung

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 August 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bauer LHowes JMarkelon SBindschaedler VShrimpton TVilela JSchulmann HLi N(2024)Leveraging Generative Models for Covert Messaging: Challenges and Tradeoffs for "Dead-Drop" DeploymentsProceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy10.1145/3626232.3653264(67-78)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3626232.3653264
Likiewicz MReischuk RWlfel U(2017)Security levels in steganography Insecurity does not imply detectabilityTheoretical Computer Science10.1016/j.tcs.2017.06.007692:C(25-45)Online publication date: 5-Sep-2017
https://dl.acm.org/doi/10.1016/j.tcs.2017.06.007
Berndt SLiśkiewicz MPérez-González FBas PIgnatenko TCayre F(2016)Provable Secure Universal Steganography of Optimal RateProceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security10.1145/2909827.2930796(81-92)Online publication date: 20-Jun-2016
https://dl.acm.org/doi/10.1145/2909827.2930796
Jakobsen SOrlandi CSudan M(2016)How To Bootstrap Anonymous CommunicationProceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science10.1145/2840728.2840743(333-344)Online publication date: 14-Jan-2016
https://dl.acm.org/doi/10.1145/2840728.2840743
Russell ATang QYung MZhou H(2016)CliptographyProceedings, Part II, of the 22nd International Conference on Advances in Cryptology --- ASIACRYPT 2016 - Volume 1003210.1007/978-3-662-53890-6_2(34-64)Online publication date: 4-Dec-2016
https://dl.acm.org/doi/10.1007/978-3-662-53890-6_2
Damgård IHaagh HOrlandi C(2016)Access Control EncryptionProceedings, Part II, of the 14th International Conference on Theory of Cryptography - Volume 998610.1007/978-3-662-53644-5_21(547-576)Online publication date: 31-Oct-2016
https://dl.acm.org/doi/10.1007/978-3-662-53644-5_21
Zhang FCarlet CHu YCao T(2014)Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functionsInformation Sciences: an International Journal10.1016/j.ins.2014.06.024283(94-106)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1016/j.ins.2014.06.024
Jarecki S(2014)Practical Covert AuthenticationProceedings of the 17th International Conference on Public-Key Cryptography --- PKC 2014 - Volume 838310.1007/978-3-642-54631-0_35(611-629)Online publication date: 26-Mar-2014
https://dl.acm.org/doi/10.1007/978-3-642-54631-0_35
Fleischhacker NGünther FKiefer FManulis MPoettering BChen KXie QQiu WLi NTzeng W(2013)Pseudorandom signaturesProceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security10.1145/2484313.2484325(107-118)Online publication date: 8-May-2013
https://dl.acm.org/doi/10.1145/2484313.2484325
Ker ABas PBöhme RCogranne RCraver SFiller TFridrich JPevný TPuech WChaumont MDittmann JCampisi P(2013)Moving steganography and steganalysis from the laboratory into the real worldProceedings of the first ACM workshop on Information hiding and multimedia security10.1145/2482513.2482965(45-58)Online publication date: 17-Jun-2013
https://dl.acm.org/doi/10.1145/2482513.2482965
Show More Cited By

Abstract

References

Cited By

Recommendations