Identity-Based Partially Blind Signature Scheme: Cryptanalysis and Construction

Yuhong Jiang,Lunzhi Deng,Bingqin Ning

doi:10.1109/access.2021.3083529

Yuhong Jiang, Lunzhi Deng + Show 1 more

Open Access

https://doi.org/10.1109/access.2021.3083529

Copy DOI

Abstract

Blind signature is a special type of digital signature, the signer cannot see the specific content signed. However, blindness may cause users to abuse their rights. Partial blind signature allows the signer to embed pre-negotiated public information in the blind signature without losing blindness, which can prevent users from abusing their rights. Islam et al. presented an identity-based partial blind signature scheme and claimed that it is provable secure. However, in this paper we proved that the scheme is vulnerable against the tampering attacks with public information. We then proposed a new identity-based partial blind signature scheme, showed the security proofs under the assumption that the elliptic curve discrete logarithm problem (ECDLP) is difficult. The new scheme does not use pairing operations and enjoys less computation cost.

Highlights

Chaum [4] introduced the blind signature
2) We proposed a new scheme to prevent tampering with public information attacks
We proved that the new scheme is secure in the random oracle model under the assumption that elliptic curve discrete logarithm problem (ECDLP) is intractable

Summary

INTRODUCTION

Chaum [4] introduced the blind signature. It is a special kind of digital signature, which means the signer generates a signature without knowing the specific information. A. SCHEME REVIEW The IB-PBS scheme given by Islam et al [10] includes four parts: system setup, key extraction, signature agreement, and VOLUME 9, 2021 verify, which are completed by the signer, requester, and verifier. In order to get a partial blind signature on m and , B and C interact as follows: 1) Commitment: B chooses a number r ∈ RZp∗ and computes R = rPB, B sends (R, RB) to the requester C. 4) VERIFY In order to verify the partial blind signature (m, , RB, R , S ) for message m and public information , the verifier performs the following steps: 1) Calculates H1(m, R , ). If the equation is valid, accept partial blind signature (m, , RB, R , S ); otherwise, do not accept

ATTACK ON THE SCHEME

PARTIAL BLINDNESS

UNFORGEABILITY

Findings

VIII. CONCLUSION