A biometric identity based signature scheme in the standard model

Author(s):  
Liangyun Fan ◽  
Jiande Zheng ◽  
Jing Yang
2016 ◽  
Vol 9 (14) ◽  
pp. 2422-2433 ◽  
Author(s):  
Zhenhua Liu ◽  
Xiangsong Zhang ◽  
Yupu Hu ◽  
Tsuyoshi Takagi

2011 ◽  
Vol 48-49 ◽  
pp. 599-602 ◽  
Author(s):  
Xiao Qin Shen ◽  
Yang Ming

A convertible limited verifier signature (CLVS) can be used to solve conflicts between authenticity and privacy in the digital signatures. In a CLVS scheme, the signature can be verified by a limited verifier. When necessary, the limited verifier can provide a proof to convince a judge that the signer has indeed generated the signature. However, the judge cannot transfer this proof to convince any other party. Also, the limited verifier signature should be converted into an ordinary one for public verification if required. In this paper, we proposed firstly identity-based converible limited verifier signature scheme in the standard model. We give the security proofs of our scheme and show that Our scheme achieved the desired security notions in the standard model (without random oracle).


2012 ◽  
Vol 35 (9) ◽  
pp. 1874 ◽  
Author(s):  
Ai-Jun GE ◽  
Chuan-Gui MA ◽  
Zhen-Feng ZHANG ◽  
Shao-Zhen CHEN

IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 20791-20799 ◽  
Author(s):  
Zecheng Wang ◽  
Xuemin Chen ◽  
Pingshui Wang

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Lili Zhang ◽  
Yanqin Ma

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