On steganographic chosen covertext security

16Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed the question of whether SS-CCA security was achievable for any covertext channel. We resolve this question in the affirmative: SS-CCA security is possible for any channel that admits a secure stegosystem against the standard and weaker "chosen hiddentext attack" in the standard model of computation. Our construction requires a public-key encryption scheme with ciphertexts that remain indistinguishable from random bits under adaptive chosen-ciphertext attack. We show that a scheme with this property can be constructed under the Decisional Diffie-Hellman assumption. This encryption scheme, which modifies a scheme proposed by Kurosawa and Desmedt, also resolves an open question posed by von Ahn and Hopper at Eurocrypt 2004. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hopper, N. (2005). On steganographic chosen covertext security. In Lecture Notes in Computer Science (Vol. 3580, pp. 311–323). Springer Verlag. https://doi.org/10.1007/11523468_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free