Efficient identity-based threshold signature scheme from bilinear pairings in standard model

2014 ◽  
Vol 8 (2/3) ◽  
pp. 107 ◽  
Author(s):  
Fei Li ◽  
Wei Gao ◽  
Guilin Wang ◽  
Kefei Chen ◽  
Xueli Wang
2013 ◽  
Vol 33 (1) ◽  
pp. 15-18
Author(s):  
Xianzhi SHI ◽  
Changlu LIN ◽  
Shengyuan ZHANG ◽  
Fei TANG

2016 ◽  
Vol 9 (14) ◽  
pp. 2422-2433 ◽  
Author(s):  
Zhenhua Liu ◽  
Xiangsong Zhang ◽  
Yupu Hu ◽  
Tsuyoshi Takagi

2014 ◽  
Vol 58 (4) ◽  
pp. 1021-1039 ◽  
Author(s):  
M. R. Asaar ◽  
M. Salmasizadeh ◽  
W. Susilo

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


2011 ◽  
Vol 255-260 ◽  
pp. 2192-2196
Author(s):  
Cheng Yu Hu ◽  
Peng Tao Liu

The ring signature can guarantee the signer’s anonymity. Most proposed ring signature schemes have two problems: One is that the size of ring signature depends linearly on the ring size, and the other is that the signer can shift the blame to victims because of the anonymity. Some authors have studied the constant-size ring signature and deniable ring signature to solve these two problems. This paper shows that an identity-based ring signature scheme with constant size has some security problems by using an insecure accumulator and its verification process does not include the message m. Then we combine the concepts of “constant-size” and “deniable” to form an id-based deniable ring signature with constant-size signature. The new scheme with constant-size signature length is proposed based on an improved accumulator from bilinear pairings and it solves the problem of anonymity abuse.


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

Sign in / Sign up

Export Citation Format

Share Document