{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:30:01Z","timestamp":1742956201272,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402029"},{"type":"electronic","value":"9783642402036"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40203-6_25","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T02:48:53Z","timestamp":1376448533000},"page":"443-462","source":"Crossref","is-referenced-by-count":2,"title":["Privacy-Preserving Matching of Community-Contributed Content"],"prefix":"10.1007","author":[{"given":"Mishari","family":"Almishari","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Gasti","sequence":"additional","affiliation":[]},{"given":"Gene","family":"Tsudik","sequence":"additional","affiliation":[]},{"given":"Ekin","family":"Oguz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Amazon, \n                    \n                      http:\/\/www.amazon.com"},{"key":"25_CR2","unstructured":"Facebook, \n                    \n                      http:\/\/www.facebook.com"},{"key":"25_CR3","unstructured":"Facebook Reports Third Quarter 2012 Results, \n                    \n                      http:\/\/investor.fb.com\/releasedetail.cfm?ReleaseID=715607"},{"key":"25_CR4","unstructured":"Google+, \n                    \n                      https:\/\/plus.google.com"},{"key":"25_CR5","unstructured":"Linkedin, \n                    \n                      http:\/\/www.linkedin.com"},{"key":"25_CR6","unstructured":"TripAdvisor, \n                    \n                      http:\/\/www.tripadvisor.com"},{"key":"25_CR7","unstructured":"Twitter, \n                    \n                      http:\/\/www.twitter.com"},{"key":"25_CR8","unstructured":"Yelp, \n                    \n                      http:\/\/www.yelp.com"},{"key":"25_CR9","unstructured":"Yelp \u2013 About Us, \n                    \n                      http:\/\/www.yelp.com\/about"},{"key":"25_CR10","unstructured":"Yelp \u2013 Terms of Service, \n                    \n                      http:\/\/www.yelp.com\/static?country=US&p=tos"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Abbasi, A., Chen, H.: Writeprints: A Stylometric Approach to Identity-Level Identification and Similarity Detection in Cyberspace. ACM Transactions on Information Systems (2008)","DOI":"10.1145\/1344411.1344413"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-33167-1_18","volume-title":"Computer Security \u2013 ESORICS 2012","author":"M. Almishari","year":"2012","unstructured":"Almishari, M., Tsudik, G.: Exploring linkability of user reviews. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol.\u00a07459, pp. 307\u2013324. Springer, Heidelberg (2012)"},{"key":"25_CR13","unstructured":"Baeza-Yates, R.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc. (1999)"},{"key":"25_CR14","unstructured":"Bishop, C.: Pattern Recognition and Machine Learning. Springer (2006)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-23822-2_11","volume-title":"Computer Security \u2013 ESORICS 2011","author":"M. Blanton","year":"2011","unstructured":"Blanton, M., Gasti, P.: Secure and efficient protocols for iris and fingerprint identification. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol.\u00a06879, pp. 190\u2013209. Springer, Heidelberg (2011)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-35890-6_7","volume-title":"Data Privacy Management and Autonomous Spontaneous Security","author":"C. Blundo","year":"2013","unstructured":"Blundo, C., De Cristofaro, E., Gasti, P.: EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity. In: Di Pietro, R., Herranz, J., Damiani, E., State, R. (eds.) DPM 2012 and SETOP 2012. LNCS, vol.\u00a07731, pp. 89\u2013103. Springer, Heidelberg (2013)"},{"key":"25_CR17","unstructured":"Border, A.: On the resemblance and containment of documents. Compression and Complexity of Sequences (1997)"},{"key":"25_CR18","unstructured":"Brennan, M., Greenstadt, R.: Practical Attacks Against Authorship Recognition Techniques. In: IAAI (2009)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-28914-9_3","volume-title":"Theory of Cryptography","author":"S.G. Choi","year":"2012","unstructured":"Choi, S.G., Katz, J., Kumaresan, R., Zhou, H.-S.: On the security of the \u201cFree-XOR\u201d technique. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 39\u201353. Springer, Heidelberg (2012)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E. Cristofaro De","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and Private Computation of Cardinality of Set Intersection and Union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol.\u00a07712, pp. 218\u2013231. Springer, Heidelberg (2012)"},{"key":"25_CR22","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8ig\u00e5rd, M.: A correction to efficient and secure comparison for on-line auctions. Cryptology ePrint Archive, Report 2008\/321 (2008)"},{"issue":"1","key":"25_CR23","first-page":"22","volume":"1","author":"I. Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8ig\u00e5rd, M.: Homomorphic encryption and secure comparison. Journal of Applied Cryptology\u00a01(1), 22\u201331 (2008)","journal-title":"Journal of Applied Cryptology"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: Theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 160\u2013179. Springer, Heidelberg (2009)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","volume-title":"Privacy Enhancing Technologies","author":"Z. Erkin","year":"2009","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 235\u2013253. Springer, Heidelberg (2009)"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: ACM Symposium on Theory of Computing, STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C. Hazay","year":"2008","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. LNCS, vol.\u00a04948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-13013-7_19","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Nissim, K.: Efficient Set Operations in the Presence of Malicious Adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 312\u2013331. Springer, Heidelberg (2010)"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Henecka, W., Kogl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: TASTY: Tool for Automating Secure Two-partY computations. In: ACM Conference on Computer and Communications Security, CCS, pp. 451\u2013462 (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"25_CR32","unstructured":"Iqbal, F., Binsalleeh, H., Fung, B., Debbabi, M.: A unified data mining solution for authorship analysis in anonymous textual communications. In: Information Sciences (INS): Special Issue on Data Mining for Information Security (2011)"},{"key":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"25_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"S. Jarecki","year":"2010","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol.\u00a06280, pp. 418\u2013435. Springer, Heidelberg (2010)"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"Jindal, N., Liu, B.: Opinion Spam and Analysis. In: ACM International Conference on Web Search and Data Mining (2008)","DOI":"10.1145\/1341531.1341560"},{"key":"25_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"25_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","volume-title":"Cryptology and Network Security","author":"V. Kolesnikov","year":"2009","unstructured":"Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 1\u201320. Springer, Heidelberg (2009)"},{"key":"25_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V. Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 486\u2013498. Springer, Heidelberg (2008)"},{"key":"25_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BFb0026666","volume-title":"Machine Learning: ECML-98","author":"D.D. Lewis","year":"1998","unstructured":"Lewis, D.D.: Naive(bayes) at forty:the independence assumption in information retrieval. In: N\u00e9dellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol.\u00a01398, pp. 4\u201315. Springer, Heidelberg (1998)"},{"key":"25_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-29101-2_19","volume-title":"Information Security Practice and Experience","author":"M. Liedel","year":"2012","unstructured":"Liedel, M.: Secure distributed computation of the square root and applications. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol.\u00a07232, pp. 277\u2013288. Springer, Heidelberg (2012)"},{"key":"25_CR41","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: USENIX Security Symposium, pp. 287\u2013302 (2004)"},{"key":"25_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-31680-7_16","volume-title":"Privacy Enhancing Technologies","author":"A.W.E. McDonald","year":"2012","unstructured":"McDonald, A.W.E., Afroz, S., Caliskan, A., Stolerman, A., Greenstadt, R.: Use Fewer Instances of the Letter \u201di\u201d: Toward Writing Style Anonymization. In: Fischer-H\u00fcbner, S., Wright, M. (eds.) PETS 2012. LNCS, vol.\u00a07384, pp. 299\u2013318. Springer, Heidelberg (2012)"},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Paskov, H., Gong, N., Bethencourt, J., Stefanov, E., Shin, E., Song, D.: On the Feasibility of Internet-Scale Author Identification. In: IEEE Symposium on Security and Privacy (2012)","DOI":"10.1109\/SP.2012.46"},{"key":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"25_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B. Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 250\u2013267. Springer, Heidelberg (2009)"},{"key":"25_CR46","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: ACM Symposium on Theory of Computing, STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"25_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-14423-3_16","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"A.-R. Sadeghi","year":"2010","unstructured":"Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: Efficient privacy-preserving face recognition. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 229\u2013244. Springer, Heidelberg (2010)"},{"key":"25_CR48","doi-asserted-by":"crossref","unstructured":"Stamatatos, E.: A Survey of Modern Authorship Attribution Methods. Journal of the American Society for Information Science and Technology (2009)","DOI":"10.1002\/asi.21001"},{"key":"25_CR49","unstructured":"Tan, P., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley (2005)"},{"key":"25_CR50","doi-asserted-by":"crossref","unstructured":"Toutanova, K., Klein, D., Manning, C., Singer, Y.: Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network. In: HLT-NAACL (2003)","DOI":"10.3115\/1073445.1073478"},{"key":"25_CR51","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: IEEE Symposium on Foundations of Computer Science, FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40203-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:44:13Z","timestamp":1559508253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40203-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402029","9783642402036"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40203-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}