Indexing dynamic encrypted database in cloud for efficient secure k-nearest neighbor query
Xingxin LI , Youwen ZHU , Rui XU , Jian WANG , Yushu ZHANG
Front. Comput. Sci. ›› 2024, Vol. 18 ›› Issue (1) : 181803
Indexing dynamic encrypted database in cloud for efficient secure k-nearest neighbor query
Secure -Nearest Neighbor (-NN) query aims to find nearest data of a given query from an encrypted database in a cloud server without revealing privacy to the untrusted cloud and has wide applications in many areas, such as privacy-preserving machine learning and secure biometric identification. Several solutions have been put forward to solve this challenging problem. However, the existing schemes still suffer from various limitations in terms of efficiency and flexibility. In this paper, we propose a new encrypt-then-index strategy for the secure -NN query, which can simultaneously achieve sub-linear search complexity (efficiency) and support dynamical update over the encrypted database (flexibility). Specifically, we propose a novel algorithm to transform the encrypted database and encrypted query points in the cloud. By indexing the transformed database using spatial data structures such as the R-tree index, our strategy enables sub-linear complexity for secure -NN queries and allows users to dynamically update the encrypted database. To the best of our knowledge, the proposed strategy is the first to simultaneously provide these two properties. Through theoretical analysis and extensive experiments, we formally prove the security and demonstrate the efficiency of our scheme.
cloud computing / secure k-NN query / sub-linear complexity / dynamic update
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
Elmehdwi Y, Samanthula B K, Jiang W. Secure k-nearest neighbor query over encrypted data in outsourced environments. In: Proceedings of 2014 IEEE 30th International Conference on Data Engineering. 2014, 664−675 |
| [21] |
Wong W K, Cheung D W L, Kao B, Mamoulis N. Secure KNN computation on encrypted databases. In: Proceedings of 2009 ACM SIGMOD International Conference on Management of data. 2009, 139−152 |
| [22] |
|
| [23] |
|
| [24] |
Lei X, Liu A X, Li R, Tu G H. SecEQP: a secure and efficient scheme for SkNN query problem over encrypted geodata on cloud. In: Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE). 2019, 662−673 |
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
Yao B, Li F, Xiao X. Secure nearest neighbor revisited. In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE). 2013, 733−744 |
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
Hu H, Xu J, Ren C, Choi B. Processing private queries over untrusted data cloud through privacy homomorphism. In: Proceedings of the 27th IEEE International Conference on Data Engineering. 2011, 601−612 |
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
Wang P, Ravishankar C V. Secure and efficient range queries on outsourced databases using Rp-trees. In: Proceedings of the 29th IEEE International Conference on Data Engineering. 2013, 314−325 |
| [42] |
Manolopoulos Y, Nanopoulos A, Papadopoulos A N, Theodoridis Y. R-Trees: Theory and Applications. London: Springer, 2006 |
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
Higher Education Press
Supplementary files
/
| 〈 |
|
〉 |