Public-key steganography with active attacks

52Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CCA) and a relaxation called steganographic security against publicly-detectable replayable adaptive chosen-covertext attacks (SS-PDR-CCA) are formalized. These notions are closely related to CCA-security and PDR-CCA-security for public-key cryptosystems. In particular, it is shown that any SS-(PDR-)CCA stegosystem is a (PDR-)CCA-secure public-key cryptosystem and that an SS-PDR-CCA stegosystem for any covertext distribution with sufficiently large min-entropy can be realized from any PDR-CCA-secure public-key cryptosystem with pseudorandom ciphertexts. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Backes, M., & Cachin, C. (2005). Public-key steganography with active attacks. In Lecture Notes in Computer Science (Vol. 3378, pp. 210–226). Springer Verlag. https://doi.org/10.1007/978-3-540-30576-7_12

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