Paper 2004/218 Original: eprint.iacr.org/2004/218 ↗
Plaintext-Simulatability
Abstract
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to the notion of plaintext awareness (denoted PA), but it is, ``properly'', a weaker security class for public-key encryption. In most cases, PA is ``unnecessarily'' strong, --- only used to prove that a public-key encryption scheme is CCA2-secure, because it looks much easier than to prove ``directly'' that the scheme meets IND-CCA2. We show that PS also implies IND-CCA2, while preserving a good view of the security proofs as well as PA. PS looks ``properly'' stronger than IND-CCA2. So far, however, it is not sure how to prove this, which remains open.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2004-09-08: last updated
- 2004-09-01: published
- Short URL
- https://ia.cr/2004/218
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/218,
author = {Eiichiro Fujisaki},
title = {Plaintext-Simulatability},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/218},
year = {2004},
url = {https://eprint.iacr.org/2004/218}
}