Jump to main content
US EPA
United States Environmental Protection Agency
Search
Search
Main menu
Environmental Topics
Laws & Regulations
About EPA
Health & Environmental Research Online (HERO)
Contact Us
Print
Feedback
Export to File
Search:
This record has one attached file:
Add More Files
Attach File(s):
Display Name for File*:
Save
Citation
Tags
HERO ID
7043021
Reference Type
Journal Article
Title
A Practical Synonym Symmetric Searchable Encryption
Author(s)
Liu, ZuoP; Lu, HaiN; Ding, N; ,
Year
2015
Publisher
DESTECH PUBLICATIONS, INC
Location
LANCASTER
Page Numbers
736-746
Web of Science Id
WOS:000365437300113
Abstract
With the advent of cloud computing in an era of mass data, more and more people are motivated to utilize the outsourcing service. For the sake of the security of the outsourced data, these data have to be encrypted prior to outsource to the remote "honest-but-curious" servers. So far, the searchable encryption technique based on the secure index becomes a key and lead solution. Unfortunately, there exists no such solution focusing on the synonym search in the symmetric-key setting. In consideration of finiteness of people's memory and lifetime of people's knowledge, we seriously study this issue.In this paper, we design a scheme for the problem of synonym search, and provide the proof of security. Our proposed technique has a number of crucial advantages. We for the first time put forward the problem of the synonym keyword search over remotely encrypted data in the context of cloud computing. In our scheme, we introduce the concepts of synonym function and synonym sets. We firstly implement a formal practical Synonym Symmetric Searchable Encryption Solution (PSSSE). Through rigorous security analysis, we show that our proposed solution is correct and privacy-preserving (non-adaptive security) without the loss of function of the scheme. Besides, the algorithms we present are simple and effective, it almost increases no space and computing overhead of the user. The overhead of communication still remains O(1). The time complexity of searching on encryption data is O(p) (p denotes the maximum number of synonym of keyword). To apply to general situation, we simultaneously give a practical trade-off between availability and performance. This scheme greatly enhances system usability by responding the answers that are all documents containing keyword and corresponding synonyms. Its occurrence obviously overcomes the deficiency of existing schemes. Hence, our solution is very significative to practical use and bridges the gap of state-of-art.
Conference Name
International Conference on Computer Science and Communication Engineering (CSCE)
Conference Location
Suzhou, PEOPLES R CHINA
Home
Learn about HERO
Using HERO
Search HERO
Projects in HERO
Risk Assessment
Transparency & Integrity