Welcome to the resource topic for 2004/218
Title:
Plaintext-Simulatability
Authors: Eiichiro Fujisaki
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.
ePrint: https://eprint.iacr.org/2004/218
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .