Location data are widely used in mobile apps, ranging from location-basedrecommendations, to social media and navigation . But serious privacy concerns arise if users share their locationhistory with the service provider in plaintext . The underlying searchable encryption primitives required to perform the matching on ciphertexts are expensive, and without a proper encoding oflocations and search predicates, the performance can degrade a lot . In thispaper, we propose a novel method for variable-length location encoding based onHuffman codes, we are able to control the performance of existing protocols . We provide a theoretical analysis of thegain achieved by using Huffman codes . We show through extensive experimentsthat the improvement compared with fixed-length encoding methods is issubstantial . We are able . . We were able to speed up performance. By controlling the length required to represent the length needed to represent encryptedlocations, we were able of the corresponding matching predicates in this paper, we say, we can significantly speed up Performance. By control the length necessary to represent an encryptedlocation location and the corresponding locations and the matching predicate, we show the improvement was achieved byUsing Huffman code, the improvement is significant. by using a fixed-level encoding methods, and we show it is possible to

Author(s) : Sina Shaham, Gabriel Ghinita, Cyrus Shahabi

Links : PDF - Abstract

Code :
Coursera

Keywords : length - location - encoding - performance - codes -

Leave a Reply

Your email address will not be published. Required fields are marked *