EsPRESSo: Efficient privacy-preserving evaluation of sample set similarity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7731 LNCS, Issue , 2013, Pages 89-103

  Blundo, Carlo ^a   De Cristofaro, Emiliano ^b   Gasti, Paolo ^c  

^a UNIVERSITY OF SALERNO   (Italy)

^b PARC ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMETRIC AUTHENTICATION; CRYPTOGRAPHIC TECHNIQUES; DIGITAL SOCIETY; DOCUMENT SIMILARITY; ELECTRONIC INFORMATION; GENETIC TESTS; INFORMATION SET; INFORMATION SHARING; JACCARD INDEX; MULTIMEDIA FILES; PRIVACY CONCERNS; PRIVACY PRESERVING; RESEARCH COMMUNITIES; SAMPLE SETS; SIMILARITY INDICES;

BIOMETRICS;

DATA PRIVACY;

EID: 84872732449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35890-6_7     Document Type: Conference Paper

References (32)

1. Atallah, M.J., Bykova, M., Li, J., Frikken, K.B., Topkara, M.: Private collaborative forecasting and benchmarking. In: WPES (2004)
2. 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)
3. Blundo, C., De Cristofaro, E., Gasti, P.: EsPRESSo: Efficient Privacy-Preserving Evaluation of Sample Set Similarity, Extended Version (2012), http://arxiv.org/abs/1111.5062
4. Broder, A.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences (1997)
5. Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations. In: STOC (1998)
6. Bunn, P., Ostrovsky, R.: Secure two-party k-means clustering. In: CCS (2007)
7. Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics (1952)
8. Cornell Univ. KDDCUP Dataset, http://www.cs.cornell.edu/projects/kddcup/ datasets.html
9. Davies, K.: The $1,000 genome: the revolution in DNA sequencing and the new era of Personalized Medicine. Free Press (2010)
10. De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and Private Computation of Set Intersection Cardinality (2012), http://eprint.iacr.org/2011/141
11. 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 66(6) (2000)
12. Fowler, J., Settle, J., Christakis, N.: Correlated genotypes in friendship networks. Proceedings of the National Academy of Sciences 108(5) (2011)
13. Freedman, M., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
14. Goldreich, O.: Foundations of cryptography. Cambridge Univ. Press (2004)
15. Jaccard, P.: Etude comparative de la distribution florale dans une portion des Alpes et du Jura (1901)
16. Jiang, W., Murugesan, M., Clifton, C., Si, L.: Similar document detection with limited information disclosure. In: ICDE (2008)
17. Jiang, W., Samanthula, B.K.: N-Gram Based Secure Similar Document Detection. In: Li, Y. (ed.) DBSec 2011. LNCS, vol. 6818, pp. 239-246. Springer, Heidelberg (2011)
18. Kantarcioglu, M., Nix, R., Vaidya, J.: An efficient approximate protocol for privacy-preserving association rule mining. In: KDD (2009)
19. Kerschbaum, F.: Outsourced Private Set Intersection Using Homomorphic Encryption. In: AsiaCCS (2012)
20. Kissner, L., Song, D.: Privacy-Preserving Set Operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241-257. Springer, Heidelberg (2005)
21. Lipmaa, H.: Verifiable Homomorphic Oblivious Transfer and Private Equality Test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 416-433. Springer, Heidelberg (2003)
22. Manber, U.: Finding similar files in a large file system. In: USENIX (1994)
23. Murugesan, M., Jiang, W., Clifton, C., Si, L., Vaidya, J.: Efficient privacy-preserving similar document detection. The VLDB Journal 19 (August 2010)
24. Ookla Net Metrics. Canada and US Source Data (2011), http://www.netindex. com/source-data/
25. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
26. Popescu, M., Keller, J., Mitchell, J.: Fuzzy measures on the gene ontology for gene product similarity. Transactions on Computational Biology and Bioinformatics (2006)
27. Ravikumar, P., Cohen, W., Fienberg, S.: A secure protocol for computing string distance metrics. In: PSDM (2004)
28. Singh, M., Krishna, P., Saxena, A.: A privacy preserving jaccard similarity function for mining encrypted data. In: TENCON (2009)
29. Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In: AAAI (2000)
30. Tan, P., Steinbach, M., Kumar, V., et al.: Introduction to data mining. Pearson (2006)
31. Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13(4) (2005)
32. Xiao, C., Wang, W., Lin, X., Yu, J.: Efficient similarity joins for near duplicate detection. In: WWW(2008)