Return just your search: privacy-preserving homoglyph search for arbitrary languages |
| |
Authors: | Bowen ZHAO Shaohua TANG Ximeng LIU Yiming WU |
| |
Affiliation: | 1. School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China2. Zheng Zhiming Lab, Peng Cheng Laboratory, Shenzhen 518055, China3. College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350108, China |
| |
Abstract: | Searchable encryption is an effective way to ensure the security and availability of encrypted outsourced cloud data. Among existing solutions, the keyword exact search solution is relatively inflexible, while the fuzzy keyword search solution either has a high index overhead or suffers from the false-positive. Furthermore, no existing fuzzy keyword search solution considers the homoglyph search on encrypted data. In this paper, we propose an efficient privacy-preserving homoglyph search scheme supporting arbitrary languages (POSA, in short). We enhance the performance of the fuzzy keyword search in three aspects. Firstly, we formulate the similarity of homoglyph and propose a privacy-preserving homoglyph search. Secondly, we put forward an index build mechanism without the false-positive, which reduces the storage overhead of the index and is suitable for arbitrary languages. Thirdly, POSA returns just the user’s search, i.e., all returned documents contain the search keyword or its homoglyph. The theoretical analysis and experimental evaluations on real-world datasets demonstrate the effectiveness and efficiency of POSA. |
| |
Keywords: | searchable encryption cloud storage fuzzy search privacy preservation arbitrary languages |
|
| 点击此处可从《Frontiers of Computer Science》浏览原始摘要信息 |
|
点击此处可从《Frontiers of Computer Science》下载全文 |
|