{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:16:55Z","timestamp":1787012215448,"version":"build-2736575974"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/infcom.2013.6566867","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T16:12:57Z","timestamp":1375373577000},"page":"800-808","source":"Crossref","is-referenced-by-count":25,"title":["Privacy-preserving spatiotemporal matching"],"prefix":"10.1109","author":[{"given":"Jingchao","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653692"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79104-1_25"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"23","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"EUROCRYPT04 Interlaken Switzerland"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1514411.1514412"},{"key":"15","first-page":"322","article-title":"Fast and reliable estimation schemes in RFID systems","author":"kodialam","year":"2006","journal-title":"ACM MOBICOM06 Los Angeles CA"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.024"},{"key":"13","article-title":"Less hashing, same performance: Building a better Bloom filter","author":"kirsch","year":"2006","journal-title":"ESA06 Zurich Switzerland"},{"key":"14","article-title":"Bloom filters in probabilistic verification","author":"dillinger","year":"2004","journal-title":"FMCAD04 Austin TX USA"},{"key":"11","first-page":"636","author":"broder","year":"2002","journal-title":"Network applications of Bloom filters A survey"},{"key":"12","article-title":"B-SUB: A practical bloom-filter-based publishsubscribe system for human networks","volume":"10","author":"zhao","year":"2010","journal-title":"ICDCS"},{"key":"21","first-page":"241","article-title":"Privacy-preserving set operations","author":"kissner","year":"2005","journal-title":"CRYPTO 05 Santa Barbara CA"},{"key":"3","first-page":"184","article-title":"VENETA: Serverless friend-of-friend detection in mobile social networking","author":"arb","year":"2008","journal-title":"WIMOB08 Avignon France"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-010-0274-2"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462147"},{"key":"1","first-page":"2016","year":"2011","journal-title":"Cisco Visual Networking Index Global Mobile Data Traffic Forecast Update"},{"key":"10","first-page":"143","article-title":"Practical private set intersection protocols with linear complexity","author":"cristofaro","year":"2010","journal-title":"FC10 6052 Tenerife Canary Islands"},{"key":"7","article-title":"Efficient private proximity testing with GSM location sketches","author":"lin","year":"2012","journal-title":"FC12 Bonaire"},{"key":"6","article-title":"Location privacy via private proximity testing","volume":"11","author":"narayanan","year":"2011","journal-title":"NDSS"},{"key":"5","article-title":"Fine-grained private matching for proximity-based mobile social networking","volume":"12","author":"zhang","year":"2012","journal-title":"IEEE INFOCOM"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"8","article-title":"Fast and private computation of cardinality of set intersection and union","author":"cristofaro","year":"2011","journal-title":"Tech Rep"}],"event":{"name":"IEEE INFOCOM 2013 - IEEE Conference on Computer Communications","location":"Turin, Italy","start":{"date-parts":[[2013,4,14]]},"end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6556116\/6566708\/06566867.pdf?arnumber=6566867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T17:42:18Z","timestamp":1490204538000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6566867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/infcom.2013.6566867","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}