Abstract

Fuzzy vector signature (FVS) is a new primitive where a fuzzy (biometric) data w is used to generate a verification key (VKw), and, later, a distinct fuzzy (biometric) data w′ (as well as a message) is used to generate a signature (σw′). The primary feature of FVS is that the signature (σw′) can be verified under the verification key (VKw) only if w is close to w′ in a certain predefined distance. Recently, Seo et al. proposed an FVS scheme that was constructed (loosely) using a subset-based sampling method to reduce the size of helper data. However, their construction fails to provide the reusability property that requires that no adversary gains the information on fuzzy (biometric) data even if multiple verification keys and relevant signatures of a single user, which are all generated with correlated fuzzy (biometric) data, are exposed to the adversary. In this paper, we propose an improved FVS scheme which is proven to be reusable with respect to arbitrary correlated fuzzy (biometric) inputs. Our efficiency improvement is achieved by strictly applying the subset-based sampling method used before to build a fuzzy extractor by Canetti et al. and by slightly modifying the structure of the verification key. Our FVS scheme can still tolerate sub-linear error rates of input sources and also reduce the signing cost of a user by about half of the original FVS scheme. Finally, we present authentication protocols based on fuzzy extractor and FVS scheme and give performance comparison between them in terms of computation and transmission costs.

Highlights

  • Biometric information has been used for user authentication [1,2,3,4,5]because of its uniqueness and immutability

  • We introduce the formal security model for reusability of fuzzy vector signature (FVS) and prove that our proposed scheme is reusable in the reusability model

  • Compared to the original FVS scheme [20], we reduced the size of the signing parameter and the verification key to approximately two-thirds their original sizes and cut the signature size by about half

Read more

Summary

Introduction

Biometric information (e.g., fingerprint, iris, face, vein) has been used for user authentication [1,2,3,4,5]. A new primitive called fuzzy vector signature (FVS) [20] was proposed based on bilinear maps (i.e., pairings), which improved the error tolerance rate without any additional requirements on the distribution of biometric information. This scheme tolerates a sub-linear fraction of errors and is based on standard assumptions, like the external Diffie-Hellman (XDH). By more strictly applying the subset-based sampling method [17], our scheme is more efficient than Reference [20] from the perspective of the user and the authentication server It reduces the size of the signature and verification key and the number of pairing operations required for verification.

Related Work
Source Distributions
Contribution
Notation
Hamming Distance Metric
Min-Entropy
Universal Hash Function
Discrete Logarithm Assumption
Bilinear Maps
Syntax of Fuzzy Vector Signature
VK-Privacy
SIG-Privacy
Reusability
Construction
Setting the Number of Subsets
Correctness
Security
Performance Analysis
Storage or Transmission Costs
Computation Cost
Implementation
Findings
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.