A New Fast Matching Method for Dummy K-anonymous Location Privacy Protection in Location Based Services

Abstract

This paper proposes a dummy k-anonymous location privacy protection based on a fast-matching method that adopts the space coordinate transformation algorithm. First, the 2-D coordinates are converted to binary Morton code. With the fast matching method, non-adjacent position points distributed in different grids are selected as candidate sets of dummy positions. Then, the semantic similarity of place name information of position points in the candidate sets is calculated using the edit distance, and k-1 position points with the smallest semantic similarity are selected as dummy positions. While satisfying the semantic l-diversity and physical dispersion, this method can improve the generation efficiency of dummy locations and further improve the quality of location service.