Paper 2016/235
Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security
Takahiro Matsuda and Goichiro Hanaoka
Abstract
In PKC 2014, Dachman-Soled showed a construction of a chosen ciphertext (CCA) secure public key encryption (PKE) scheme based on a PKE scheme which simultaneously satisfies a security property called weak simulatability and (standard model) plaintext awareness (sPA1) in the presence of multiple public keys. It is not well-known if plaintext awareness for the multiple keys setting is equivalent to the more familiar notion of that in the single key setting, and it is typically considered that plaintext awareness is a strong security assumption (because to achieve it we have to rely on a "knowledge"-type assumption). In Dachman-Soled's construction, the underlying PKE scheme needs to be plaintext aware in the presence of
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in PKC 2016
- Keywords
- public key encryptionkey encapsulation mechanismchosen ciphertext securityplaintext-awarenesstrapdoor simulatability
- Contact author(s)
- t-matsuda @ aist go jp
- History
- 2016-03-03: received
- Short URL
- https://ia.cr/2016/235
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/235, author = {Takahiro Matsuda and Goichiro Hanaoka}, title = {Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/235}, year = {2016}, url = {https://eprint.iacr.org/2016/235} }