CryptoDB
A Framework for Achieving KDM-CCA Secure Public-Key Encryption
| Authors: | |
|---|---|
| Download: | |
| Presentation: | Slides |
| Conference: | ASIACRYPT 2018 |
| Abstract: | We propose a framework for achieving a public-key encryption (PKE) scheme that satisfies key dependent message security against chosen ciphertext attacks (KDM-CCA security) based on projective hash function. Our framework can be instantiated under the decisional diffie-hellman (DDH), quadratic residuosity (QR), and decisional composite residuosity (DCR) assumptions. The constructed schemes are KDM-CCA secure with respect to affine functions and compatible with the amplification method shown by Applebaum (EUROCRYPT 2011). Thus, they lead to PKE schemes satisfying KDM-CCA security for all functions computable by a-priori bounded size circuits. They are the first PKE schemes satisfying such a security notion in the standard model using neither non-interactive zero knowledge proof nor bilinear pairing. The above framework based on projective hash function captures only KDM-CCA security in the single user setting. However, we can prove the KDM-CCA security in the multi user setting of our concrete instantiations by using their algebraic structures explicitly. Especially, we prove that our DDH based scheme satisfies KDM-CCA security in the multi user setting with the same parameter setting as in the single user setting. |
BibTeX
@inproceedings{asiacrypt-2018-29161,
title={A Framework for Achieving KDM-CCA Secure Public-Key Encryption},
booktitle={Advances in Cryptology – ASIACRYPT 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={11273},
pages={127-157},
doi={10.1007/978-3-030-03329-3_5},
author={Fuyuki Kitagawa and Keisuke Tanaka},
year=2018
}