4.6 Article

Two Efficient Constructions for Biometric-Based Signature in Identity-Based Setting Using Bilinear Pairings

期刊

IEEE ACCESS
卷 9, 期 -, 页码 25973-25983

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3057064

关键词

Biometrics (access control); Cryptography; Security; Elliptic curve cryptography; Elliptic curves; Interpolation; Identity-based encryption; ID-based digital signature model; biometric-based signature; bilinear pairing; Lagrange polynomial; fuzzy extractor

资金

  1. Natural Science Foundation of Zhejiang Province of China [LZ17F020002]
  2. National Natural Science Foundation of China [61772166]

向作者/读者索取更多资源

This paper proposes two novel constructions for biometric-based signature in identity-based setting over elliptic curve groups, BioFIBS and Bio-IBS, which integrate elliptic curve cryptography technique with biometric-based IBS for more efficient and practical execution. The schemes satisfy security requirements in the random oracle model against adaptively chosen message and identity attack under computational Diffie-Hellman assumption.
It is always an attractive topic for researchers that biometric traits are used to represent the identities of users in identity-based cryptography due to their unique and inherent properties. Fuzzy identity-based signature (FIBS) and biometric identity-based signature (BIO-IBS) are both promising cryptographic primitives, where a signature generated with a private key of an identity can be verified by another identity if and only if the distance between these two identities is within a certain threshold. In this paper, we design two novel constructions for biometric-based signature in identity-based setting over elliptic curve groups, namely BioFIBS and Bio-IBS. The combination of elliptic curve cryptography (ECC) technique with biometric-based IBS integrates the advantages of both so that the proposed schemes are performed in a more efficient and practical manner for resource-constrained applications. This is confirmed by the comparison with the existing schemes in terms of computational and communicational efficiency. In addition, we prove that both our schemes satisfy the security requirements including correctness and unforgeability that is guaranteed in the random oracle model against the adaptively chosen message and identity attack under the computational Diffie-Hellman assumption.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据