Paper 2007/388

On Ciphertext Undetectability

Peter Gazi and Martin Stanek

Abstract

We propose a novel security notion for public-key encryption 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 Damgard ElGamal, the Cramer-Shoup scheme and its lite variant achieve ciphertext undetectability under standard assumptions.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
ciphertext undetectability
Contact author(s)
gazi @ dcs fmph uniba sk
History
2007-11-19: revised
2007-10-04: received
See all versions
Short URL
https://ia.cr/2007/388
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/388,
      author = {Peter Gazi and Martin Stanek},
      title = {On Ciphertext Undetectability},
      howpublished = {Cryptology ePrint Archive, Paper 2007/388},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/388}},
      url = {https://eprint.iacr.org/2007/388}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.