SWSongyang Wu
Songyang Wu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Songyang Wu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
1 shared publication - Benyu Zhang
Ant Group, Hangzhou, China
1 shared publication - Pu Duan
Ant International, Singapore
1 shared publication - Wenju Xu
State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
1 shared publication - Yupu Hu
Xidian University
1 shared publication - Zhiyong Hong
School of Electronics and Information Engineering, Wuyi University, Jiangmen 529020, China
1 shared publication
Latest Publications
- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.