A lattice-based partially blind signature

2016 ◽  
Vol 9 (12) ◽  
pp. 1820-1828 ◽  
Author(s):  
Haibo Tian ◽  
Fangguo Zhang ◽  
Baodian Wei
Keyword(s):  
Blind Signature ◽  
Partially Blind Signature

Secure and efficient ID-based partially blind signature scheme

2013 ◽  
Vol 32 (5) ◽  
pp. 1388-1391
Author(s):  
Jun-jie HE ◽  
Juan WANG ◽  
Chuan-da QI
Keyword(s):  
Blind Signature ◽  
Signature Scheme ◽  
Partially Blind Signature

Research on Fair E-Payment Protocol Based on Partially Blind Signature with Analysis of Scientific Material

2011 ◽  
Vol 282-283 ◽  
pp. 449-452
Author(s):  
Xin De Wang ◽  
Jing Liang Zhang ◽  
Zheng Tao Jiang
Keyword(s):  
Blind Signature ◽  
Third Party ◽  
Signature Scheme ◽  
Payment Protocol ◽  
Partially Blind Signature

A new partially blind signature scheme is proposed based on Schnorr blind signature scheme. Compared with the previous schemes, the proposed scheme has lower computations and shorter signature size. By conversely using the proposed partially blind signature, a fair e-payment protocol is given. An advantage of this protocol is that two participants achieve the goals of exchanging their items without intervention of a third party. The low computations and good properties of the underlying partially blind signature guarantee that the proposed protocol has needed efficiency and security.

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.

Cryptanalysis of a Certificateless Partially Blind Signature

2014 ◽  
Vol 519-520 ◽  
pp. 462-465
Author(s):  
Lin Cheng ◽  
Qiao Yan Wen ◽  
Dong Bo
Keyword(s):  
Random Oracle Model ◽  
Random Oracle ◽  
Blind Signature ◽  
Signature Scheme ◽  
Electronic Cash ◽  
Partially Blind Signature

Partially blind signature is an important technique in secure electronic cash system. Recently, Zhang et al. presented the first certificateless partially blind signature scheme and constructed an electronic cash system based on this scheme. They claimed that their certificateless partially blind signature scheme is secure in the random oracle model. However, in this paper, we demonstrate the scheme is not secure. Our attack indicates that a malicious KGC in the electronic cash system based on Zhang et al.'s certificateless partially blind signature can forge valid electronic coins without being detected by the bank. It will result in loss of the bank.

Sign in / Sign up

Export Citation Format

Share Document