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—for example, range query, conjunctive keyword query, etc.—is 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Song D, Wagner D, Perrig A (2000) Practical techniques for searching on encrypted data, In: Proceedings of IEEE symposium on security and privacy, pp 44–55
Goh EJ (2003) Secure indexes, IACR ePrint Archive, Technical report 2003/216
Boneh D, Crescenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. Proc Eurocrypt 2004:506–522
Abdalla M, Bellare M, Catalano D, Kiltz E, Kohno T, Lange T, Malone-Lee J, Neven G, Paillier P, Shi H (2005) Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. Proc Crypto 2005:205–222
Chang YC, Mitzenmacher M (2005) Privacy preserving keyword searches on remote encrypted data. In: Proceedings of of applied cryptography and network security conference (ACNS)
Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of ACM CCS
Choi D, Kim S-H, Lee Y (2012) Address permutation for privacy-preserving searchable symmetric encryption. ETRI J 34(1):66–75
Jho N-S, Hong D (2013) Symmetric searchable encryption with efficient conjunctive keyword search. KSII Trans Internet Inf Syst 7(5):1329–1343
Shi E, Bethencourt J, Chan T-HH, Song D, Perrig A (2007) Multi-dimensional range query over encrypted data. In: Proceedings of IEEE symposium on security and privacy 2007, pp 350–364
Boneh D, Waters B (2007) Conjunctive, subset, and range queries on encrypted data. In: Proceedings of TCC
Agrawal R, Kiernan J, Srikant R, Xu Y (2004) Order-preserving encryption for numeric data. In: Proceedings of 2004 ACM SIGMOD international conference on management of data, pp 563–574
Boldyreva A, Chenette N, Lee Y, O’Neill A, (2009) Order-preserving symmetric en-cryption. In: Proceedings of Eurocrypt 2009, LNCS, vol 5479, pp 224–241
Boldyreva A, Chenette N, O’Neill A (2011) Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Proceedings of Crypto 2011, LNCE, vol 6841, pp 578–595
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by ETRI R&D program (15ZS1500), Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (Grant No. 2011-0029927).
Rights and permissions
About this article
Cite this article
Jho, NS., Chang, KY., Hong, D. et al. Symmetric searchable encryption with efficient range query using multi-layered linked chains. J Supercomput 72, 4233–4246 (2016). https://doi.org/10.1007/s11227-015-1497-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-015-1497-6