Privacy-preserving spatiotemporal matching
Authors:
- Jingchao SunJSJingchao Sun
- Rui ZhangRZRui Zhang
- Yanchao ZhangYZYanchao Zhang
- 1 April 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 800-808
Abstract
The explosive growth of mobile-connected and location-aware devices makes it possible to have a new way of establishing trust relationships, which we coin as spatiotemporal matching. In particular, a mobile user could very easily maintain his spatiotemporal profile recording his continuous whereabouts in time, and the level of his spatiotemporal profile matching that of the other user can be translated into the level of trust they two can have in each other. Since spatiotemporal profiles contain very sensitive personal information, privacy-preserving spatiotemporal matching is needed to ensure that as little information as possible about the spatiotemporal profile of either matching participant is disclosed beyond the matching result. We propose a cryptographic solution based on Private Set Intersection Cardinality and a more efficient non-cryptographic solution involving a novel use of the Bloom filter. We thoroughly analyze both solutions and compare their efficacy and efficiency via detailed simulation studies.Keywords
This publication has 9 references indexed in Scilit:
- FindU: Privacy-preserving personal profile matching in mobile social networks2011
- A Secure Handshake Scheme with Symptoms-Matching for mHealthcare Social NetworkMobile Networks and Applications, 2010
- A new analysis of the false positive rate of a Bloom filterInformation Processing Letters, 2010
- PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems2010
- SMILE2009
- We saw each other on the subway2009
- On the false-positive rate of Bloom filtersInformation Processing Letters, 2008
- Distributed Private Matching and Set Operations2007
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970