A real helper data scheme

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
    135 Downloads (Pure)

    Abstract

    The helper data scheme utilizes a secret key to protect biometric templates. The current helper data scheme requires binary feature representations that introduce quantization error and thus reduce the capacity of biometric channels. For spectral-minutiae based fingerprint recognition systems, Shannon theory proves that the current helper data scheme cannot have more than 6 bits. A 6-bit secret key is too short to secure the storage of biometric templates. Therefore, we propose a new helper data scheme without quantization. A basic realization is to convert the real-valued feature vector into a phase vector. By applying the spectral minutiae method in the FVC2000-DB2 fingerprint database, our new helper data scheme together with repetition codes and BCH codes allows at least 76 secret bits.
    Original languageUndefined
    Title of host publicationProceedings of the 2nd IAPR Asian Conference on Pattern Recognition (ACPR), 2013
    Place of PublicationUSA
    PublisherIEEE
    Pages84-89
    Number of pages6
    ISBN (Print)978-1-4799-2190-4
    DOIs
    Publication statusPublished - 5 Nov 2013
    Event2nd IAPR Asian Conference on Pattern Recognition, ACPR 2013 - Okinawa, Japan
    Duration: 5 Nov 20138 Nov 2013
    Conference number: 2
    http://www.am.sanken.osaka-u.ac.jp/ACPR2013/

    Publication series

    Name
    PublisherIEEE Computer Society

    Conference

    Conference2nd IAPR Asian Conference on Pattern Recognition, ACPR 2013
    Abbreviated titleACPR 2013
    Country/TerritoryJapan
    CityOkinawa
    Period5/11/138/11/13
    Internet address

    Keywords

    • EWI-25560
    • helper data scheme
    • METIS-309811
    • Biometric recognition
    • IR-93501
    • Biometric Template Protection

    Cite this