{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:43:06Z","timestamp":1774946586396,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,16]],"date-time":"2012-12-16T00:00:00Z","timestamp":1355616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10207-012-0183-4","type":"journal-article","created":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T06:50:07Z","timestamp":1355554207000},"page":"49-65","source":"Crossref","is-referenced-by-count":17,"title":["Private discovery of common social contacts"],"prefix":"10.1007","volume":"12","author":[{"given":"Emiliano","family":"De Cristofaro","sequence":"first","affiliation":[]},{"given":"Mark","family":"Manulis","sequence":"additional","affiliation":[]},{"given":"Bertram","family":"Poettering","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,16]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: Size-hiding private set intersection. In: D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi (eds.) PKC 2011: 14th International Workshop on Theory and Practice in Public Key Cryptography, vol. 6571 of Lecture Notes in Computer Science, pp. 156\u2013173. Taormina, Italy, March 6\u20139. Springer, Germany, Berlin (2011)","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"183_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09527-0","volume-title":"Protocols for Authentication and Key Establishment","author":"C Boyd","year":"2003","unstructured":"Boyd, C., Mathuria, A.: Protocols for Authentication and Key Establishment. Springer, Berlin (2003)"},{"key":"183_CR3","unstructured":"Chapman, P., Evans, D., Huang, Y., Koo, S.: Common Contacts\u2013Privacy-preserving shared contact computation. http:\/\/www.mightbeevil.com\/contacts\/"},{"key":"183_CR4","doi-asserted-by":"crossref","unstructured":"Chiou, S.-Y., Chang, S.-Y., Sun, H.-M.: Common friends discovery with privacy and authenticity. In: IAS, pp. 337\u2013340. IEEE Computer Society (2009)","DOI":"10.1109\/IAS.2009.208"},{"key":"183_CR5","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 09: 7th International Conference on Applied Cryptography and Network Security, vol. 5536 of Lecture Notes in Computer Science, pp. 125\u2013142. Paris-Rocquencourt, France, June 2\u20135. Springer, Germany, Berlin (2009)","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"183_CR6","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Berlin (2004)"},{"key":"183_CR7","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) Advances in Cryptology\u2013ASIACRYPT, vol. 6477 of Lecture Notes in Computer Science, pp. 213\u2013231. Singapore, December 5\u20139. Springer, Germany, Berlin (2010)","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"183_CR8","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Manulis, M., Poettering, B.: Private discovery of common social contacts. In: Lopez, J., Tsudik, G. (eds.) ACNS 11: 9th International Conference on Applied Cryptography and Network Security, vol. 6715 of Lecture Notes in Computer Science, pp. 147\u2013165, Nerja, Spain, June 7\u201310. Springer, Germany, Berlin (2011)","DOI":"10.1007\/978-3-642-21554-4_9"},{"key":"183_CR9","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.), FC 2010: 14th International Conference on Financial Cryptography and Data Security, vol. 6052 of Lecture Notes in Computer Science, pp. 143\u2013159. Tenerife, Canary Islands, Spain, January 25\u201328. Springer, Germany, Berlin (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"183_CR10","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-preserving policy-based information transfer. In: Goldberg, I., Atallah, M.J. (eds.) Privacy Enhancing Technologies, vol. 5672 of Lecture Notes in Computer Science, pp. 164\u2013184. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03168-7_10"},{"key":"183_CR11","unstructured":"Diehl, C.P., Namata, G., Getoor, L.: Relationship identification for social network discovery. In: AAAI, pp. 546\u2013552. AAAI Press (2007)"},{"issue":"4","key":"183_CR12","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/49.17711","volume":"7","author":"E Okamoto","year":"1989","unstructured":"Okamoto, E., Tanaka, K.: Key distribution system based on identification information. IEEE J. Sel. Areas Commun. 7(4), 481\u2013485 (1989)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"183_CR13","unstructured":"Emerson, R.: Huffingtonpost: Facebook Users Expected To Pass 1 Billion In August 2012. http:\/\/www.huffingtonpost.com\/2012\/01\/13\/facebook-users-1-billion-icrossing_n_1204948.html , July 2012"},{"key":"183_CR14","unstructured":"Free Software Foundation. The GNU MP Bignum Library. http:\/\/gmplib.org\/"},{"key":"183_CR15","volume-title":"Efficient private techniques for verifying social proximity","author":"MJ Freedman","year":"2007","unstructured":"Freedman, M.J., Nicolosi, A.: Efficient private techniques for verifying social proximity. IPTPS, In (2007)"},{"key":"183_CR16","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology\u2013EUROCRYPT 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 1\u201319. Interlaken, Switzerland, May 2\u20136. Springer, Germany, Berlin (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"183_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: Okamoto-Tanaka revisited: Fully authenticated Diffie-Hellman with minimal overhead. Cryptology ePrint Archive, Report 2010\/068, 2010. http:\/\/eprint.iacr.org\/2010\/068.pdf","DOI":"10.1007\/978-3-642-13708-2_19"},{"key":"183_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: Okamoto-Tanaka revisited: Fully authenticated Diffie-Hellman with minimal overhead. In: Zhou, J., Yung, M. (eds.) ACNS 10: 8th International Conference on Applied Cryptography and Network Security, vol. 6123 of Lecture Notes in Computer Science, pp. 309\u2013328, Beijing, China, June 22\u201325. Springer, Germany, Berlin (2010)","DOI":"10.1007\/978-3-642-13708-2_19"},{"key":"183_CR19","unstructured":"Google Inc. Google+. http:\/\/plus.google.com"},{"key":"183_CR20","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008: 5th Theory of Cryptography Conference, vol. 4948 of Lecture Notes in Computer Science, pp. 155\u2013175. San Francisco, CA, USA, March 19\u201321. Springer, Germany, Berlin (2008)","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"183_CR21","doi-asserted-by":"crossref","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010: 13th International Conference on Theory and Practice of Public Key Cryptography, vol. 6056 of Lecture Notes in Computer Science, pp. 312\u2013331. Paris, France, May 26\u201328. Springer, Germany, Berlin (2010)","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"183_CR22","unstructured":"Huang, Y., Chapman, P., Evans, D.: Privacy-preserving applications on smartphones. In: 6th USENIX Workshop on Hot Topics in, Security (2011)"},{"key":"183_CR23","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kim, J., Tsudik, G.: Beyond secret handshakes: Affiliation-hiding authenticated key exchange. In: Tal M. (ed.), Topics in Cryptology\u2013CT-RSA 2008, vol. 4964 of Lecture Notes in Computer Science, pp. 352\u2013369. San Francisco, CA, USA, April 7\u201311. Springer, Germany, Berlin (2008)","DOI":"10.1007\/978-3-540-79263-5_23"},{"key":"183_CR24","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009: 6th Theory of Cryptography Conference, vol. 5444 of Lecture Notes in Computer Science, pp. 577\u2013594. Springer, Berlin, Germany, March 15\u201317, 2009"},{"key":"183_CR25","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 10: 7th International Conference on Security in Communication Networks, vol. 6280 of Lecture Notes in Computer Science, pp. 418\u2013435. Amalfi, Italy, September 13\u201315. Springer, Germany, Berlin (2010)"},{"key":"183_CR26","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) Advances in Cryptology\u2013CRYPTO 2005, vol. 3621 of Lecture Notes in Computer Science, pp. 241\u2013257, Santa Barbara, CA, USA, August 14\u201318. Springer, Germany, Berlin (2005)","DOI":"10.1007\/11535218_15"},{"key":"183_CR27","doi-asserted-by":"crossref","unstructured":"Korolova, A., Motwani, R., Nabar, S.U., Xu, Y.: Link privacy in social networks. In: ICDE, pp. 1355\u20131357. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497554"},{"key":"183_CR28","doi-asserted-by":"crossref","unstructured":"Korolova, A., Motwani, R., Nabar, S.U., Xu, Y.: Link privacy in social networks. In: Shanahan, J.G., Amer-Yahia, S., Manolescu, I., Zhang, Y., Evans, D.A., Kolcz, A., Choi, K.-S., Chowdhury, A. (eds.) CIKM, pp. 289\u2013298. ACM (2008)","DOI":"10.1145\/1458082.1458123"},{"key":"183_CR29","doi-asserted-by":"crossref","unstructured":"Krawczyk, H.: SIGMA: The \u201cSIGn-and-MAc\u201d approach to authenticated Diffie-Hellman and its use in the IKE protocols. In: Boneh, D. (ed.), Advances in Cryptology\u2014CRYPTO 2003, vol. 2729 of Lecture Notes in Computer Science, pp. 400\u2013425, Santa Barbara, CA, USA, August 17\u201321. Springer. Germany, Berlin (2003)","DOI":"10.1007\/978-3-540-45146-4_24"},{"key":"183_CR30","unstructured":"LinkedIn. Press center - about us. http:\/\/press.linkedin.com\/about , July 2012"},{"key":"183_CR31","doi-asserted-by":"crossref","unstructured":"Manulis, M., Pinkas, B., Poettering, B.: Privacy-preserving group discovery with linear complexity. In: Zhou, J., Yung, M. (eds.) ACNS 10: 8th International Conference on Applied Cryptography and Network Security, vol. 6123 of Lecture Notes in Computer Science, pp. 420\u2013437, Beijing, China, June 22\u201325. Springer, Germany, Berlin (2010)","DOI":"10.1007\/978-3-642-13708-2_25"},{"key":"183_CR32","doi-asserted-by":"crossref","unstructured":"Manulis, M., Poettering, B., Tsudik, G.: Taming big brother ambitions: More privacy for secret handshakes. In Atallah, M.J., Hopper, N.J. (eds) Privacy Enhancing Technologies, vol. 6205 of Lecture Notes in Computer Science, pp. 149\u2013165. Springer (2010)","DOI":"10.1007\/978-3-642-14527-8_9"},{"key":"183_CR33","doi-asserted-by":"crossref","unstructured":"Manulis, M., Poettering, B.: Practical affiliation-hiding authentication from improved polynomial interpolation. In: ASIACCS, pp. 286\u2013295 (2011)","DOI":"10.1145\/1966913.1966950"},{"key":"183_CR34","doi-asserted-by":"crossref","unstructured":"Schatzman, M.: Numerical Analysis: A Mathematical Introduction. Clarendon Press, Oxford (2002)","DOI":"10.1093\/oso\/9780198502791.001.0001"},{"issue":"2","key":"183_CR35","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s00145-002-0038-7","volume":"16","author":"O Goldreich","year":"2003","unstructured":"Goldreich, O., Rosen, V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptol. 16(2), 71\u201393 (2003)","journal-title":"J. Cryptol."},{"key":"183_CR36","doi-asserted-by":"crossref","unstructured":"Okamoto, E.: Key distribution systems based on identification information. In: Pomerance, C. (ed.) Advances in Cryptology\u2014CRYPTO \u201987, vol. 293 of Lecture Notes in Computer Science, pp. 194\u2013202, Santa Barbara, CA, USA, August 16\u201320. Springer, Germany, Berlin (1988)","DOI":"10.1007\/3-540-48184-2_15"},{"issue":"2","key":"183_CR37","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2), 191\u2013218 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"183_CR38","unstructured":"Poettering, B.: Privacy protection for authentication protocols. PhD thesis 2012. http:\/\/tuprints.ulb.tu-darmstadt.de\/2867"},{"key":"183_CR39","doi-asserted-by":"crossref","unstructured":"von Arb, M., Bader, M., Kuhn, M., Wattenhofer, R.: Veneta: Serverless friend-of-friend detection in mobile social networking. In: WiMob, pp. 184\u2013189. IEEE (2008)","DOI":"10.1109\/WiMob.2008.52"},{"key":"183_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"183_CR41","volume-title":"Link Mining: Models, Algorithms, and Applications","author":"PS Yu","year":"2010","unstructured":"Yu, P.S., Han, J., Faloutsos, C.: Link Mining: Models, Algorithms, and Applications. Springer, Berlin (2010)"},{"key":"183_CR42","doi-asserted-by":"crossref","unstructured":"Zhelevam, E., Getoor, L., Golbeck, J., Kuter, U.: Using friendship ties and family circles for link prediction. In: Giles, C.L., Smith, M., Yen, J., Zhang, H. (eds.) SNAKDD, vol. 5498 of Lecture Notes in Computer Science, pp. 97\u2013113. Springer (2008)","DOI":"10.1007\/978-3-642-14929-0_6"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0183-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-012-0183-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0183-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T10:54:39Z","timestamp":1714733679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-012-0183-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,16]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s10207-012-0183-4","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,16]]}}}