Skip to content
Free planNo credit card requiredStart writing

article · 2008

On Ciphertext Undetectability

Martin Stanek

Cited by 0Abstract and details only

Abstract

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 Damg˚ard ElGamal, the Cramer-Shoup scheme and its lite variant achieve ciphertext undetectability under standard assumptions.

Cite this paper

APA 7

Stanek, M. (2008). On Ciphertext Undetectability.

MLA 9

Stanek, Martin. “On Ciphertext Undetectability.” 2008.

Chicago

Stanek, Martin. 2008. “On Ciphertext Undetectability.”

Harvard

Stanek, M. (2008) ‘On Ciphertext Undetectability’.

BibTeX
@article{stanek2008ciphertext,
  title = {{On Ciphertext Undetectability}},
  author = {Stanek, Martin},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.