International Association
for Cryptologic Research

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.

• Content Type Journal Article
• Pages 1-22
• DOI 10.1007/s00145-012-9135-4
• Authors

  • Aggelos Kiayias, Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
  • Yona Raekow, Fraunhofer Institute for Algorithms and Scientific Computing, St. Augustin, Germany
  • Alexander Russell, Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA
  • Narasimha Shashidhar, Department of Computer Science, Sam Houston State University, Huntsville, TX, USA

• Journal Journal of Cryptology
• Online ISSN 1432-1378
• Print ISSN 0933-2790

From: Wed, 24 Oct 2012 17:55:35 GMT