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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
