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

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Li, Q., Hsu, C., He, D., Choo, K. K. R., & Gong, P. (2020). An Identity-Based Blind Signature Scheme Using Lattice with Provable Security. Mathematical Problems in Engineering, 2020. https://doi.org/10.1155/2020/7528571

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free