Provably secure robust threshold partial blind signature

2006 ◽  
Vol 49 (5) ◽  
pp. 604-615 ◽  
Author(s):  
Zhenfu Cao ◽  
Haojin Zhu ◽  
Rongxing Lu
2011 ◽  
Vol 282-283 ◽  
pp. 307-311
Author(s):  
Li Zhen Ma

Any one who knows the signer’s public key can verify the validity of a given signature in partially blind signature schemes. This verifying universality may be used by cheats if the signed message is sensitive or personal. To solve this problem, a new convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones, is proposed. Compared with Huang et al.’s scheme, the signature size is shortened about 25% and the computation quantity is reduced about 36% in the proposed scheme. Under random oracle model and intractability of Discrete Logarithm Problem the proposed scheme is provably secure.


2016 ◽  
Vol 41 (8) ◽  
pp. 3163-3176 ◽  
Author(s):  
SK Hafizul Islam ◽  
Ruhul Amin ◽  
G. P. Biswas ◽  
Mohammad S. Obaidat ◽  
Muhammad Khurram Khan

Author(s):  
Binayak Kar ◽  
Pritam Prava Sahoo ◽  
Asif Uddin Khan

Blind signature allows one user to get a signature without giving the signer any information about the actual message or the resulting signature. In this paper, we aim to improve the recently proposed Lin et al.’s Self-certified Partially Blind Signature Scheme[1] in order to withstand the security flaw in their scheme. The security of the improved scheme is enhanced in the blind signing phase of the scheme. The analysis shows that the proposed scheme resolves security problem in Lin et al.’s scheme and also meets the aspects of security features needed by a partial blind signature.


2010 ◽  
Vol 60 (2) ◽  
pp. 285-293 ◽  
Author(s):  
Chun-I Fan ◽  
Wei-Zhe Sun ◽  
Vincent Shi-Ming Huang

Sign in / Sign up

Export Citation Format

Share Document