Secure pattern matching using somewhat homomorphic encryption

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 65-76

  Yasuda, Masaya ^a   Shimoyama, Takeshi ^a   Kogure, Jun ^a   Yokoyama, Kazuhiro ^b   Koshiba, Takeshi ^c  

^a FUJITSU LABORATORIES LTD   (Japan)

^b RIKKYO UNIVERSITY   (Japan)

^c SAITAMA UNIVERSITY   (Japan)

Author keywords

packing method; pattern matching; somewhat homomorphic encryption; the hamming distance

Indexed keywords

APPROXIMATE PATTERN MATCHING; BIOMETRIC AUTHENTICATION; EFFICIENT COMPUTATION; HO-MOMORPHIC ENCRYPTIONS; OPTIMIZED IMPLEMENTATION; PACKING METHOD; PATTERN MATCHING PROBLEMS; SOMEWHAT HOMOMORPHIC ENCRYPTIONS;

BIOMETRICS; CLOUD COMPUTING; HAMMING DISTANCE; PATTERN MATCHING; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 84889076730     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2517488.2517497     Document Type: Conference Paper

References (41)

1. M.J. Atallah and K.B. Frikken, "Securely outsourcing linear algebra computations", In ACM Symposium on Information, Computer and Communication Security-ASIACCS 2010, ACM, 48-59, 2010.
2. P. Baldi, R. Baronio, E. De Crisofaro, P. Gasti and G. Tsudik, "Countering gattaca: efficient and secure testing of fully-sequenced human genomes", In ACM Conference on Computer and Communications Security-CCS 2011, ACM, 691-702, 2011.
3. J. Baron, K. El Defrawy, K. Minkovich, R. Ostrovsky and E. Tressier, "5PM: secure pattern matching", IACR e-print 2012/565, available at http://eprint.iacr.org/2012/698.pdf, 2012 (a preliminary version was presented at Security and Cryptography for Networks-SCN 2012, Springer LNCS 7485, 222-240, 2012).
4. M. Blanton and P. Gasti, "Secure and efficient protocols for iris and fingerprint identification", In European conference on Research in computer-ESORICS 2011, Springer LNCS 6879, 190-209, 2011.
5. D. Boneh, C. Gentry, S. Halevi, F. Wang and D. Wu, "Private database queries using somewhat homomorphic encryption", In Applied Cryptography and Network Security-ACNS 2013, Springer LNCS 7954, 102-118, 2013.
6. D. Boneh, E.J. Goh and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts", In Theory of Cryptography-TCC 2005, Springer LNCS 3378, 325-341, 2005.
7. Z. Brakerski, C. Gentry and S. Halevi, "Packed ciphertexts in LWE-based homomorphic encryption", In Public Key Cryptography-PKC 2013, Springer LNCS 7778, 1-13, 2013.
8. Z. Brakerski, C. Gentry and V. Vaikuntanathan, "(Leveled) fully homomorphic encryption without bootstrapping", In Innovations in Theoretical Computer Science-ITCS 2012, ACM, 309-325, 2012.
9. Z. Brakerski and V. Vaikuntanathan, "Fully homomorphic encryption from ring-LWE and security for key dependent messages", In Advances in Cryptology-CRYPTO 2011, Springer LNCS 6841, 505-524, 2011.
10. Z. Brakerski and V. Vaikuntanathan, "Efficient fully homomorphic encryption from (standard) LWE", In Foundations of Computer Science-FOCS 2011, IEEE, 97-106, 2011.
11. Y. Chen and P. Q. Nguyen, "BKZ 2.0: better lattice security estimates", In Advances in Cryptology-ASIACRYPT 2011, Springer LNCS 7073, 1-20, 2011.
12. J.H. Cheon, J.-S. Coron, J. Kim, M.S. Lee, T. Lepoint, M. Tibouchi and A. Yun, "Batch fully homomorphic encryption over the integers", In Advances in Cryptology-EUROCRYPT 2013, Springer LNCS 7881, 315-335, 2013.
13. Cloud Security Alliance (CSA), Security guidance for critical areas of focus in cloud computing, available at https://cloudsecurityalliance.org/ csaguide.pdf, December 2009.
14. J. -S. Coron, A. Mandal, D. Naccache and M. Tibouchi, "Fully homomorphic encryption over the integers with shorter public-keys", In Advances in Cryptology-CRYPTO 2011, Springer LNCS 6841, 487-504, 2011.
15. R. Cramer, R. Gennaro and B. Schoenmakers, "A secure and optimally efficient multi-authority election scheme", In Advances in Cryptology-EUROCRYPT 1997, Springer LNCS 1462, 103-118, 1997.
16. I. Damgård, V. Pastro, N. Smart and S. Zakarias, "Multiparty computation from somewhat homomorphic encryption", In Advances in Cryptology-CRYPTO 2012, Springer LNCS 7417, 643-662, 2012.
17. M. van Dijk, C. Gentry, S. Halevi and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," In Advances in Cryptology-EUROCRYPT 2010, Springer LNCS 6110, 24-43, 2010.
18. J. Fan and F. Vercauteren, "Somewhat practical fully homomorphic encryption", IACR e-print 2012/144, available at http://eprint.iacr.org/ 2012/144, 2012.
19. C. Gentry, "Fully homomorphic encryption using ideal lattices", In Symposium on Theory of Computing-STOC 2009, ACM, 169-178, 2009.
20. C. Gentry and S. Halevi, "Implementing Gentry's fully-homomorphic encryption scheme", In Advances in Cryptology-EUROCRYPT 2011, Springer LNCS 6632, 129-148, 2011.
21. C. Gentry, S. Halevi and N. P. Smart, "Fully homomorphic encryption with polylog overhead", In Advances in Cryptology-EUROCRYPT 2012, Springer LNCS 7237, 465-482, 2012.
22. C. Gentry, S. Halevi and N. P. Smart, "Homomorphic evaluation of the AES circuit", In Advances in Cryptology-CRYPTO 2012, Springer LNCS 7417, 850-867, 2012.
23. S. Goldwasser and S. Micali, "Probabilistic encryption and how to play mental poker keeping secret all partial information", In Symposium on Theory of Computing-STOC 1982, ACM, 365-377, 1982.
24. C. Hazay and T. Toft, "Computationally secure pattern matching in the presence of malicious adversaries", In Advances in Cryptology-ASIACRYPT 2010, Springer LNCS 6477, 195-212, 2010.
25. A. Jarrous and B. Pinkas, "Secure hamming distance based computation and its applications", In Applied Cryptography and Network Security-ACNS 2009, Springer LNCS 5536, 107-124, 2009.
26. J. Katz and L. Malka, "Secure text processing with applications to private DNA matching", In ACM Conference on Computer and Communications Security-CCS 2010, ACM, 485-492, 2010.
27. F. Kerschbaum and N. Oertel, "Privacy-preserving pattern matching for anomaly detection in RFID anti-counterfeiting", In Radio Frequency Identification: Security and Privacy Issues-RFIDSec 2010, Springer LNCS 6370, 124-137, 2010.
28. K. Lauter, M. Naehrig and V. Vaikuntanathan, "Can homomorphic encryption be practical?", In ACM workshop on Cloud computing security workshop-CCSW 2011, ACM, 113-124, 2011.
29. R. Lindner and C. Peikert, "Better key sizes (and attacks) for LWE-based encryption", In RSA Conference on Topics in Cryptology-CT-RSA 2011, Springer LNCS 6558, 319-339, 2011.
30. A. Lopez-Alt, E. Tromer, and V. Vaikuntanathan, "On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption," In Symposium on Theory of Computing-STOC 2012, ACM, 1219-1234, 2012.
31. V. Lyubashevsky, C. Peikert and O. Regev, "On ideal lattices and learning with errors over rings", In Advances in Cryptology-EUROCRYPT 2010, Springer LNCS 6110, 1-23, 2010.
32. D. Micciancio and O. Regev, "Worst-case to average-case reduction based on gaussian measures", SIAM J. Computing 37 (1), 267-302, 2007.
33. M. Osadchy, B. Pinkas, A. Jarrous and B. Moskovich, "SCiFI - a system for secure face recognition", In IEEE Security and Privacy, IEEE Computer Society, 239-254, 2010.
34. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes", In Advances in Cryptology-EUROCRYPT 1999, Springer LNCS 1592, pp. 223-238, 1999.
35. C. Peikert, V. Vaikuntanathan and B. Waters, "A framework for efficient and composable oblivious transfer", In Advances in Cryptology-CRYPTO 2008, Springer LNCS 5157, 554-571, 2008.
36. N. P. Smart and F. Vercauteren, Fully homomorphic encryption with relatively small key and ciphertext sizes, in: Public Key Cryptography-PKC 2010, Springer LNCS 6056, 420-443, 2010.
37. N. P. Smart and F. Vercauteren, "Fully homomorphic SIMD operations", To appear in Designs, Codes and Cryptography, IACR e-print 2011/133, available at http://eprint.iacr.org/2011/133.pdf, 2011.
38. J. R. Troncoso-Pastoriza, S. Katzenbeisser and M. Celik, "Privacy preserving error resilient DNA searching through oblivious automata", In ACM Conference on Computer and Communications Security-CCS 2007, ACM, 519-528, 2007.
39. D. Vergnaud, "Efficient and secure generalized pattern matching via fast fourier transform", In International Conference on Cryptology in Africa-AFRICACRYPT 2011, Springer LNCS 6737, 41-58, 2011.
40. M. Yasuda, T. Shimoyama, J. Kogure, K. Yokoyama and T. Koshiba, "Packed homomorphic encryption based on ideal lattices and its application to biometrics", In CD-ARES Workshop 2013 (Modern Cryptography and Security Engineering-MoCrySEn 2013), Springer LNCS 8128, 55-74, 2013.
41. M. Yasuda, T. Shimoyama, J. Kogure, K. Yokoyama and T. Koshiba, "Practical packing method in somewhat homomorphic encryption", To be presented at International Workshop on Data Privacy Management-DPM 2013.