PRACTICAL APPROXIMATE K NEAREST NEIGHBOR QUERIES WITH LOCATION AND QUERY PRIVACY
•
1 like•232 views
The document proposes solutions for approximate k-nearest neighbor queries that preserve both the location and query privacy of mobile users. The basic solution allows a user to retrieve one type of point of interest, such as the approximate k nearest car parks, without revealing to the location-based service provider what type of point is retrieved. The generic solution can be applied to queries with multiple discrete attribute types. Compared to existing solutions, the proposed solutions provide more efficient approximate k-nearest neighbor search while protecting user privacy. Experiments show the basic solution is practical for real-world queries.
![CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249)
MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com
Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com
both parallel computation and communication overhead. Experiment evaluation
has shown that our basic protocol is practical. Our future work is to implement
our protocol on mobile devices.
REFERENCES
[1] M. Bellare and P. Rogaway, “Optimal asymmetric encryption - how to
encrypt with RSA,” in Proc. Eurocrypt, 1994, pp. 92–111.
[2] B. Bamba, L. Liu, P. Pesti, and T. Wang, “Supporting anonymous location
queries in mobile environments with privacygrid,” in Proc. 17th Int. Conf.
World Wide Web, 2008, pp. 237–246.
[3] A. R. Beresford and F. Stajano, “Location privacy in pervasive computing,”
IEEE Pervasive Comput., vol. 2, no. 1, pp. 46–55, 2003.
[4] C. Y. Chow, M. F. Mokbel, and X. Liu, “A peer-to-peer spatial cloaking
algorithm for anonymous location-based services,” in Proc. 14th Annu. ACM
Int. Symp. Adv. Geograph. Inform. Syst., 2006, pp. 171–178.
[5] T. ElGamal, “A public-key cryptosystem and a signature scheme based on
discrete logarithms,” IEEE Trans. Inform. Theory, vol. 31, no. 4, pp. 469–472,
Jul. 1985.
[6] Y. Elmehdwi, B. K. Samanthula, and W. Jiang, “Secure k-nearest neighbor
query over encrypted data in outsourced environments,” in Proc. IEEE 30th Int.
Conf. Data Eng., 2014, pp. 664–675.](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
What's hot (18)
Similar to PRACTICAL APPROXIMATE K NEAREST NEIGHBOR QUERIES WITH LOCATION AND QUERY PRIVACY
Similar to PRACTICAL APPROXIMATE K NEAREST NEIGHBOR QUERIES WITH LOCATION AND QUERY PRIVACY (20)
More from Nexgen Technology
More from Nexgen Technology (20)
Recently uploaded
Recently uploaded (20)
PRACTICAL APPROXIMATE K NEAREST NEIGHBOR QUERIES WITH LOCATION AND QUERY PRIVACY
- 1. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249) MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com PRACTICAL APPROXIMATE K NEAREST NEIGHBOR QUERIES WITH LOCATION AND QUERY PRIVACY ABSTRACT In mobile communication, spatial queries pose a serious threat to user location privacy because the location of a query may reveal sensitive information about the mobile user. In this paper, we study approximate k nearest neighbor (kNN) queries where the mobile user queries the location-based service (LBS) provider about approximate k nearest points of interest (POIs) on the basis of his current location. We propose a basic solution and a generic solution for the mobile user to preserve his location and query privacy in approximate kNN queries. The proposed solutions are mainly built on the Paillier public-key cryptosystem and can provide both location and query privacy. To preserve query privacy, our basic solution allows the mobile user to retrieve one type of POIs, for example, approximate k nearest car parks, without revealing to the LBS provider what type of points is retrieved. Our generic solution can be applied to multiple discrete type attributes of private location-based queries. Compared with existing solutions for kNN queries with location privacy, our solution is more efficient. Experiments have shown that our solution is practical for kNN queries CONCLUSION In this paper, we have presented a basic and a generic approximate kNN query protocols. Security analysis has shown that our protocols have location privacy, query privacy and data privacy. Performance has shown that our basic protocol performs better than the existing PIRbased LBS query protocols in terms of
- 2. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249) MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com both parallel computation and communication overhead. Experiment evaluation has shown that our basic protocol is practical. Our future work is to implement our protocol on mobile devices. REFERENCES [1] M. Bellare and P. Rogaway, “Optimal asymmetric encryption - how to encrypt with RSA,” in Proc. Eurocrypt, 1994, pp. 92–111. [2] B. Bamba, L. Liu, P. Pesti, and T. Wang, “Supporting anonymous location queries in mobile environments with privacygrid,” in Proc. 17th Int. Conf. World Wide Web, 2008, pp. 237–246. [3] A. R. Beresford and F. Stajano, “Location privacy in pervasive computing,” IEEE Pervasive Comput., vol. 2, no. 1, pp. 46–55, 2003. [4] C. Y. Chow, M. F. Mokbel, and X. Liu, “A peer-to-peer spatial cloaking algorithm for anonymous location-based services,” in Proc. 14th Annu. ACM Int. Symp. Adv. Geograph. Inform. Syst., 2006, pp. 171–178. [5] T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. Inform. Theory, vol. 31, no. 4, pp. 469–472, Jul. 1985. [6] Y. Elmehdwi, B. K. Samanthula, and W. Jiang, “Secure k-nearest neighbor query over encrypted data in outsourced environments,” in Proc. IEEE 30th Int. Conf. Data Eng., 2014, pp. 664–675.
- 3. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249) MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com [7] C. Gentry and Z. Ramzan, “Single-database private information retrieval with constant communication rate,” in Proc. 32nd Int. Conf. Automata, Lang. Program., 2005, pp. 803–815. [8] G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan, “Private queries in location-based services: Anonymizers are not necessary,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2008, pp. 121–132. [9] G. Ghinita, P. Kalnis, M. Kantarcioglu, and E. Bertino, “Approximate and exact hybrid algorithms for private nearestneighbor queries with database protection,” GeoInformatica, vol. 15, no. 14, pp. 699–726, 2010. [10] G. Ghinita and R. Rughinis, “An efficient privacy-reserving system for monitoring mobile users: Making searchable encryption practical,” in Proc. 4th ACM Conf. Data Appl. Security Privacy, 2014, pp. 321–332.
- 4. CONTACT: PRAVEEN KUMAR. L (, +91 – 9791938249) MAIL ID: sunsid1989@gmail.com, praveen@nexgenproject.com Web: www.nexgenproject.com, www.finalyear-ieeeprojects.com