Privacy-preserving spatiotemporal matching

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 800-808

  Sun, Jingchao ^a   Zhang, Rui ^a   Zhang, Yanchao ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; EXPLOSIVE GROWTH; LOCATION-AWARE; PERSONAL INFORMATION; PRIVACY PRESERVING; SET INTERSECTION; SIMULATION STUDIES; TRUST RELATIONSHIP;

CRYPTOGRAPHY;

EID: 84883068326     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566867     Document Type: Conference Paper

References (23)

1. Cisco visual networking index global mobile data traffic forecast update 2011-2016.
2. J. Shi, R. Zhang, Y. Liu, and Y. Zhang, PriSense: privacy-preserving data aggregation in people-centric urban sensing systems, in INFOCOM 10, San Diego, CA, Mar. 2010.
3. M. Arb, M. Bader, M. Kuhn, and R. Wattenhofer, VENETA: Serverless friend-of-friend detection in mobile social networking, in WIMOB08, Avignon, France, Oct. 2008, pp. 184-189.
4. M. Li, N. Cao, S. Yu, and W. Lou, FindU: Privacy-preserving personal profile matching in mobile social networks, in INFOCOM11, Shanghai, China, Apr. 2011.
5. R. Zhang, Y. Zhang, J. Sun, and G. Yan, Fine-grained private matching for proximity-based mobile social networking, in IEEE INFOCOM12, Orlando, FL, Mar. 2012.
6. A. Narayanan, N. Thiagarajan, M. Lakhani, M. Hamburg, and D. Boneh, Location privacy via private proximity testing, in NDSS11, San Diego, CA, Feb. 2011.
7. Z. Lin, D. Kune, and N. Hopper, Efficient private proximity testing with GSM location sketches, in FC12, Bonaire, Feb. 2012.
8. E. Cristofaro, P. Gasti, and G. Tsudik, Fast and private computation of cardinality of set intersection and union, Tech. Rep., 2011, http://eprint.iacr.org/.
9. B. Bloom, Space/time trade-offs in hash coding with allowable errors, Comm. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
10. E. Cristofaro and G. Tsudik, Practical private set intersection protocols with linear complexity, in FC10, vol. 6052, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 143-159.
11. A. Broder and M. Mitzenmacher, Network applications of bloom filters: A survey, pp. 636-646, 2002.
12. Y. Zhao and J. Wu, B-SUB: A practical bloom-filter-based publishsubscribe system for human networks, in ICDCS 10, 2010.
13. A. Kirsch and M. Mitzenmacher, Less hashing, same performance: Building a better Bloom filter, in ESA06, Zurich, Switzerland, Sept. 2006.
14. P. Dillinger and P. Manolios, Bloom filters in probabilistic verification, in FMCAD04, Austin, TX, USA, Nov. 2004.
15. M. Kodialam and T. Nandagopal, Fast and reliable estimation schemes in RFID systems, in ACM MOBICOM06, Los Angeles, CA, Sep. 2006, pp. 322-333.
16. K. Christensen, A. Roginsky, and M. Jimeno, A new analysis of the false positive rate of a bloom filter, Inf. Process. Lett., 2010.
17. P. Bose, H. Guo, E. Kranakis, A. Maheshwari, P. Morin, J. Morrison, M. Smid, and Y. Tang, On the false-positive rate of bloom filters, Inf. Process. Lett., 2008.
18. J. Manweiler, R. Scudellari, Z. Cancio, and L. Cox, We saw each other on the subway: secure, anonymous proximity-based missed connections, in HotMobile09, Santa Cruz, California, Feb. 2009.
19. J. Manweiler, R. Scudellari, and L. Cox, SMILE: encounter-based trust for mobile social services, in CCS09, Chicago, Illinois, USA, Nov. 2009, pp. 246-255.
20. R. Lu, X. Lin, X. Liang, and X. Shen, A secure handshake scheme with symptoms-matching for mhealthcare social network, Mobile Networks and Applications, pp. 1-12, 2010.
21. L. Kissner and D. Song, Privacy-preserving set operations, in CRYPTO 05, Santa Barbara, CA, Aug. 2005, pp. 241-257.
22. Q. Ye, H. Wang, and J. Pieprzyk, Distributed private matching and set operations, in ISPEC08, vol. 4991, Sydney, Australia, Apr. 2008, pp. 347-360.
23. M. Freedman, K. Nissim, and B. Pinkas, Efficient private matching and set intersection, in EUROCRYPT04, Interlaken, Switzerland, May 2004, pp. 1-19.