Abstract
With the rapid development of cloud computing paradigm, data owners have the opportunity to outsource their databases and management tasks to the cloud. Due to the privacy concerns, it is required for them to encrypt the databases before outsourcing. However, there is no existing techniques handling range queries in a fully secure way. Therefore, in this paper we focus exactly on secure processing of range queries over outsourced encrypted databases. To efficiently process secure range queries, the extraordinarily challenging task is how to perform fully secure range queries over encrypted data without the cloud ever decrypting the data. To address the challenge, we first propose a basic secure range queries algorithm which is not absolutely secure (i.e., leaking the privacy of access patterns and path patterns). To meet a better security, we present a fully secure algorithm that preserves the privacy of the data, query, result, access patterns and path patterns. At last, we empirically analyze and conduct a comprehensive performance evaluation using real dataset to validate our ideas and the proposed secure algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
[z] denotes the standard binary conversion (e.g., for m = 8, [6] = ‘00000110’, where m represents the domain size in bits).
- 2.
\((M)_{Min}^{Max}\) denotes the point with the minimum and the point with the maximum coordinate values in each dimension, respectively.
- 3.
- 4.
References
Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: ICDE, pp. 664–675. IEEE, Chicago (2014)
Li, S.P., Wong, M.H.: Privacy-preserving queries over outsourced data with access pattern protection. In: IEEE International Conference on Data Mining Workshop, pp. 581–588. IEEE, Shenzhen (2014)
Liu, J., Yang, J., Xiong, L., et al.: Secure skyline queries on cloud platform. In: International Conference on Data Engineering, pp. 633–645. IEEE, San Diego (2017)
Liu, A., Kai, Z., Lu, L., et al.: Efficient secure similarity computation on encrypted trajectory data. In: International Conference on Data Engineering, pp. 66–77. IEEE, Seoul (2015)
Hore, B., Mehrotra, S., Tsudik, G.: A privacy-preserving index for range queries. In: Thirtieth International Conference on Very Large Data Bases VLDB Endowment, pp. 720–731. ACM, Toronto (2004)
Hore, B., Mehrotra, S., Canim, M., Kantarcioglu, M.: Secure multidimensional range queries over outsourced data. VLDB J. 21(3), 333–358 (2012)
Chi, J., Hong, C., Zhang, M., Zhang, Z.: Privacy-enhancing range query processing over encrypted cloud databases. In: WISE, pp. 63–77 (2015)
Shi, E., Bethencourt, J., Chan, T.H., et al.: Multi-dimensional range query over encrypted data. In: Security and Privacy, pp. 350–364. IEEE (2007)
Wang, P., Ravishankar, C.V.: Secure and efficient range queries on outsourced databases using \(\widehat{R}\)-trees. In: IEEE International Conference on Data Engineering, pp. 314–325. IEEE, Brisbane (2013)
Chi, J., Hong, C., Zhang, M., Zhang, Z.: Fast multi-dimensional range queries on encrypted cloud databases. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10177, pp. 559–575. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55753-3_35
Wang, B., Li, M., Wang, H.: Geometric range search on encrypted spatial data. IEEE Trans. Inf. Forensics Secur. 11(4), 704–719 (2016)
Wang, B., Hou, Y., Li, M., Wang, H., Li, H.: Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. In: ASIA CCS, pp. 111–122. ACM, Kyoto (2014)
Li, R., Liu, A.X., Wang, A.L., et al.: Fast and scalable range query processing with strong privacy protection for cloud computing. IEEE/ACM Trans. Netw. 24(4), 2305–2318 (2016)
Kim, H.I., Kim, H.J., Chang, J.W.: A range query processing algorithm hiding data access patterns in outsourced database environment. In: Tan, Y., Shi, Y. (eds.) DMBD 2016. LNCS, vol. 9714, pp. 434–446. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40973-3_44
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_16
Samanthula, B.K.K., Hu, C., Jiang, W.: An efficient and probabilistic secure bit-decomposition. In: ASIA CCS, pp. 541–546. ACM, Hangzhou (2013)
Acknowledgments
The work is partially supported by the National Natural Science Foundation of China (Nos. 61532021, 61572122, U1736104), the Project is sponsored by Liaoning BaiQianWan Talents Program, and the Fundamental Research Funds for the Central Universities (N161606002).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Cui, N., Yang, X., Wang, L., Wang, B., Li, J. (2018). Secure Range Query over Encrypted Data in Outsourced Environments. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10828. Springer, Cham. https://doi.org/10.1007/978-3-319-91458-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-91458-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91457-2
Online ISBN: 978-3-319-91458-9
eBook Packages: Computer ScienceComputer Science (R0)