ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Symmetric Searchable Encryption with Efficient Range Query using Multi-layered Linked Chains
Cited 12 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Nam-Su Jho, Ku-Young Chang, Dowon Hong, Changho Seo
Issue Date
2016-11
Citation
Journal of Supercomputing, v.72, no.11, pp.4233-4246
ISSN
0920-8542
Publisher
Springer
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1007/s11227-015-1497-6
Abstract
Searchable encryption is an encryption system which provides confidentiality of stored documents and usability of document search at the same time. Remote cloud storage is the most typical application for searchable encryption. By applying searchable encryption, inside attacks can be prevented fundamentally. Designing searchable encryption which supports various queries?봣or example, range query, conjunctive keyword query, etc.?봧s also important for convenience. In this paper, we focus on range query problem. Up to now, only a few results have been proposed, in which the main functions are constructed using public key cryptosystems. Therefore, the amount of computations for encryption and search is large. Furthermore, search time depends on the size of the entire database. We propose a new searchable encryption protocol which is based on a symmetric key encryption and linked chain structure instead of public key-based techniques. The main contribution of the protocol is reducing the computation cost for search remarkably. In reality, the amount of computations depends on the number of documents that are matched to a query instead of the size of the entire database.
KSP Keywords
Computation cost, Conjunctive keyword query, Document search, Encryption protocol, Encryption system, Public-key Cryptosystems, Search time, Symmetric Searchable Encryption, Symmetric key encryption, chain structure, cloud storage