<abstract xmlns="http://www.w3.org/1999/xhtml"><p> The notion of ciphertext undetectability was introduced in [Gaˇzi, P. - Stanek, M.: On ciphertext undetectability, Tatra Mt. Math. Publ. <bold>41</bold> (2008), 133-151] as a steganographic property of an encryption scheme. While finding the relationship between ciphertext undetectability and indistinguishability of encryptions, authors showed that ciphertext undetectability does not imply indistinguishability. Though the proposition is correct, the proof is not. In this note, we provide a correct proof of the above-mentioned result by a slight modification of the construction used in original paper cited above.</p></abstract>

The notion of ciphertext undetectability was introduced in [Gaˇzi, P. - Stanek, M.: On ciphertext undetectability, Tatra Mt. Math. Publ. 41 (2008), 133-151] as a steganographic property of an encryption scheme. While finding the relationship between ciphertext undetectability and indistinguishability of encryptions, authors showed that ciphertext undetectability does not imply indistinguishability. Though the proposition is correct, the proof is not. In this note, we provide a correct proof of the above-mentioned result by a slight modification of the construction used in original paper cited above.

A NOTE ON “ON CIPHERTEXT UNDETECTABILITY”

Department of Mathematics St. Xavier’s College Kolkata INDIA

Department of Pure Mathematics University of Calcutta Kolkata INDIA

Tatra Mountains Mathematical Publications

{"article-title":"A NOTE ON \u201cON CIPHERTEXT UNDETECTABILITY\u201d"}

The notion of ciphertext undetectability was introduced in [Gaˇzi, P. - Stanek, M.: On ciphertext undetectability, Tatra Mt. Math. Publ. 41 (2008), 133-151] as...

A NOTE ON “ON CIPHERTEXT UNDETECTABILITY”

Published Online: Feb 18, 2014

Page range: 119 - 121

DOI: https://doi.org/10.2478/tmmp-2013-0039

This content is open access.