返回
Achieving Searchable Encryption Scheme With Search Pattern Hidden
DOI:10.1109/TSC.2020.2973139.png)
摘要
En 中文
Searchable Encryption (SE) enables a data owner to outsource encrypted data to an untrusted server while preserving the keyword search functionality. Typically, the server learns whether or not a query has been performed more than once, which is usually called the search pattern. However, such kind of information leakage might be leveraged to break query privacy. To further reduce such type of leakage and provide strong privacy guarantee, Wang et al. proposed a novel SE scheme based on the Paillier encryption scheme in INFOCOM'15. Unfortunately, their scheme cannot perform keyword search successfully, because the additive homomorphic property is not sufficient for their construction. In this article, we first show that why their scheme fails to return the correct search result, and then propose a new SE scheme by adopting a special additive homomorphic encryption scheme to achieve the multiplicative homomorphic property efficiently. Furthermore, we enhance the security on the user side. Specifically, we use random polynomials with an appropriate degree to guarantee that the user cannot learn anything other than the desired search result. Finally, we present a formal security analysis and implement our scheme on a real-world database, which demonstrates that our construction can achieve the desired security properties with good performance.
Keyword:
Encryption
Servers
Keyword search
Additives
Indexes
Searchable encryption
conjunctive keyword search
search pattern
additive homomorphic encryption
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.8
论文数:
2.2K
被引数:
6.5K
机构
引用论文
Isolating Fungal Pathogens from a Dynamic Disease Outbreak in a Native Plant Population to Establish Plant-Pathogen Bioassays for the Ecological Model Plant Nicotiana attenuata
PLoS ONE
IF0

