A Framework for Achieving KDM-CCA Secure Public-Key Encryption-猫眼课题宝

DOI：

10.1007/978-3-030-03329-3_5

发表时间：

2018-12

期刊：

影响因子：

通讯作者：

中科院分区：

其他

文献类型：

作者：

Fuyuki Kitagawa;Keisuke Tanaka

提出了一种基于射影散列函数的公钥加密方案(PKE)的实现框架，该方案满足密钥依赖的消息安全(KDM-CCA安全性)。我们的框架可以在决策Diffie-Hellman(DDH)、二次残差(QR)和决策合成残差(DCR)假设下实例化。所构造的方案是关于仿射函数的KDM-CCA安全的，并且与Applebaum(Eurocrypt 2011)所示的放大方法兼容。因此，它们导致对所有可由先验有界大小电路计算的函数都满足KDM-CCA安全性的PKE方案。它们是第一个在标准模型中满足这种安全概念的PKE方案，它既不使用非交互零知识证明，也不使用双线性对。上述基于射影哈希函数的框架在单用户设置下仅捕获KDM-CCA安全。然而，我们可以通过显式地使用它们的代数结构来证明KDM-CCA在我们的具体实例的多用户环境下的安全性。特别地，我们证明了在参数设置与单用户设置相同的情况下，我们的基于DDH的方案在多用户设置下满足KDM-CCA安全性。

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.

A Framework for Achieving KDM-CCA Secure Public-Key Encryption

文献摘要

相似文献