On the Integration of Public Key Data Encryption and Public Key Encryption with Keyword Search
On the Integration of Public Key Data Encryption and Public Key Encryption with Keyword Search
复制标题
DOI：
10.1007/11836810_16
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
J. Baek;R. Safavi-Naini;W. Susilo
中科院分区：
文献类型：
--
作者：
J. Baek;R. Safavi-Naini;W. Susilo
在本文中，我们考虑了将公钥加密（PKE）方案和由 Boneh、Di Crescenzo、Ostrovsky 和 Persiano（BDOP）在 Eurocrypt 2004 中提出的公钥加密与关键字搜索（PEKS）方案相结合的问题。我们认为这两种方案需要被视为单一方案，以安全地提供 BDOP 设想的 PEKS 服务。我们正式定义了这样一个方案，我们称之为“PKE/PEKS”，其针对选择密文攻击的安全性，我们称之为“IND-PKE/PEKS-CCA”。然后，我们使用 BDOP 提出的 PEKS 方案和 ElGamal 加密方案的变体构建了一个高效的 PKE/PEKS 方案，并表明它在随机预言模型中是 IND-PKE/PEKS-CCA 安全的，假设计算 Diffie-Hellman (CDH) 问题是棘手的。我们还提出了 PKE/PEKS 的通用构造，其效率比第一个稍低。最后，我们提出了 PKE/PEKS 方案对多接收器设置和多关键字设置的两种扩展。
In this paper, we consider the problem of combining a public key encryption (PKE) scheme and a public key encryption with keyword search (PEKS) scheme proposed by Boneh, Di Crescenzo, Ostrovsky and Persiano (BDOP) in Eurocrypt 2004. We argue that the two schemes need to be treated as a single scheme to securely provide the PEKS service that BDOP envisioned. We formally define such a scheme, which we call “PKE/PEKS” and its security against chosen ciphertext attack, which we call “IND-PKE/PEKS-CCA”. We then construct a highly efficient PKE/PEKS scheme using the PEKS scheme presented by BDOP and a variation of ElGamal encryption scheme and show that it is IND-PKE/PEKS-CCA secure in the random oracle model assuming that the Computational Diffie-Hellman (CDH) problem is intractable. We also propose a generic construction of PKE/PEKS, which is slightly less efficient than the first one. Finally, we present two extensions of a PKE/PEKS scheme to the multi-receiver setting and multi-keyword setting.