On the Linkability and Security Analysis of Two Schnorr-Type Blind Signature Schemes

2009 ◽  
Author(s):  
Jianhong Zhang ◽  
Hua Chen ◽  
Shengnan Gao
Keyword(s):  
Security Analysis ◽  
Blind Signature ◽  
Signature Schemes

Boosting the Security of Blind Signature Schemes

2021 ◽  
pp. 468-492
Author(s):  
Jonathan Katz ◽  
Julian Loss ◽  
Michael Rosenberg
Keyword(s):  
Blind Signature ◽  
Signature Schemes

Efficient Convertible User Designating Confirmer Partially Blind Signature with Provable Security

2011 ◽  
Vol 282-283 ◽  
pp. 307-311
Author(s):  
Li Zhen Ma
Keyword(s):  
Provable Security ◽  
Discrete Logarithm ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Schemes ◽  
Partially Blind Signature ◽  
Provably Secure

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.

On the security of some proxy blind signature schemes

2005 ◽  
Vol 74 (3) ◽  
pp. 297-302 ◽  
Author(s):  
Hung-Min Sun ◽  
Bin-Tsan Hsieh ◽  
Shin-Mu Tseng
Keyword(s):  
Blind Signature ◽  
Signature Schemes ◽  
Proxy Blind Signature
Sign in / Sign up

Export Citation Format

Share Document