A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model

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

Full description

Bibliographic Details
Main Authors: Lili Zhang, Yanqin Ma
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2014/307637
id doaj-14951b3723254cf1a7aa93c1b0d40f6b
record_format Article
spelling doaj-14951b3723254cf1a7aa93c1b0d40f6b2020-11-24T21:06:20ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472014-01-01201410.1155/2014/307637307637A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard ModelLili Zhang0Yanqin Ma1Institute of Information Engineering and Huanghe Science and Technology College, Zhengzhou 450063, ChinaInstitute of Information Engineering and Huanghe Science and Technology College, Zhengzhou 450063, ChinaA 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.http://dx.doi.org/10.1155/2014/307637
collection DOAJ
language English
format Article
sources DOAJ
author Lili Zhang
Yanqin Ma
spellingShingle Lili Zhang
Yanqin Ma
A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
Mathematical Problems in Engineering
author_facet Lili Zhang
Yanqin Ma
author_sort Lili Zhang
title A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
title_short A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
title_full A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
title_fullStr A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
title_full_unstemmed A Lattice-Based Identity-Based Proxy Blind Signature Scheme in the Standard Model
title_sort lattice-based identity-based proxy blind signature scheme in the standard model
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2014-01-01
description 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.
url http://dx.doi.org/10.1155/2014/307637
work_keys_str_mv AT lilizhang alatticebasedidentitybasedproxyblindsignatureschemeinthestandardmodel
AT yanqinma alatticebasedidentitybasedproxyblindsignatureschemeinthestandardmodel
AT lilizhang latticebasedidentitybasedproxyblindsignatureschemeinthestandardmodel
AT yanqinma latticebasedidentitybasedproxyblindsignatureschemeinthestandardmodel
_version_ 1716765813054111744