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.
Highlights
The emergence of quantum computing causes a potential threat to the traditional cryptosystems
In 2011, the first commercial quantum computer “D-Wave One” was worked out, which provided the application of certain cracking algorithms to the traditional public key cryptography with feasible condition. It is because most of mathematical hard problems in the traditional cryptosystems are vulnerable to the strong computing power of quantum computers. erefore, it is obvious that the influence quantum computers bring to the traditional cryptosystem will permeate into the information security and Internet security of all areas of a country, such as politics, economy, culture, and military
It can be explained from two main aspects: Firstly, for the integer factorization problem, the conjecture that an n-bit integer can be decomposed by the n-qubit quantum computer is proposed by Beauregard [1]
Summary
The emergence of quantum computing causes a potential threat to the traditional cryptosystems. In 2011, the first commercial quantum computer “D-Wave One” was worked out, which provided the application of certain cracking algorithms to the traditional public key cryptography with feasible condition It is because most of mathematical hard problems in the traditional cryptosystems are vulnerable to the strong computing power of quantum computers. In order to improve the practicability of blind signature, a new ID-based scheme on lattice is proposed in this paper, which is more efficient and secure. (2) Secondly, we use the bimodal Gaussian rejection sampling in our scheme to prevent the leakage of critical information, such as the signer’s secret key Using this aborting technology, it makes the mean value of sampling times needed to generate a valid signature smaller. (3) because the framework of ID-based cryptosystem is used in our scheme, it means that the additional cost is not needed to manage lots of certificates in our scheme. erefore, the proposed scheme under this cryptosystem is more practical in the real application
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
