Abstract
Steganographic protocols enable one to embed covert messages into inconspicuous data over a public communication channel in such a way that no one, aside from the sender and the intended receiver, can even detect the presence of the secret message. In this paper, we provide a new provably-secure, private-key steganographic encryption protocol secure in the framework of Hopper et al. [2]. We first present a ”one-time stegosystem” that allows two parties to transmit messages of length at most that of the shared key with information-theoretic security guarantees; employing a pseudorandom generator (PRG) then permits secure transmission of longer messages in a striaghtforward manner.
The advantage of our construction in comparison with previous work is key-length efficiency: in the information-theoretic setting our protocol embeds a n bit message using a shared secret key of length (1 + o(1))n while achieving security \(2^{-n/\log^{O(1)}n}\): this gives a rate of key length over message length that converges to 1 as n → ∞; the previous best result [5] achieved a constant rate > 1 regardless of the security offered. In this sense, our protocol is the first truly key-length efficient steganographic system. Furthermore, in our protocol, we can permit a portion of the shared secret key to be public while retaining precisely n private key bits. In this setting, by separating the public and the private randomness of the shared key, we achieve security of 2− n. Our result comes as an effect of a novel application of randomness extractors to stegosystem design.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cachin, C.: An Information-Theoretic Model for Steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Hopper, N.J., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77–92. Springer, Heidelberg (2002)
Hopper, N.J., von Ahn, L., Langford, J.: Provably secure steganography. IEEE Trans. Computers 58(5), 662–676 (2009)
Kiayias, A., Raekow, Y., Russell, A.: Efficient Steganography with Provable Security Guarantees. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 118–130. Springer, Heidelberg (2005)
Kiayias, A., Raekow, Y., Russell, A., Shashidhar, N.: Efficient steganography with provable security guarantees. Preprint, arXiv:0909.3658 (September 2009)
Mittelholzer, T.: An Information-theoretic Approach to Steganography and Watermarking. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 1–16. Springer, Heidelberg (2000)
Nisan, N.: Extracting randomness: How and why: A survey. In: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pp. 44–58. Citeseer (1996)
Nisan, N., Ta-Shma, A.: Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences 58(1), 148–173 (1999)
Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 58, 43–52 (1993)
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two. SIAM Journal on Discrete Mathematics 13 (2000)
Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in trevisan’s extractors. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 149–158 (1999)
Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 22–31 (2000)
Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67–95 (2002)
Shoup, V.: A computational introduction to number theory and algebra. Cambridge University Press, New York (2005) ISBN 0-5218-5154-8
Simmons, G.J.: The prisoners’ problem and the subliminal channel. In: CRYPTO, pp. 51–67 (1983)
von Ahn, L., Hopper, N.J.: Public-Key Steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 323–341. Springer, Heidelberg (2004)
Zöllner, J., Federrath, H., Klimant, H., Pfitzmann, A., Piotraschke, R., Westfeld, A., Wicke, G., Wolf, G.: Modeling the Security of Steganographic Systems. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 344–354. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiayias, A., Russell, A., Shashidhar, N. (2013). Key-Efficient Steganography. In: Kirchner, M., Ghosal, D. (eds) Information Hiding. IH 2012. Lecture Notes in Computer Science, vol 7692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36373-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-36373-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36372-6
Online ISBN: 978-3-642-36373-3
eBook Packages: Computer ScienceComputer Science (R0)