There are a number of searchable encryption schemes that allow secure conjunctive keyword searches over encrypted data, but all of them assume that the position of the keywords is known. This is a pity, since in unstructured text, e.g. the body of an e-mail, this position is unknown and one has to construct O(mn) search tokens for n keywords in a text of length m. In this paper we present a searchable encryption scheme that allows conjunctive keyword searches without specifying the position requiring only one search token with constant ciphertext length. We prove the security of our scheme using the external Diffie-Hellman assumption in the random oracle model.
展开▼
机译:有许多可搜索的加密方案,允许安全的联合关键字搜索在加密数据上,但所有这些都会假设关键字的位置是已知的。这是怜悯,因为在非结构化的文本中,例如,电子邮件的主体,这个位置是未知的,一个人必须在长度m的文本中构建一个(m n sup>)搜索令牌的n关键字。在本文中,我们介绍了一种可搜索的加密方案,允许联合关键字搜索,而不指定只需要一个具有恒定密文长度的搜索令牌的位置。我们使用随机Oracle模型中的外部Diffie-Hellman假设证明了我们的计划的安全性。
展开▼