Provably secure steganography: (Extended abstract)

Nicholas J. Hopper; John Langford; Luis Von Ahn

doi:10.1007/3-540-45708-9_6

Provably secure steganography: (Extended abstract)

Nicholas J. Hopper
, John Langford
, Luis Von Ahn

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

136 Scopus citations

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.

Original language	English (US)
Title of host publication	Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings
Editors	Moti Yung
Publisher	Springer Verlag
Pages	77-92
Number of pages	16
ISBN (Electronic)	354044050X, 9783540440505
DOIs	https://doi.org/10.1007/3-540-45708-9_6
State	Published - 2002
Event	22nd Annual International Cryptology Conference, CRYPTO 2002 - Santa Barbara, United States Duration: Aug 18 2002 → Aug 22 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2442
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	22nd Annual International Cryptology Conference, CRYPTO 2002
Country/Territory	United States
City	Santa Barbara
Period	8/18/02 → 8/22/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Publisher link

10.1007/3-540-45708-9_6

Find It

Find It at U of M Libraries

Cite this

Hopper, N. J., Langford, J., & Von Ahn, L. (2002). Provably secure steganography: (Extended abstract). In M. Yung (Ed.), Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings (pp. 77-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2442). Springer Verlag. https://doi.org/10.1007/3-540-45708-9_6

Provably secure steganography: (Extended abstract). / Hopper, Nicholas J.; Langford, John; Von Ahn, Luis.
Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. ed. / Moti Yung. Springer Verlag, 2002. p. 77-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2442).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hopper, NJ, Langford, J & Von Ahn, L 2002, Provably secure steganography: (Extended abstract). in M Yung (ed.), Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2442, Springer Verlag, pp. 77-92, 22nd Annual International Cryptology Conference, CRYPTO 2002, Santa Barbara, United States, 8/18/02. https://doi.org/10.1007/3-540-45708-9_6

Hopper NJ, Langford J, Von Ahn L. Provably secure steganography: (Extended abstract). In Yung M, editor, Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. Springer Verlag. 2002. p. 77-92. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45708-9_6

Hopper, Nicholas J. ; Langford, John ; Von Ahn, Luis. / Provably secure steganography : (Extended abstract). Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings. editor / Moti Yung. Springer Verlag, 2002. pp. 77-92 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{60456f7873344f05917fb5d36dfb97a5,

title = "Provably secure steganography: (Extended abstract)",

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.",

author = "Hopper, \{Nicholas J.\} and John Langford and \{Von Ahn\}, Luis",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 22nd Annual International Cryptology Conference, CRYPTO 2002 ; Conference date: 18-08-2002 Through 22-08-2002",

year = "2002",

doi = "10.1007/3-540-45708-9\_6",

language = "English (US)",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "77--92",

editor = "Moti Yung",

booktitle = "Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings",

}

TY - GEN

T1 - Provably secure steganography

T2 - 22nd Annual International Cryptology Conference, CRYPTO 2002

AU - Hopper, Nicholas J.

AU - Langford, John

AU - Von Ahn, Luis

PY - 2002

Y1 - 2002

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

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

UR - https://www.scopus.com/pages/publications/84937438364

UR - https://www.scopus.com/pages/publications/84937438364#tab=citedBy

U2 - 10.1007/3-540-45708-9_6

DO - 10.1007/3-540-45708-9_6

M3 - Conference contribution

AN - SCOPUS:84937438364

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 77

EP - 92

BT - Advances in Cryptology - CRYPTO 2002 - 22nd Annual International Cryptology Conference, Proceedings

A2 - Yung, Moti

PB - Springer Verlag

Y2 - 18 August 2002 through 22 August 2002

ER -

Provably secure steganography: (Extended abstract)

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this