{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:08:17Z","timestamp":1763968097598},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358890"},{"type":"electronic","value":"9783642358906"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35890-6_7","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T03:45:00Z","timestamp":1357875900000},"page":"89-103","source":"Crossref","is-referenced-by-count":25,"title":["EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Blundo","sequence":"first","affiliation":[]},{"given":"Emiliano","family":"De Cristofaro","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Gasti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Atallah, M.J., Bykova, M., Li, J., Frikken, K.B., Topkara, M.: Private collaborative forecasting and benchmarking. In: WPES (2004)","DOI":"10.1145\/1029179.1029204"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baglioni, E., Becchetti, L., Bergamini, L., Colesanti, U., Filipponi, L., Vitaletti, A., Persiano, G.: A lightweight privacy preserving sms-based recommendation system for mobile users. In: RecSys (2010)","DOI":"10.1145\/1864708.1864745"},{"key":"7_CR3","unstructured":"Blundo, C., De Cristofaro, E., Gasti, P.: EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity, Extended Version (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1111.5062"},{"key":"7_CR4","unstructured":"Broder, A.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences (1997)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations. In: STOC (1998)","DOI":"10.1145\/276698.276781"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bunn, P., Ostrovsky, R.: Secure two-party k-means clustering. In: CCS (2007)","DOI":"10.1145\/1315245.1315306"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics (1952)","DOI":"10.1214\/aoms\/1177729330"},{"key":"7_CR8","unstructured":"Cornell Univ. KDDCUP Dataset, \n                    \n                      http:\/\/www.cs.cornell.edu\/projects\/kddcup\/datasets.html"},{"key":"7_CR9","unstructured":"Davies, K.: The $1,000 genome: the revolution in DNA sequencing and the new era of Personalized Medicine. Free Press (2010)"},{"key":"7_CR10","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and Private Computation of Set Intersection Cardinality (2012), \n                    \n                      http:\/\/eprint.iacr.org\/2011\/141"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Dombek, P., Johnson, L., Zimmerley, S., Sadowsky, M.: Use of repetitive DNA sequences and the PCR to differentiate Escherichia coli isolates from human and animal sources. Applied and Environmental Microbiology\u00a066(6) (2000)","DOI":"10.1128\/AEM.66.6.2572-2577.2000"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Fowler, J., Settle, J., Christakis, N.: Correlated genotypes in friendship networks. Proceedings of the National Academy of Sciences\u00a0108(5) (2011)","DOI":"10.1073\/pnas.1011687108"},{"key":"7_CR13","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. Freedman","year":"2004","unstructured":"Freedman, M., 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":"7_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography. Cambridge Univ. Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"7_CR15","unstructured":"Jaccard, P.: Etude comparative de la distribution florale dans une portion des Alpes et du Jura (1901)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, W., Murugesan, M., Clifton, C., Si, L.: Similar document detection with limited information disclosure. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497482"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-22348-8_19","volume-title":"Data and Applications Security and Privacy XXV","author":"W. Jiang","year":"2011","unstructured":"Jiang, W., Samanthula, B.K.: N-Gram Based Secure Similar Document Detection. In: Li, Y. (ed.) DBSec 2011. LNCS, vol.\u00a06818, pp. 239\u2013246. Springer, Heidelberg (2011)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Nix, R., Vaidya, J.: An efficient approximate protocol for privacy-preserving association rule mining. In: KDD (2009)","DOI":"10.1007\/978-3-642-01307-2_48"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced Private Set Intersection Using Homomorphic Encryption. In: AsiaCCS (2012)","DOI":"10.1145\/2414456.2414506"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-40061-5_27","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: Verifiable Homomorphic Oblivious Transfer and Private Equality Test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 416\u2013433. Springer, Heidelberg (2003)"},{"key":"7_CR22","unstructured":"Manber, U.: Finding similar files in a large file system. In: USENIX (1994)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Murugesan, M., Jiang, W., Clifton, C., Si, L., Vaidya, J.: Efficient privacy-preserving similar document detection. The VLDB Journal\u00a019 (August 2010)","DOI":"10.1007\/s00778-009-0175-9"},{"key":"7_CR24","unstructured":"Ookla Net Metrics. Canada and US Source Data (2011), \n                    \n                      http:\/\/www.netindex.com\/source-data\/"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","first-page":"223","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":"7_CR26","doi-asserted-by":"crossref","unstructured":"Popescu, M., Keller, J., Mitchell, J.: Fuzzy measures on the gene ontology for gene product similarity. Transactions on Computational Biology and Bioinformatics (2006)","DOI":"10.1109\/TCBB.2006.37"},{"key":"7_CR27","unstructured":"Ravikumar, P., Cohen, W., Fienberg, S.: A secure protocol for computing string distance metrics. In: PSDM (2004)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Singh, M., Krishna, P., Saxena, A.: A privacy preserving jaccard similarity function for mining encrypted data. In: TENCON (2009)","DOI":"10.1109\/TENCON.2009.5395869"},{"key":"7_CR29","unstructured":"Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In: AAAI (2000)"},{"key":"7_CR30","unstructured":"Tan, P., Steinbach, M., Kumar, V., et al.: Introduction to data mining. Pearson (2006)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4) (2005)","DOI":"10.3233\/JCS-2005-13401"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.: Efficient similarity joins for near duplicate detection. In: WWW (2008)","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management and Autonomous Spontaneous Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35890-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T11:59:18Z","timestamp":1557489558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35890-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358890","9783642358906"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35890-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}