Identity-based blind signature from lattices

2017 ◽  
Vol 22 (4) ◽  
pp. 355-360 ◽  
Author(s):  
Wen Gao ◽  
Yupu Hu ◽  
Baocang Wang ◽  
Jia Xie ◽  
Momeng Liu
Keyword(s):  
Blind Signature ◽  
Identity Based

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

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.

Identity-Based Xtr Blind Signature Scheme

2013 ◽  
Vol 19 (2) ◽  
pp. 143-149
Author(s):  
Qiaoying Tang ◽  
Fengxian Shen
Keyword(s):  
Blind Signature ◽  
Signature Scheme ◽  
Identity Based

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

Provably Secure Pairing-Free Identity-Based Partially Blind Signature Scheme and Its Application in Online E-cash System

2016 ◽  
Vol 41 (8) ◽  
pp. 3163-3176 ◽  
Author(s):  
SK Hafizul Islam ◽  
Ruhul Amin ◽  
G. P. Biswas ◽  
Mohammad S. Obaidat ◽  
Muhammad Khurram Khan
Keyword(s):  
Blind Signature ◽  
Signature Scheme ◽  
Partially Blind Signature ◽  
Identity Based ◽  
Provably Secure

scholarly journals Design of Identity-Based Blind Signature Scheme Upon Chaotic Maps

2020 ◽  
Vol 16 (05) ◽  
pp. 104 ◽  
Author(s):  
Nedal Mohammad Tahat ◽  
Ashraf Tahat ◽  
Ramzi Albadarneh ◽  
Talal Edwan
Keyword(s):  
Chaotic Systems ◽  
Chaotic Maps ◽  
Blind Signature ◽  
Signature Scheme ◽  
Identity Based

<span>Cryptosystems relying on chaotic maps have been presented lately. As a result of inferred and convenient connections amongst the attributes of conventional cryptosystems and chaotic frameworks, the concept of chaotic systems with applications to cryptography has earned much consideration from scientists working in the various domains. Hence, we suggest a novel IDentity-based Blind Signature (ID-BS) based technique in this paper that relies on a pair of hard number theoretic problems, namely, the Chaotic Maps (CM) and FACtoring (FAC) problems. The technique is immune to attacks, in addition to its efficiency in application. Relative to other related schemes, it requires fewer module operations. In summary, our proposed technique is superior to similar schemes within the cryptosystems domain.</span>

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

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Lili Zhang ◽  
Yanqin Ma
Keyword(s):  
Number Theory ◽  
Standard Model ◽  
Blind Signature ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Proxy Blind Signature ◽  
The Standard Model ◽  
Identity Based ◽  
Lattice Based Cryptography ◽  
Solution Problem

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.

Sign in / Sign up

Export Citation Format

Share Document