{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:23Z","timestamp":1750306403922,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2766498.2766501","type":"proceedings-article","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T13:03:05Z","timestamp":1435064585000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["How far removed are you?"],"prefix":"10.1145","author":[{"given":"Marcin","family":"Nagy","sequence":"first","affiliation":[{"name":"Aalto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh","family":"Bui","sequence":"additional","affiliation":[{"name":"Aalto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emiliano","family":"De Cristofaro","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Asokan","sequence":"additional","affiliation":[{"name":"Aalto University and University of Helsinki"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Ott","sequence":"additional","affiliation":[{"name":"Aalto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"TU Darmstadt\/CASED"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594368.2594374"},{"key":"e_1_3_2_1_2_1","volume-title":"Egocentric Online Social Networks: Analysis of Key Features and Prediction of Tie Strength in Facebook","author":"Arnaboldi V.","year":"2013","unstructured":"V. Arnaboldi , A. Guazzini , and A. Passarella . Egocentric Online Social Networks: Analysis of Key Features and Prediction of Tie Strength in Facebook . Elsevier Computer Communications , 36(10), 2013 . V. Arnaboldi, A. Guazzini, and A. Passarella. Egocentric Online Social Networks: Analysis of Key Features and Prediction of Tie Strength in Facebook. Elsevier Computer Communications, 36(10), 2013."},{"key":"e_1_3_2_1_3_1","volume-title":"Four Degrees of Separation. CoRR, abs\/1111.4570","author":"Backstrom L.","year":"2011","unstructured":"L. Backstrom , P. Boldi , M. Rosa , J. Ugander , and S. Vigna . Four Degrees of Separation. CoRR, abs\/1111.4570 , 2011 . L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna. Four Degrees of Separation. CoRR, abs\/1111.4570, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2632048.2632055"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2025968.2025980"},{"key":"e_1_3_2_1_9_1","volume-title":"IPTPS","author":"Freedman M. J.","year":"2007","unstructured":"M. J. Freedman and A. Nicolosi . Efficient Private Techniques for Verifying Social Proximity . In IPTPS , 2007 . M. J. Freedman and A. Nicolosi. Efficient Private Techniques for Verifying Social Proximity. In IPTPS, 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145204.2145360"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833840"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111011"},{"key":"e_1_3_2_1_14_1","volume-title":"RFC Editor","author":"Hardt D.","year":"2012","unstructured":"D. Hardt . The OAuth 2.0 authorization framework. RFC 6749 , RFC Editor , 2012 . D. Hardt. The OAuth 2.0 authorization framework. RFC 6749, RFC Editor, 2012."},{"key":"e_1_3_2_1_15_1","volume-title":"HotSec","author":"Huang Y.","year":"2011","unstructured":"Y. Huang , E. Chapman , and D. Evans . Privacy-preserving applications on smartphones . In HotSec , 2011 . Y. Huang, E. Chapman, and D. Evans. Privacy-preserving applications on smartphones. In HotSec, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374652"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046729"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348616.2348636"},{"key":"e_1_3_2_1_19_1","volume-title":"Secure Mobile Encounters. In USENIX Security Symposium","author":"Lentz M.","year":"2014","unstructured":"M. Lentz , V. Erd\u00e9lyi , P. Aditya , E. Shi , P. Druschel , and B. Bhattacharjee . SDDR: Light-Weight , Secure Mobile Encounters. In USENIX Security Symposium , 2014 . M. Lentz, V. Erd\u00e9lyi, P. Aditya, E. Shi, P. Druschel, and B. Bhattacharjee. SDDR: Light-Weight, Secure Mobile Encounters. In USENIX Security Symposium, 2014."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833657"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.37"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_13"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590337"},{"issue":"1","key":"e_1_3_2_1_26_1","first-page":"61","article-title":"The small world problem","volume":"67","author":"Milgram S.","year":"1967","unstructured":"S. Milgram . The small world problem . Psychology Today , 67 ( 1 ): 61 -- 67 , 1967 . S. Milgram. The small world problem. Psychology Today, 67(1):61--67, 1967.","journal-title":"Psychology Today"},{"key":"e_1_3_2_1_27_1","volume-title":"NDSS","author":"Mittal P.","year":"2013","unstructured":"P. Mittal , M. Wright , and N. Borisov . Pisces: Anonymous Communication Using Social Networks . In NDSS , 2013 . P. Mittal, M. Wright, and N. Borisov. Pisces: Anonymous Communication Using Social Networks. In NDSS, 2013."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41488-6_11"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"M. Nagy T. Bui E. De Cristofaro N. Asokan J. Ott and A.-R. Sadeghi. How Far Removed Are You? Scalable Privacy-Preserving Estimation of Social Path Length with Social PaL (Full Version). http:\/\/arxiv.org\/abs\/1412.2433 2015.  M. Nagy T. Bui E. De Cristofaro N. Asokan J. Ott and A.-R. Sadeghi. How Far Removed Are You? Scalable Privacy-Preserving Estimation of Social Path Length with Social PaL (Full Version). http:\/\/arxiv.org\/abs\/1412.2433 2015.","DOI":"10.1145\/2766498.2766501"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523649.2523668"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41320-9_10"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2012.6151325"},{"key":"e_1_3_2_1_33_1","volume-title":"CollSec","author":"Sirivianos M.","year":"2010","unstructured":"M. Sirivianos , K. Kim , and X. Yang . SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation . In CollSec , 2010 . M. Sirivianos, K. Kim, and X. Yang. SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation. In CollSec, 2010."},{"key":"e_1_3_2_1_34_1","unstructured":"C. Stocker. HHVM with Symfony 2 looks amazing. http:\/\/blog.liip.ch\/archive\/2013\/10\/29\/hhvm-and-symfony2.html.  C. Stocker. HHVM with Symfony 2 looks amazing. http:\/\/blog.liip.ch\/archive\/2013\/10\/29\/hhvm-and-symfony2.html."},{"key":"e_1_3_2_1_35_1","unstructured":"A. Tagliapietra. Symfony benchmark using HHVM. http:\/\/www.alexfu.it\/2013\/10\/22\/symfony-benchmark-on-hhvm.html.  A. Tagliapietra. Symfony benchmark using HHVM. http:\/\/www.alexfu.it\/2013\/10\/22\/symfony-benchmark-on-hhvm.html."},{"key":"e_1_3_2_1_36_1","volume-title":"ICDCS","author":"Tanenbaum A. S.","year":"1986","unstructured":"A. S. Tanenbaum Using Sparse Capabilities in a Distributed Operating System . In ICDCS , 1986 . A. S. Tanenbaum et al. Using Sparse Capabilities in a Distributed Operating System. In ICDCS, 1986."},{"key":"e_1_3_2_1_37_1","volume-title":"The Anatomy of the Facebook Social Graph. CoRR, abs\/1111.4503","author":"Ugander J.","year":"2011","unstructured":"J. Ugander , B. Karrer , L. Backstrom , and C. Marlow . The Anatomy of the Facebook Social Graph. CoRR, abs\/1111.4503 , 2011 . J. Ugander, B. Karrer, L. Backstrom, and C. Marlow. The Anatomy of the Facebook Social Graph. CoRR, abs\/1111.4503, 2011."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/WiMob.2008.52"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1740437.1740439"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.298"}],"event":{"name":"WiSec'15: 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","US Army Research Office US Army Research Office","NSF National Science Foundation","SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"New York New York","acronym":"WiSec'15"},"container-title":["Proceedings of the 8th ACM Conference on Security & Privacy in Wireless and Mobile Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2766498.2766501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2766498.2766501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:31Z","timestamp":1750223251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2766498.2766501"}},"subtitle":["scalable privacy-preserving estimation of social path length with Social PaL"],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":40,"alternative-id":["10.1145\/2766498.2766501","10.1145\/2766498"],"URL":"https:\/\/doi.org\/10.1145\/2766498.2766501","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}