Abstract
In this paper we first generalize the steganography system model which Christian Cachin proposed, and specialize it to be suitable for computer oriented steganography systems. Based on this model, we introduce a new perfectly secure steganography scheme, one-time hash steganography, with which one can hide a secret bit into any cover-data that satisfies certain condition (partial recomputability). Finally we prove that there exists a perfectly secure steganography system with given cover-data source if and only if the cover-data source is partially recomputable to its sender.
This is a preview of subscription content, log in via an institution to check access.
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
Abelson, H., Anderson, R., Bellovin, S., Benaloh, J., Blaze, M., Diffie, W., Gilmore, J., Neumann, P., Rivest, R., Schiller, J., Schneier, B.: The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption. World Wide Web Journal 2(3), 241–257 (1997)
Anderson, R. (ed.): IH 1996. LNCS, vol. 1174. Springer, Heidelberg (1996)
Anderson, R. (ed.): IH 1996. LNCS, vol. 1174, pp. 265–278. Springer, Heidelberg (1996)
Gruhl, D., Bender, W.: Information hiding to foil the casual counterfeiter. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, p. 1. Springer, Heidelberg (1998)
Aura, T.: Practical Invisibility in Digital Communication. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 265–278. Springer, Heidelberg (1996)
Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons. Inc., New York (1991)
Micali, S.: Fair Public-Key Cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 113–138. Springer, Heidelberg (1993)
Johnson, N.F., Jajodia, S.: Steganography: Seeing the Unseen, pp. 26–34. IEEE Computer, Los Alamitos (1998)
Kahn, D.: The History of Steganography. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 1–7. Springer, Heidelberg (1996)
Niimi, M., Noda, H., Kawaguchi, E.: An Image Embedding in Image by a Complexity Based Region Segmentation Method. In: Proc. ICIP 1997, vol. 3, pp. 74–77 (1997-2010)
Pfitzmann, B.: Information Hiding Terminology. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 347–350. Springer, Heidelberg (1996) (collected by)
Schneier, B.: Applied Cryptography, 2nd edn. John Wiley & Sons, Chichester (1996)
Simmons, G.J.: The Subliminal Channel and Digital Signatures. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 364–378. Springer, Heidelberg (1985)
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
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shin, N. (2000). One-Time Hash Steganography. In: Pfitzmann, A. (eds) Information Hiding. IH 1999. Lecture Notes in Computer Science, vol 1768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719724_2
Download citation
DOI: https://doi.org/10.1007/10719724_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67182-4
Online ISBN: 978-3-540-46514-0
eBook Packages: Springer Book Archive