Efficient genome-wide, privacy-preserving Similar Patient Query based on private edit distance

Proceedings of the ACM Conference on Computer and Communications Security

Volumn 2015-October, Issue , 2015, Pages 492-503

  Wang, Xiao Shaun ^a   Huang, Yan ^b   Zhao, Yongan ^b   Tang, Haixu ^b   Wang, XiaoFeng ^b   Bu, Diyue ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

Edit distance; Genomic computation; Secure computation

Indexed keywords

APPROXIMATION ALGORITHMS; GENES;

EDIT DISTANCE; NETWORK CONNECTION; NEW CONSTRUCTIONS; PRIVACY PRESERVING; RESEARCH COMMUNITIES; SECURE COMPUTATION; STATE OF THE ART; SUPPORT SEARCHING;

DATA PRIVACY;

EID: 84954167566     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2810103.2813725     Document Type: Conference Paper

References (55)

1. PatientsLikeMe. https://www.patientslikeme.com. Accessed on May 8, 2015.
2. ALON, N., MATIAS, Y., AND SZEGEDY, M. The space complexity of approximating the frequency moments. In STOC (1996).
3. ALTMAN, D. G. Construction of age-related reference centiles using absolute residuals. Statistics in medicine (1993).
4. ANDONI, A., AND ONAK, K. Approximating edit distance in near-linear time. In 41st STOC (2009).
5. ATALLAH, M. J., KERSCHBAUM, F., AND DU, W. Secure and private sequence comparisons. In Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003).
6. BALDI, P., BARONIO, R., DE CRISTOFARO, E., GASTI, P., AND TSUDIK, G. Countering gattaca: efficient and secure testing of fully-sequenced human genomes. In CCS (2011).
7. BAR-YOSSEF, Z., JAYRAM, T. S., KRAUTHGAMER, R., AND KUMAR, R. Approximating edit distance efficiently. In 45th FOCS (2004).
8. BEAVER, D. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology (1991).
9. BEAVER, D. Correlated pseudorandomness and the complexity of private computations. In STOC (1996).
10. BEAVER, D. Commodity-based cryptography (extended abstract). In STOC (1997).
11. BELLARE, M., HOANG, V. T., KEELVEEDHI, S., AND ROGAWAY, P. Efficient garbling from a fixed-key blockcipher. In IEEE S & P (2013).
12. BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC (1988).
13. BLANCHETTE, M., KENT, W. J., RIEMER, C., ELNITSKI, L., SMIT, A. F., ROSKIN, K. M., BAERTSCH, R., ROSENBLOOM, K., CLAWSON, H., GREEN, E. D., ET AL. Aligning multiple genomic sequences with the threaded blockset aligner. Genome research (2004).
14. BLOOM, B. H. Space/time trade-offs in hash coding with allowable errors. Commun. ACM (1970).
15. BLUNDO, C., DE CRISTOFARO, E., AND GASTI, P. Espresso: efficient privacy-preserving evaluation of sample set similarity. Journal of Computer Security (2014).
16. BRUDNO, M., DO, C. B., COOPER, G. M., KIM, M. F., DAVYDOV, E., GREEN, E. D., SIDOW, A., BATZOGLOU, S., PROGRAM, N. C. S., ET AL. Lagan and multi-lagan: efficient tools for large-scale multiple alignment of genomic dna. Genome research (2003).
17. CHURCH, G. M. The personal genome project. Molecular Systems Biology (2005).
18. CORMODE, G., AND MUTHUKRISHNAN, S. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms (2005).
19. DAMGÅRD, I., PASTRO, V., SMART, N. P., AND ZAKARIAS, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO (2012).
20. DONG, C., CHEN, L., AND WEN, Z. When private set intersection meets big data: an efficient and scalable protocol. In CCS (2013).
21. EPPSTEIN, D., GOODRICH, M. T., UYEDA, F., AND VARGHESE, G. What's the difference?: efficient set reconciliation without prior context. In ACM SIGCOMM Computer Communication Review (2011).
22. EVANS, W. E., AND RELLING, M. V. Moving towards individualized medicine with pharmacogenomics. Nature (2004).
23. FEIGENBAUM, J., ISHAI, Y., MALKIN, T., NISSIM, K., STRAUSS, M. J., AND WRIGHT, R. N. Secure multiparty computation of approximations. In Automata, Languages and Programming. 2001.
24. FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. An approximate l1-difference algorithm for massive data streams. SIAM Journal of Computing (2002).
25. FLAJOLET, P., FUSY, É., GANDOUET, O., AND MEUNIER, F. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. DMTCS Proceedings (2008).
26. FREDERIKSEN, T. K., JAKOBSEN, T. P., NIELSEN, J. B., NORDHOLT, P. S., AND ORLANDI, C. MiniLEGO: Efficient secure two-party computation from general assumptions. In EUROCRYPT (2013).
27. GANGULY, S., AND CORMODE, G. On estimating frequency moments of data streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. 2007.
28. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. How to play any mental game or A completeness theorem for protocols with honest majority. In STOC (1987).
29. HEENEY, C., HAWKINS, N., DE VRIES, J., BODDINGTON, P., AND KAYE, J. Assessing the privacy risks of data sharing in genomics. Public health genomics (2011).
30. HUANG, Y., EVANS, D., KATZ, J., AND MALKA, L. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium (2011).
31. HUANG, Y., KATZ, J., AND EVANS, D. Quid-Pro-Quo-tocols: Strengthening semi-honest protocols with dual execution. In IEEE S & P (2012).
32. ISHAI, Y., KILIAN, J., NISSIM, K., AND PETRANK, E. Extending oblivious transfers efficiently. In CRYPTO 2003.
33. ISHAI, Y., PRABHAKARAN, M., AND SAHAI, A. Founding cryptography on oblivious transfer - efficiently. In CRYPTO (2008).
34. JAIN, A. K., DUBES, R. C., ET AL. Algorithms for clustering data. 1988.
35. JARECKI, S., AND SHMATIKOV, V. Efficient two-party secure computation on committed inputs. In EUROCRYPT (2007).
36. KOLESNIKOV, V., AND SCHNEIDER, T. Improved garbled circuit: Free XOR gates and applications. In ICALP (2008).
37. LINDELL, Y., AND PINKAS, B. Privacy preserving data mining. In CRYPTO (2000).
38. LINDELL, Y., AND PINKAS, B. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In EUROCRYPT (2007).
39. LINDELL, Y., AND PINKAS, B. A proof of security of Yao's protocol for two-party computation. Journal of Cryptology (2009).
40. LIU, C., HUANG, Y., SHI, E., KATZ, J., AND HICKS, M. W. Automating efficient RAM-model secure computation. In IEEE S & P (2014).
41. MALKHI, D., NISAN, N., PINKAS, B., AND SELLA, Y. Fairplay - a secure two-party computation system. In USENIX Security Symposium (2004).
42. NAOR, M., AND PINKAS, B. Efficient oblivious transfer protocols. In SODA (2001).
43. NELSON, J., AND WOODRUFF, D. P. Fast manhattan sketches in data streams. In PODS (2010).
44. NETWORK, C. G. A., ET AL. Comprehensive molecular portraits of human breast tumours. Nature (2012).
45. NIELSEN, J. B., NORDHOLT, P. S., ORLANDI, C., AND BURRA, S. S. A new approach to practical active-secure two-party computation. In CRYPTO (2012).
46. PINKAS, B., SCHNEIDER, T., SMART, N. P., AND WILLIAMS, S. C. Secure two-party computation is practical. In ASIACRYPT (2009).
47. SHERRY, S. T., WARD, M.-H., KHOLODOV, M., BAKER, J., PHAN, L., SMIGIELSKI, E. M., AND SIROTKIN, K. dbsnp: the ncbi database of genetic variation. Nucleic acids research (2001).
48. SWAMIDASS, S. J., AND BALDI, P. Mathematical correction for fingerprint similarity measures to improve chemical retrieval. Journal of chemical information and modeling (2007).
49. TAYLOR, J. G., CHOI, E.-H., FOSTER, C. B., AND CHANOCK, S. J. Using genetic variation to study human disease. Trends in molecular medicine (2001).
50. THORUP, M., AND ZHANG, Y. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA (2004).
51. WADDELL, N., PAJIC, M., PATCH, A.-M., CHANG, D. K., KASSAHN, K. S., BAILEY, P., JOHNS, A. L., MILLER, D., NONES, K., QUEK, K., ET AL. Whole genomes redefine the mutational landscape of pancreatic cancer. Nature (2015).
52. WATSON, M. Illuminating the future of dna sequencing. Genome Biol (2014).
53. YAO, A. C.-C. Protocols for secure computations (extended abstract). In FOCS (1982).
54. YAO, A. C.-C. How to generate and exchange secrets (extended abstract). In FOCS (1986).
55. ZAHUR, S., ROSULEK, M., AND EVANS, D. Two halves make a whole - reducing data transfer in garbled circuits using half gates. In EUROCRYPT (2015).