{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:10Z","timestamp":1750308550272,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T00:00:00Z","timestamp":1444608000000},"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,10,12]]},"DOI":"10.1145\/2808138.2808149","type":"proceedings-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T15:22:12Z","timestamp":1444144932000},"page":"121-131","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["UnLinked"],"prefix":"10.1145","author":[{"given":"Sky","family":"Faber","sequence":"first","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]},{"given":"Ronald","family":"Petrlic","sequence":"additional","affiliation":[{"name":"Commission for Data Protection, Baden-Wurttemberg, Germany"}]},{"given":"Gene","family":"Tsudik","sequence":"additional","affiliation":[{"name":"University of California Irvine, Irvine, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.759593"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2009.5350374"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0183-4"},{"key":"e_1_3_2_1_8_1","volume-title":"Practical private set intersection protocols with linear computational and bandwidth complexity. IACR Cryptology ePrint Archive","author":"De Cristofaro E.","year":"2009","unstructured":"E. De Cristofaro and G. Tsudik . Practical private set intersection protocols with linear computational and bandwidth complexity. IACR Cryptology ePrint Archive , 2009 :491, 2009. E. De Cristofaro and G. Tsudik. Practical private set intersection protocols with linear computational and bandwidth complexity. IACR Cryptology ePrint Archive, 2009:491, 2009."},{"key":"e_1_3_2_1_9_1","unstructured":"Diaspora Foundation. Webpage. https:\/\/diasporafoundation.org\/.  Diaspora Foundation. Webpage. https:\/\/diasporafoundation.org\/."},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT","author":"Freedman M.","year":"2004","unstructured":"M. Freedman , K. Nissim , and B. Pinkas . Efficient private matching and set intersection . In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004 , volume 3027 of Lecture Notes in Computer Science , pages 1 -- 19 . Springer Berlin Heidelberg , 2004. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 1--19. Springer Berlin Heidelberg, 2004."},{"key":"e_1_3_2_1_11_1","volume-title":"Pairing-based identification schemes. arXiv preprint cs\/0509056","author":"Freeman D.","year":"2005","unstructured":"D. Freeman . Pairing-based identification schemes. arXiv preprint cs\/0509056 , 2005 . D. Freeman. Pairing-based identification schemes. arXiv preprint cs\/0509056, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_13_1","volume-title":"Oct.","author":"Hardt D.","year":"2012","unstructured":"D. Hardt . The OAuth 2.0 authorization framework , Oct. 2012 . D. Hardt. The OAuth 2.0 authorization framework, Oct. 2012."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"Hazay C.","year":"2008","unstructured":"C. Hazay and Y. Lindell . Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries . In R. Canetti, editor, Theory of Cryptography , volume 4948 of Lecture Notes in Computer Science , pages 155 -- 175 . Springer Berlin Heidelberg , 2008 . C. Hazay and Y. Lindell. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In R. Canetti, editor, Theory of Cryptography, volume 4948 of Lecture Notes in Computer Science, pages 155--175. Springer Berlin Heidelberg, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_1_16_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"Jarecki S.","year":"2010","unstructured":"S. Jarecki and X. Liu . Fast secure computation of set intersection . In J. Garay and R. Prisco, editors, Security and Cryptography for Networks , volume 6280 of Lecture Notes in Computer Science , pages 418 -- 435 . Springer Berlin Heidelberg , 2010 . S. Jarecki and X. Liu. Fast secure computation of set intersection. In J. Garay and R. Prisco, editors, Security and Cryptography for Networks, volume 6280 of Lecture Notes in Computer Science, pages 418--435. Springer Berlin Heidelberg, 2010."},{"key":"e_1_3_2_1_17_1","volume-title":"January","author":"Lepinski M.","year":"2008","unstructured":"M. Lepinski and S. Kent . Additional diffie-hellman groups for use with IETF standards , January 2008 . RFC 5114. M. Lepinski and S. Kent. Additional diffie-hellman groups for use with IETF standards, January 2008. RFC 5114."},{"key":"e_1_3_2_1_18_1","unstructured":"LinkedIn Help Center. Account Restricted. Webpage Mar. 2013. https:\/\/help.linkedin.com\/app\/answers\/detail\/a_id\/1386.  LinkedIn Help Center. Account Restricted. Webpage Mar. 2013. https:\/\/help.linkedin.com\/app\/answers\/detail\/a_id\/1386."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1894302.1894335"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523649.2523668"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_25"},{"key":"e_1_3_2_1_23_1","first-page":"558","volume-title":"International Conference on Distributed Computing Systems (ICDCS)","author":"Tanenbaum A. S.","year":"1986","unstructured":"A. S. Tanenbaum , S. J. Mullender , and R. van Renesse . Using sparse capabilities in a distributed operating system . In International Conference on Distributed Computing Systems (ICDCS) , pages 558 -- 563 , 1986 . A. S. Tanenbaum, S. J. Mullender, and R. van Renesse. Using sparse capabilities in a distributed operating system. In International Conference on Distributed Computing Systems (ICDCS), pages 558--563, 1986."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WiMob.2008.52"}],"event":{"name":"CCS'15: The 22nd ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Denver Colorado USA","acronym":"CCS'15"},"container-title":["Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808138.2808149","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2808138.2808149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:45Z","timestamp":1750273425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2808138.2808149"}},"subtitle":["Private Proximity-based Off-line OSN Interaction"],"short-title":[],"issued":{"date-parts":[[2015,10,12]]},"references-count":24,"alternative-id":["10.1145\/2808138.2808149","10.1145\/2808138"],"URL":"https:\/\/doi.org\/10.1145\/2808138.2808149","relation":{},"subject":[],"published":{"date-parts":[[2015,10,12]]},"assertion":[{"value":"2015-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}