Cloud computing has generated much interest in the research community in recent years for its many advantages, but has also raise security and privacy concerns. The storage and access of confidential documents have been identified as one of the central problems in the area. In particular, many researchers investigated solutions to search over encrypted documents stored on remote cloud servers. While many schemes have been proposed to perform conjunctive keyword search, less attention has been noted on more specialized searching techniques. In this paper, we present a phrase search technique based on Bloom filters that is significantly faster than existing solutions, with similar or better storage and communication cost. Our technique uses a series of $n$n-gram filters to support the functionality. The scheme exhibits a trade-off between storage and false positive rate, and is adaptable to defend against inclusion-relation attacks. A design approach based on an application's target false positive rate is also described.

中文翻译：

---

加密云存储的快速短语搜索

近年来，云计算因其众多优势而引起了研究界的极大兴趣，但也引发了安全和隐私问题。机密文件的存储和访问已被确定为该地区的核心问题之一。特别是，许多研究人员研究了搜索存储在远程云服务器上的加密文档的解决方案。虽然已经提出了许多方案来执行联合关键字搜索，但对更专业的搜索技术的关注较少。在本文中，我们提出了一种基于布隆过滤器的短语搜索技术，它比现有解决方案快得多，具有相似或更好的存储和通信成本。我们的技术使用了一系列$n$n-gram 过滤器以支持该功能。该方案展示了存储和误报率之间的权衡，并且适用于防御包含关系攻击。还描述了一种基于应用程序目标误报率的设计方法。