Abstract
With the prevalence of cloud computing, data owners are motivated to outsource their databases to the cloud. However, sensitive information has to be encrypted to preserve the privacy, which inevitably makes effective data utilization a challenging task. Existing work either focuses on keyword searches, or suffers from inadequate security guarantees or inefficiency. In this paper, we focus on the problem of multi-dimensional range queries over dynamic encrypted cloud data. We propose a Tree-based private Range Query scheme over dynamic Encrypted cloud Data (TRQED), which enables faster-than-linear range queries and supports data dynamics while preserving the query privacy and single-dimensional privacy simultaneously. TRQED achieves provable security against semi-honest adversaries under known background model. Extensive experiments on real-world datasets show that the overhead of TRQED is desirable, and TRQED is more efficient compared with existing work.
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
Similar content being viewed by others
References
Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE S&P, pp. 44–55 (2000)
Li, M., et al.: Authorized private keyword search over encrypted data in cloud computing. In: Proceedings of IEEE ICDCS, pp. 383–392 (2011)
Cao, N., et al.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. In: Proceedings of IEEE INFOCOM, pp. 829–837 (2011)
Wang, B., et al.: Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: Proceedings of IEEE INFOCOM, pp. 2112–2120 (2014)
Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70936-7_29
Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 214–231. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10366-7_13
Lu, Y.: Privacy-preserving Logarithmic-time search on encrypted data in cloud. In: Proceedings of NDSS (2012)
Wang, P., Ravishankar, C.V.: Secure and efficient range queries on outsourced databases using \(\widehat{R}\)-trees. In: Proceedings of IEEE ICDE, pp. 314–325 (2013)
Wang, B., et al.: Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. In: Proceedings of ACM ASIACCS, pp. 111–122 (2014)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. ACM (1984)
Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2009)
Wang, C., et al.: Secure ranked keyword search over encrypted cloud data. In: Proceedings of ICDCS, pp. 253–262 (2011)
Li, R., et al.: Fast and scalable range query processing with strong privacy protection for cloud computing. IEEE/ACM Trans. Netw. 24(4), 2305–2318 (2016)
Chi, J., et al.: Fast multi-dimensional range queries on encrypted cloud databases. In: Proceedings of DASFAA, pp. 559–575 (2017)
Stefanov, E., et al.: Path ORAM: an extremely simple oblivious RAM protocol. In: Proceedings of ACM CCS, pp. 299–310 (2013)
Curtmola, R., et al.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)
Lichman, M.: (1999). http://archive.ics.uci.edu/ml
Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_30
Wong, W.K., et al.: Secure kNN computation on encrypted databases. In: Proceedings of ACM SIGMOD, pp. 139–152 (2009)
Sun, W., et al.: Catch you if you lie to me: efficient verifiable conjunctive keyword search over large dynamic encrypted cloud data. In: Proceedings of IEEE INFOCOM, pp. 2110–2118 (2015)
Papadopoulos, D., Papadopoulos, S., Triandopoulos, N.: Taking authenticated range queries to arbitrary dimensions. In: Proceedings of ACM CCS, pp. 819–830 (2014)
Kawamoto, J., Yoshikawa, M.: Private range query by perturbation and matrix based encryption. In: Proceedings of ICDIM, pp. 211–216 (2011)
Wang, B., Hou, Y., Li, M., Wang, H., Li, H., Li, F.: Tree-based multi-dimensional range search on encrypted data with enhanced privacy. In: Tian, J., Jing, J., Srivatsa, M. (eds.) SecureComm 2014. LNICST, vol. 152, pp. 374–394. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23829-6_26
Acknowledgments
This work was supported by the National Natural Science Foundation of China (No. 61572456), the Anhui Province Guidance Funds for Quantum Communication and Quantum Computers and the Natural Science Foundation of Jiangsu Province of China (No. BK20151241).
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
Yang, W., Xu, Y., Nie, Y., Shen, Y., Huang, L. (2018). TRQED: Secure and Fast Tree-Based Private Range Queries over Encrypted Cloud. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-91458-9_8
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)