Approximate two-party privacy-preserving string matching with linear complexity

Proceedings - 2013 IEEE International Congress on Big Data, BigData 2013

Volumn , Issue , 2013, Pages 31-37

  Beck, Martin ^a   Kerschbaum, Florian ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

approximate string matching; homomorphic encryption; linear complexity; privacy preserving string comparison; variable length grams

Indexed keywords

APPROXIMATE STRING MATCHING; HO-MOMORPHIC ENCRYPTIONS; LINEAR COMPLEXITY; STRING COMPARISON; VARIABLE LENGTH;

EID: 84886073705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BigData.Congress.2013.14     Document Type: Conference Paper

References (25)

1. S. Anderson, A. T. Bankier, B. G. Barrell, M. H. L. de Bruijn, A. R. Coulson, J. Drouin, I. C. Eperon, D. P. Nierlich, B. A. Roe, F. Sanger, P. H. Schreier, A. J. H. Smith, R. Staden, and I. G. Young. Sequence and organization of the human mitochondrial genome. Nature, 290(5806):457-465, April 1981. ISSN 0028-0836.
2. Tobias Bachteler and Rainer Schnell. An empirical comparison of approaches to approximate string matching in private record linkage. Proceedings of Statistics Canada, 2010.
3. Pierre Baldi, Roberta Baronio, Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pages 691-702, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0948-6.
4. Steven M. Bellovin, Steven M Bellovin, and William R Cheswick. Privacy-Enhanced Searches Using Encrypted Bloom Filters, 2004.
5. Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik. Fast and Private Computation of Cardinality of Set Intersection and Union. Cryptology ePrint Archive, Report 2011/141, pages 1-19, 2011.
6. Jane Gitschier. Inferential genotyping of Y chromosomes in Latter-Day Saints founders and comparison to Utah samples in the HapMap project. American journal of human genetics, 84(2):251-8, February 2009. ISSN 1537-6605.
7. Michael T. Goodrich. The Mastermind Attack on Genomic Data. In 2009 30th IEEE Symposium on Security and Privacy, pages 204-218. IEEE, May 2009. ISBN 978-0-7695-3633-0.
8. Luis Gravano, Panagiotis G. Ipeirotis, Hosagrahar Visvesvaraya Jagadish, Nick Koudas, Shanmugauelayut Muthukrishnan, and Divesh Srivastava. Approximate String Joins in a Database (Almost) for Free. Proceedings of the 27th International Conference on Very Large Data Bases, pages 491-500, September 2001.
9. M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y. Erlich. Identifying Personal Genomes by Surname Inference. Science, 339(6117):321-324, January 2013. ISSN 0036-8075.
10. Patrick A. V. Hall and Geoff R. Dowling. Approximate String Matching. ACM Computing Surveys, 12(4):381-402, December 1980. ISSN 03600300.
11. Richard Wesley Hamming. Error-Detecting and Error-Correcting Codes. Bell System Technical Journal, 29: 147-160, 1950.
12. Yan Huang, David Evans, and Jonathan Katz. Faster secure two-party computation using garbled circuits. USENIX Security Symposium, 2011.
13. Yan Huang, David Evans, and Jonathan Katz. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? NDSS, 2012.
14. Max Ingman and U Gyllensten. mtDB: Human Mitochondrial Genome Database, a resource for population genetics and medical sciences. Nucleic Acids Research, 34:749-751, 2006.
15. Somesh Jha, Louis Kruger, and Vitaly Shmatikov. Towards Practical Privacy for Genomic Computation. In 2008 IEEE Symposium on Security and Privacy (sp 2008), pages 216-230. IEEE, May 2008. ISBN 978-0-7695-3168-7.
16. Vladimir Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707, 1966.
17. Chen Li, Bin Wang, and Xiaochun Yang. VGRAM: improving performance of approximate queries on string collections using variable-length grams. In Proceedings of the 33rd international conference on Very large data bases, VLDB'07, pages 303-314, September 2007. ISBN 978-1-59593-649-3.
18. Heng Li and Nils Homer. A survey of sequence alignment algorithms for next-generation sequencing. Briefings in bioinformatics, 11(5):473-83, September 2010. ISSN 1477-4054.
19. Jeantine E Lunshof, Ruth Chadwick, Daniel B Vorhaus, and George M Church. From genetic privacy to open consent. Nature reviews. Genetics, 9(5):406-11, May 2008. ISSN 1471-0064.
20. David Naccache and Jacques Stern. A new cryptosystem based on higher residues. Proceedings of the 5th ACM conference on on computer and communication security, pages 59-66, 1998.
21. Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Advances in Cryptography-Eurocrypt '99, 1592:223-238, 1999.
22. Odysseas Papapetrou, Wolf Siberski, and Wolfgang Nejdl. Cardinality estimation and dynamic length adaptation for Bloom filters. Distributed and Parallel Databases, 28 (2-3):119-156, September 2010. ISSN 0926-8782.
23. Rainer Schnell, Tobias Bachteler, and Jörg Reiher. Privacy-preserving record linkage using Bloom filters. BMC medical informatics and decision making, 9(1):41, January 2009. ISSN 1472-6947.
24. Temple F. Smith and Michael S. Waterman. Identification of common molecular subsequences. Journal of molecular biology, 147(1):195-7, March 1981. ISSN 0022-2836.
25. Juan Ramón Troncoso-Pastoriza, Stefan Katzenbeisser, and Mehmet Celik. Privacy preserving error resilient dna searching through oblivious automata. In Proceedings of the 14th ACM conference on Computer and communications security-CCS '07, page 519, New York, New York, USA, October 2007. ACM Press. ISBN 9781595937032.