A new identity-based proxy blind signature scheme

A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings. Unfortunately, the above underlying number theory problems will be solvable in the postquantum era. Lattice-based cryptography is enjoying great interest these days, due to implementation simplicity and provable security reductions. Moreover, lattice-based cryptography is believed to be hard even for quantum computers. In this paper, we present a new identity-based proxy blind signature scheme from lattices without random oracles. The new scheme is proven to be strongly unforgeable under the standard hardness assumption of the short integer solution problem (SIS) and the inhomogeneous small integer solution problem (ISIS). Furthermore, the secret key size and the signature length of our scheme are invariant and much shorter than those of the previous lattice-based proxy blind signature schemes. To the best of our knowledge, our construction is the first short lattice-based identity-based proxy blind signature scheme in the standard model.

Download Full-text

New certificateless proxy blind signature scheme

Journal of Computer Applications ◽

10.3724/sp.j.1087.2010.03341 ◽

2011 ◽

Vol 30 (12) ◽

pp. 3341-3342

Author(s):

Chun-yan WEI ◽

Xiao-qiu CAI

Keyword(s):

Blind Signature ◽

Signature Scheme ◽

Proxy Blind Signature

Download Full-text

An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

Mathematical Problems in Engineering ◽

10.1155/2020/7528571 ◽

2020 ◽

Vol 2020 ◽

pp. 1-12

Author(s):

Quanrun Li ◽

Chingfang Hsu ◽

Debiao He ◽

Kim-Kwang Raymond Choo ◽

Peng Gong

Keyword(s):

Quantum Computer ◽

Rapid Development ◽

Random Oracle Model ◽

Random Oracle ◽

Mean Value ◽

Blind Signature ◽

Signature Scheme ◽

Practical Applications ◽

Universal Quantum ◽

Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Download Full-text