Secure Sharing of Private Locations through Homomorphic Bloom Filters

Location information is becoming increasingly popular in online social networks, vehicle networks, and online games. In this paper, we develop a distributed protocol that allows one party to determine, in a private and secure manner, whether or not the trajectory of a second party has an intersection with specific locations of interest. Our design is fully flexible, meaning that each user is able to specify what kind of datasets they would like to make visible, and be queried by other users. The methodology is based on developing a generalized set membership check approach, using an advanced data structure called the bloom filter. To demonstrate its feasibility and usability, we offer three working prototypes, which are implemented on the open-source homomorphic libraries. Our preliminary results illustrate the performance and overhead of the proposed approaches as well as the security of the protocol designs.

[1]  Dara E. Seidl,et al.  Spatial obfuscation methods for privacy protection of household-level data , 2015 .

[2]  Jean-Pierre Hubaux,et al.  Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices , 2014, IEEE Transactions on Information Forensics and Security.

[3]  Florian Kerschbaum,et al.  Outsourced private set intersection using homomorphic encryption , 2012, ASIACCS '12.

[4]  Moti Yung,et al.  Non-interactive cryptocomputing for NC/sup 1/ , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[5]  Frederik Vercauteren,et al.  Somewhat Practical Fully Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..

[6]  Brent Waters,et al.  Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.

[7]  Per A. Hallgren,et al.  InnerCircle: A parallelizable decentralized privacy-preserving location proximity protocol , 2015, 2015 13th Annual Conference on Privacy, Security and Trust (PST).

[8]  Frederik Armknecht,et al.  A Guide to Fully Homomorphic Encryption , 2015, IACR Cryptol. ePrint Arch..

[9]  Rachel Player,et al.  Simple Encrypted Arithmetic Library-SEAL , 2017 .

[10]  Josep Domingo-Ferrer,et al.  A k-anonymous approach to privacy preserving collaborative filtering , 2015, J. Comput. Syst. Sci..

[11]  Dongxi Liu,et al.  Privacy of outsourced k-means clustering , 2014, AsiaCCS.

[12]  Keke Gai,et al.  Intelligent cryptography approach for secure distributed big data storage in cloud computing , 2017, Inf. Sci..

[13]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[14]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[15]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[16]  Vinod Vaikuntanathan,et al.  Lattice-based FHE as secure as PKE , 2014, IACR Cryptol. ePrint Arch..

[17]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[18]  Xiaolin Li,et al.  Inferring Correlation between User Mobility and App Usage in Massive Coarse-grained Data Traces , 2017, Proc. ACM Interact. Mob. Wearable Ubiquitous Technol..

[19]  Yao Zheng,et al.  SHARP: Private Proximity Test and Secure Handshake with Cheat-Proof Location Tags , 2012, ESORICS.

[20]  Ronald L. Krutz,et al.  Cloud Security: A Comprehensive Guide to Secure Cloud Computing , 2010 .

[21]  Changyu Dong,et al.  When private set intersection meets big data: an efficient and scalable protocol , 2013, CCS.