Name
Abstract | ||
|---|---|---|
Informally, steganography is the process of sending a secret message from Alice to Bob in such a way that an eaves- dropper (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 denitions based on com- putational indistinguishability and we prove that the existence of one-way functions implies the existence of secure steganographic protocols. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45708-9_6 | International Crytology Conference |
Keywords | Field | DocType |
one-way function,secure steganographic protocol,computational indistinguishability,provably secure steganography,complexity-theoretic point,secret message,bandwidth,covert channel,robustness,sampling methods,indexation,mutual information,provable security,covert channels,security,construction industry,history,probability,cryptographic protocols,cryptography,one way function,probability distribution,distributed computing,rejection sampling,protocols,steganography,encryption | Pseudorandom function family,Steganography,Computational indistinguishability,Cryptographic protocol,Computer science,Cryptography,Covert channel,Theoretical computer science,Encryption,Provable security | Conference |
Volume | ISBN | Citations |
2002 | 3-540-44050-X | 65 |
PageRank | References | Authors |
8.84 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicholas Hopper | 1 | 1469 | 95.76 |
| John Langford | 2 | 5392 | 353.60 |
| Luis von Ahn | 3 | 3461 | 346.66 |