Paper 2015/684

A One-time Stegosystem and Applications to Efficient Covert Communication

Aggelos Kiayias, Yona Raekow, Alexander Russell, and Narasimha Shashidhar

Abstract

We present the first information-theoretic steganographic protocol with an asymptotically optimal ratio of key length to message length that operates on arbitrary covertext distributions with constant min-entropy. Our results are also applicable to the computational setting: our stegosystem can be composed over a pseudorandom generator to send longer messages in a computationally secure fashion. In this respect our scheme offers a significant improvement in terms of the number of pseudorandom bits generated by the two parties in comparison to previous results known in the computational setting. Central to our approach for improving the overhead for general distributions is the use of combinatorial constructions that have been found to be useful in other contexts for derandomization: almost $t$-wise independent function families.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
A minor revision of an IACR publication in JOC 2014
DOI
10.1007/s00145-012-9135-4
Keywords
Information hidingsteganographydata hidingsteganalysiscovert communication
Contact author(s)
karpoor @ shsu edu
History
2016-01-04: last of 2 revisions
2015-07-08: received
See all versions
Short URL
https://ia.cr/2015/684
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/684,
      author = {Aggelos Kiayias and Yona Raekow and Alexander Russell and Narasimha Shashidhar},
      title = {A One-time Stegosystem and Applications to Efficient Covert Communication},
      howpublished = {Cryptology ePrint Archive, Paper 2015/684},
      year = {2015},
      doi = {10.1007/s00145-012-9135-4},
      note = {\url{https://eprint.iacr.org/2015/684}},
      url = {https://eprint.iacr.org/2015/684}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.