{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:59Z","timestamp":1750306079477,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T00:00:00Z","timestamp":1499644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-14-1-0193"],"award-info":[{"award-number":["FA9550-14-1-0193"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UK National Cyber Security Center"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1418255, CCF-1535900, CNS-1618391, CCF-1018388, CCF-1526406"],"award-info":[{"award-number":["DMS-1418255, CCF-1535900, CNS-1618391, CCF-1018388, CCF-1526406"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,10]]},"DOI":"10.1145\/3084041.3084056","type":"proceedings-article","created":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T12:20:18Z","timestamp":1500294018000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Mobile r-gather"],"prefix":"10.1145","author":[{"given":"Jiemin","family":"Zeng","sequence":"first","affiliation":[{"name":"Department of Computer Science, Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurish","family":"Telang","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Lehman College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rik","family":"Sarkar","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Gao","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther M.","family":"Arkin","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022630.1022643"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142374"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000064"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/090752699"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.040"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/850987.855687"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/876883.879900"},{"key":"e_1_3_2_1_9_1","volume-title":"On locational privacy, and how to avoid losing it forever. EFF whitepaper, https:\/\/www.eff.org\/files\/eff-locational-privacy.pdf","author":"Blumberg A. J.","year":"2009","unstructured":"A. J. Blumberg and P. Eckersley . On locational privacy, and how to avoid losing it forever. EFF whitepaper, https:\/\/www.eff.org\/files\/eff-locational-privacy.pdf , 2009 . A. J. Blumberg and P. Eckersley. On locational privacy, and how to avoid losing it forever. EFF whitepaper, https:\/\/www.eff.org\/files\/eff-locational-privacy.pdf, 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497446"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013941929408"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784462.1784477"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2031331.2031335"},{"key":"e_1_3_2_1_15_1","unstructured":"E. Demaine. Lecture notes of Algorithmic Lower Bounds: Fun with Hardness Proofs.  E. Demaine. Lecture notes of Algorithmic Lower Bounds: Fun with Hardness Proofs."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796379"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2925-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066116.1189037"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011677"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.622910"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952185"},{"key":"e_1_3_2_1_22_1","first-page":"763","volume-title":"Proceedings of the 32Nd International Conference on Very Large Data Bases, VLDB '06","author":"Mokbel M. F.","year":"2006","unstructured":"M. F. Mokbel , C.-Y. Chow , and W. G. Aref . The new casper: Query processing for location services without compromising privacy . In Proceedings of the 32Nd International Conference on Very Large Data Bases, VLDB '06 , pages 763 -- 774 . VLDB Endowment , 2006 . M. F. Mokbel, C.-Y. Chow, and W. G. Aref. The new casper: Query processing for location services without compromising privacy. In Proceedings of the 32Nd International Conference on Very Large Data Bases, VLDB '06, pages 763--774. VLDB Endowment, 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653808"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721850"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2012.6155874"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341012.1341062"},{"key":"e_1_3_2_1_28_1","first-page":"2008","volume-title":"INFOCOM 2008. The 27th Conference on Computer Communications. IEEE","author":"Xu T.","unstructured":"T. Xu and Y. Cai . Exploring historical location data for anonymity preservation in location-based services . In INFOCOM 2008. The 27th Conference on Computer Communications. IEEE , pages --, April 2008 . T. Xu and Y. Cai. Exploring historical location data for anonymity preservation in location-based services. In INFOCOM 2008. The 27th Conference on Computer Communications. IEEE, pages --, April 2008."}],"event":{"name":"Mobihoc '17: The Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Chennai India","acronym":"Mobihoc '17"},"container-title":["Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084041.3084056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3084041.3084056","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3084041.3084056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:08Z","timestamp":1750217408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084041.3084056"}},"subtitle":["Distributed and Geographic Clustering for Location Anonymity"],"short-title":[],"issued":{"date-parts":[[2017,7,10]]},"references-count":27,"alternative-id":["10.1145\/3084041.3084056","10.1145\/3084041"],"URL":"https:\/\/doi.org\/10.1145\/3084041.3084056","relation":{},"subject":[],"published":{"date-parts":[[2017,7,10]]},"assertion":[{"value":"2017-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}