On ciphertext undetectability

Year, pages: 2008, 133 - 151

We propose a novel security notion for public-key encryption \linebreak schemes—ciphertext undetectability. Informally, an encryption scheme has the property of ciphertext undetectability if the attacker is unable to distinguish between valid and invalid ciphertexts. We compare this notion with the established ones, such as indistinguishability of ciphertexts and plaintext awareness. We analyze the possibilities of constructing schemes with the property of ciphertext undetectability. Moreover, we prove that the Damg\aa rd ElGamal, the Cramer-Shoup scheme and its lite variant achieve ciphertext undetectability under standard assumptions.

Gaži, P., Stanek, M. 2008. On ciphertext undetectability. In Tatra Mountains Mathematical Publications, vol. 41, no.3, pp. 133-151. 1210-3195.

Gaži, P., Stanek, M. (2008). On ciphertext undetectability. Tatra Mountains Mathematical Publications, 41(3), 133-151. 1210-3195.