skip to main content
10.1145/2909827.2931097acmconferencesArticle/Chapter ViewAbstractPublication Pagesih-n-mmsecConference Proceedingsconference-collections
abstract

Study of a Verifiable Biometric Matching

Published:20 June 2016Publication History

ABSTRACT

In this paper, we apply verifiable computing techniques to a biometric matching. The purpose of verifiable computation is to give the result of a computation along with a proof that the calculations were correctly performed. We adapt a protocol called sumcheck protocol and present a system that performs verifiable biometric matching in the case of a fast border control. This is a work in progress and we focus on verifying an inner product. We then give some experimental results of its implementation. Verifiable computation here helps to enforce the authentication phase bringing in the process a proof that the biometric verification has been correctly performed.

References

  1. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, New York, NY, USA, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. J. Atallah, K. B. Frikken, M. T. Goodrich, and R. Tamassia. Financial Cryptography and Data Security: 9th International Conference, chapter Secure Biometric Authentication for Weak Computational Devices. Springer Berlin Heidelberg, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Parno, J. Howell, C. Gentry, and M. Raykova. Pinocchio: Nearly practical verifiable computation. In 2013 IEEE Symposium on Security and Privacy, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Schroff, D. Kalenichenko, and J. Philbin. Facenet: A unified embedding for face recognition and clustering. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2015.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Thaler. Time-optimal interactive proofs for circuit evaluation. In Advances in Cryptology-CRYPTO 2013. Proceedings, pages 71--89. Springer Berlin Heidelberg, 2013.Google ScholarGoogle Scholar
  6. R. S. Wahby, S. Setty, Z. Ren, A. J. Blumberg, and M. Walfish. Efficient RAM and control flow in verifiable outsourced computation. In NDSS, 2015.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Study of a Verifiable Biometric Matching

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          IH&MMSec '16: Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security
          June 2016
          200 pages
          ISBN:9781450342902
          DOI:10.1145/2909827

          Copyright © 2016 Owner/Author

          Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 20 June 2016

          Check for updates

          Qualifiers

          • abstract

          Acceptance Rates

          IH&MMSec '16 Paper Acceptance Rate21of61submissions,34%Overall Acceptance Rate128of318submissions,40%
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader