A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity

J. J. Chin, R. Kannan, V. T. Goh*, S. C. Yip

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Downloads (Pure)

Abstract

In this paper, we propose a Blind Identity-Based Identification (Blind IBI) scheme based on the Guillou-Quisquater (GQ) scheme. Our proposed scheme combines the benefits of traditional Identity-Based Identification (IBI) schemes that can authenticate a user’s identity without rely ing on a trusted third party with the Blind Signature (BS) scheme that provides anonymity. As a result, the proposed scheme assures absolute user privacy during the authentication process. It does not rely on a third party, yet the verifier can still be assured of the user’s identity with out the user actually revealing it. In our work, we show that the proposed scheme is provably secure under the random oracle model, with the assumption that the one-more-RSA-inversion problem is difficult. Furthermore, we demonstrate that the proposed scheme is secure against passive, active, and concurrent impersonation attacks. In conclusion, the proposed scheme is able to achieve the desired blindness property without compromising the security of the GQ-IBI scheme it is based upon.
Original languageEnglish
Pages (from-to)19-31
Number of pages0
JournalMalaysian Journal of Mathematical Sciences
Volume17
Issue number4
Early online date14 Dec 2023
DOIs
Publication statusPublished - 14 Dec 2023

Keywords

  • blind GQ-IBI
  • blind signature
  • IBI
  • one-more-RSA inversion problem
  • random oracle model

Fingerprint

Dive into the research topics of 'A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity'. Together they form a unique fingerprint.

Cite this