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

Citation

Kannan, R. and Chin, Ji Jian and Goh, Vik Tor and Yip, Sook Chin (2023) A Pairing-free Provable Secure and Efficient Identity-based Identification Scheme with Anonymity. Malaysian Journal of Mathematical Sciences, 17 (4). pp. 705-717. ISSN 2289-750X

[img] Text
25.pdf - Published Version
Restricted to Repository staff only

Download (1MB)

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 relying 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 without 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.

Item Type: Article
Uncontrolled Keywords: Blind IBI, digital signature
Subjects: T Technology > TA Engineering (General). Civil engineering (General) > TA329-348 Engineering mathematics. Engineering analysis
Divisions: Faculty of Engineering (FOE)
Depositing User: Ms Nurul Iqtiani Ahmad
Date Deposited: 22 Feb 2024 04:46
Last Modified: 22 Feb 2024 04:46
URII: http://shdl.mmu.edu.my/id/eprint/12104

Downloads

Downloads per month over past year

View ItemEdit (login required)