Generating Searchable Public-Key Ciphertexts With Hidden Structures for Fast Keyword Search
Generating Searchable Public-Key Ciphertexts With Hidden Structures for Fast Keyword Search
复制标题
DOI：
10.1109/tifs.2015.2442220
复制
发表时间：
2015-06
影响因子：
6.8
通讯作者：
Peng Xu;Qianhong Wu;Wei Wang;W. Susilo;J. Domingo-Ferrer;Hai Jin
中科院分区：
文献类型：
--
作者：
Peng Xu;Qianhong Wu;Wei Wang;W. Susilo;J. Domingo-Ferrer;Hai Jin
现有的语义安全公钥可搜索加密方案的搜索时间与密文总数成线性关系。这使得从大型数据库中检索变得令人望而却步。为了解决这一问题，本文在不牺牲加密关键字语义安全性的前提下，提出了一种具有隐藏结构的可搜索公钥密文（SPCHS），用于尽可能快速地搜索关键字。在SPCHS中，所有关键字可搜索的密文都是由隐藏关系构成的，通过一个关键字对应的搜索陷阱门，将这些关系的最小信息公开给搜索算法，以指导搜索算法高效地找到所有匹配的密文。我们从零开始构建了一个SPCHS方案，其中密文具有隐藏的星形结构。在随机oracle （random oracle， RO）模型下证明了该方案是语义安全的。我们的方案的搜索复杂度取决于包含查询关键字的密文的实际数目，而不是所有密文的数目。最后，我们提出了一种基于匿名身份加密和无冲突的基于全身份可塑身份的匿名密钥封装机制（IBKEM）的通用SPCHS结构。我们举例说明了两个无冲突的全身份可塑IBKEM实例，它们在RO模型和标准模型中分别是语义安全的和匿名的。后一个实例使我们能够在标准模型中构造具有语义安全性的SPCHS方案。
Existing semantically secure public-key searchable encryption schemes take search time linear with the total number of the ciphertexts. This makes retrieval from large-scale databases prohibitive. To alleviate this problem, this paper proposes searchable public-key ciphertexts with hidden structures (SPCHS) for keyword search as fast as possible without sacrificing semantic security of the encrypted keywords. In SPCHS, all keyword-searchable ciphertexts are structured by hidden relations, and with the search trapdoor corresponding to a keyword, the minimum information of the relations is disclosed to a search algorithm as the guidance to find all matching ciphertexts efficiently. We construct an SPCHS scheme from scratch in which the ciphertexts have a hidden star-like structure. We prove our scheme to be semantically secure in the random oracle (RO) model. The search complexity of our scheme is dependent on the actual number of the ciphertexts containing the queried keyword, rather than the number of all ciphertexts. Finally, we present a generic SPCHS construction from anonymous identity-based encryption and collision-free full-identity malleable identity-based key encapsulation mechanism (IBKEM) with anonymity. We illustrate two collision-free full-identity malleable IBKEM instances, which are semantically secure and anonymous, respectively, in the RO and standard models. The latter instance enables us to construct an SPCHS scheme with semantic security in the standard model.