Email this article Efficient tree structured algorithm for providing confidentiality of location data to minimize communication overhead in LBS Services
Abstract
We present an effective and protection safeguarding polygons spatial inquiry structure for area based administrations, called Polaris. With Polaris, the LBS supplier redistributes the encoded LBS information to cloud server, and the enrolled client can question any polygon range to get precise LBS results without revealing his/her inquiry data to the LBS supplier and cloud server. Proficient uncommon polygons spatial inquiry calculation over ciphertext is developed dependent on an enhanced homomorphic encryption innovation over Composite request gathering. With SPSQ, Polaris can look re-appropriated scrambled LBS information in cloud server by the encoded demand, and react the scrambled polygons spatial question results precisely.
References
D. L. Goroff, “Balancing privacy versus accuracy in research protocols,” Science, vol. 347, no. 6221, pp. 479–480, 2015.
A. R. Khan, M. Othman, S. A. Madani, and S. U. Khan, “A survey of mobile cloud computing application models,” Communications Surveys & Tutorials, IEEE, vol. 16, no. 1, pp. 393–413, 2014.
H. Li, Y. Yang, T. Luan, X. Liang, L. Zhou, and X. Shen, “Enabling fine-grained multi-keyword search supporting classified sub-dictionaries over encrypted cloud data,” 2015.
H. Li, D. Liu, Y. Dai, and T. H. Luan, “Engineering searchable encryption of mobile cloud networks: when qoe meets qop,” Wireless Communications, IEEE, vol. 22, no. 4, pp. 74–80, 2015. IEEE Internet of Things Journal,Volume:4,Issue:2,Issue Date:April.2017 10
H. Zhu, T. Liu, G. Wei, and H. Li, “Ppas: privacy protection authentication scheme for vanet,” Cluster computing, vol. 16, no. 4, pp. 873–886, 2013.
H. Li, X. Lin, H. Yang, X. Liang, R. Lu, and X. Shen, “Eppdr: an efficient privacy-preserving demand response scheme with adaptive key evolution in smart grid,” Parallel and Distributed Systems, IEEE Transactions on, vol. 25, no. 8, pp. 2053–2064, 2014.
H. Zhu, X. Liu, R. Lu, and H. Li, “Efficient and privacy-preserving online medical pre-diagnosis framework using nonlinear svm.”
L. Li, R. Lu, and C. Huang, “Eplq: Efficient privacy preserving location-based query over outsourced encrypted data,” Internet of Things Journal, IEEE, vol. PP, no. 99, pp. 1–1, 2015. [Online]. Available: http://ieeexplore.ieee.org/xpl/articleDetails. jsp?reload=true&arnumber=7206527
J. Shao, R. Lu, and X. Lin, “Fine: A fine-grained privacy-preserving location-based service framework for mobile devices,” in INFOCOM, 2014 Proceedings IEEE. IEEE, 2014, pp. 1452–1461.
H. Zhu, R. Lu, C. Huang, L. Chen, and H. Li, “An efficient privacy-preserving location based services query scheme in outsourced cloud,” Vehicular Technology, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015. [Online]. Available: http://ieeexplore.ieee.org/stamp/ stamp.jsp?tp=&arnumber=7327242
S. Landau et al., “Control use of data to protect privacy,” Science, vol. 347, no. 6221, pp. 504–506, 2015.
A. Acquisti, L. Brandimarte, and G. Loewenstein, “Privacy and human behavior in the age of information,” Science, vol. 347, no. 6221, pp. 509–514, 2015.
L. Sweeney, “k-anonymity: A model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 05, pp. 557–570, 2002.
P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias, “Preventing location-based identity inference in anonymous spatial queries,” Knowledge and Data Engineering, IEEE Transactions on, vol. 19, no. 12, pp. 1719–1733, 2007.
K. Vu, R. Zheng, and L. Gao, “Efficient algorithms for k-anonymous location privacy in participatory sensing,” in INFOCOM, 2012 Proceedings IEEE. IEEE, 2012, pp. 2399–2407.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.