Skip to main content

Searchable Encryption for Biometric Identification Revisited

  • Conference paper
  • First Online:
  • 822 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9963))

Abstract

Cryptographic primitives for searching and computing over encrypted data have proven useful in many applications. In this paper, we revisit the application of symmetric searchable encryption (SSE) to biometric identification. Our main contribution is two SSE schemes well-suited to be applied to biometric identification over encrypted data. While existing solution uses SSE with single-keyword search and highly sequential design, we use threshold conjunctive queries and parallelizable constructions. As a result, we are able to perform biometric identification over a large amount of encrypted biometric data in reasonable time. Our two SSE schemes achieve a different trade-off between security and efficiency. The first scheme is more efficient, but is proved secure only against non-adaptive adversaries while the second is proved secure against adaptive adversaries.

G. Amchyaa—Part of this work was done while this author was an intern at Safran Identity and Security, and a student at Eurécom, Sophia-Antipolis, France.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Adjedj, M., Bringer, J., Chabanne, H., Kindarji, B.: Biometric identification over encrypted data made feasible. In: Prakash, A., Sen Gupta, I. (eds.) ICISS 2009. LNCS, vol. 5905, pp. 86–100. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Boldyreva, A., Chenette, N.: Efficient fuzzy search on encrypted data. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 613–633. Springer, Heidelberg (2015)

    Google Scholar 

  3. Bringer, J., Chabanne, H., Kindarji, B.: Identification with encrypted biometric data. Secur. Commun. Netw. 4(5), 548–562 (2011)

    Article  Google Scholar 

  4. Bringer, J., Chabanne, H., Patey, A.: Practical identification with encrypted biometric data using Oblivious RAM. In: ICB 2013, pp. 1–8. IEEE (2013)

    Google Scholar 

  5. Cash, D., Jaeger, J., Jarecki, S., Jutla, C.S., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS 2014. The Internet Society (2014)

    Google Scholar 

  6. Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Roşu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 353–373. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS 2006, pp. 79–88. ACM (2006)

    Google Scholar 

  8. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)

    Article  Google Scholar 

  9. Apache Hadoop Project. http://hadoop.apache.org/

  10. Huang, Y., Malka, L., Evans, D., Katz, J.: Efficient privacy-preserving biometric identification. In: NDSS 2011. The Internet Society (2011)

    Google Scholar 

  11. Jain, A.K., Ross, A., Prabhakar, S.: An introduction to biometric recognition. IEEE Trans. Circ. Syst. Video Technol. 14(1), 4–20 (2004)

    Article  Google Scholar 

  12. Li, J., Lin, X., Zhang, Y., Han, J.: KSF-OABE: outsourced attribute-based encryption with keyword search function for cloud storage. IEEE Trans. Serv. Comput. PP(99), 1 (2016)

    Google Scholar 

  13. Melchor, C.A., Fau, S., Fontaine, C., Gogniat, G., Sirdey, R.: Recent advances in homomorphic encryption: a possible future for signal processing in the encrypted domain. IEEE Sig. Process. Mag. 30(2), 108–117 (2013)

    Article  Google Scholar 

  14. Ostrovsky, R.: Efficient computation on oblivious rams. In: ACM Symposium on Theory of Computing - STOC 1990, pp. 514–523. ACM (1990)

    Google Scholar 

  15. Ostrovsky, R., Skeith, W.E.: A survey of single-database private information retrieval: techniques and applications. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 393–411. Springer, Heidelberg (2007). doi:10.1007/978-3-540-71677-8_26

    Chapter  Google Scholar 

  16. Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. In: CoRR, abs/1408.2927 (2014)

    Google Scholar 

Download references

Acknowledgement

This work has been partially funded by the French ANR-12-CORD-0014 project SECULAR and the European H2020 TREDISEC project under the Grant Agreement 644412.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ghassane Amchyaa .

Editor information

Editors and Affiliations

Appendix

Appendix

Fig. 4.
figure 4

Completion of Bloom filters in the non-adaptive simulator

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Amchyaa, G., Bringer, J., Lescuyer, R. (2016). Searchable Encryption for Biometric Identification Revisited. In: Livraga, G., Torra, V., Aldini, A., Martinelli, F., Suri, N. (eds) Data Privacy Management and Security Assurance. DPM QASA 2016 2016. Lecture Notes in Computer Science(), vol 9963. Springer, Cham. https://doi.org/10.1007/978-3-319-47072-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47072-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47071-9

  • Online ISBN: 978-3-319-47072-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics