Analysis of Sun et al.’s linkability attack on some proxy blind signature schemes
Introduction
The blind signature scheme was first proposed by Chaum (1983) in Crypto’83. The security of Chaum’s scheme is based on the difficulty of integer factoring. The blind signature scheme can achieve the unforgeability property for the signer and the unlinkability for the receiver. Mambo et al. (1996) presented the proxy signature scheme to allow the designated proxy signer to sign messages on behalf of the original signer. For example, when a manager is going on a vacation, (s)he can delegate her/his secretary to sign messages on behalf of her/him. Tan et al. (2002) presented two proxy blind signature schemes to allow the proxy signer to generate a blind signature on behalf of the original signer. Awasthi and Lal (2005) showed a forgery attack on Tan et al.’s schemes and proposed a more secure proxy blind signature scheme later. Recently, Sun et al. (2005) pointed out that neither Tan et al.’s schemes nor Awasthi–Lal’s scheme satisfy the unlinkability property of the proxy blind signature scheme. In this paper, we show that Sun et al.’s linkability attack is failed and these schemes are still satisfy the unlinkability property.
Section snippets
Reviews of Tan et al.’s and Awasthi–Lal’s proxy blind signature schemes
The system parameters in the following proxy blind signature schemes are defined as follows:
- p, q
two large prime numbers, where q ∣ (p − 1)
- g
element of of order q
- xo, yo
secret key and public key of the original signer respectively, where
- xp, yp
secret key and public key of the proxy signer respectively, where
- h( )
a secure and public one way hash function
- ∥
the concatenation of strings
System parameters
Sun et al.’s linkability attack on some proxy blind signature schemes
In Sun et al.’s (2005) linkability attack, they pointed out that the proxy signer can record all blinded messages and use them to trace back the corresponding blind signatures. Hence, Sun et al. claimed that all Tan et al.’s schemes and Awasthi–Lal’s scheme cannot satisfy the unlinkability property of the blind signature. The details of Sun et al.’s attack are described as follows.
Analysis of Sun et al.’s linkability attack
Harn (1995) first pointed out that Camenisch et al.’s (1994) blind signature scheme is linkable. Hoster et al. (1995) showed that Harn’s claim is incorrect later. Recently, Hwang et al., 2002, Hwang et al., 2003a, Hwang et al., 2003b, Hwang et al., 2003c presented several papers to claim that several blind signature schemes are linkable. Unfortunately many cryptanalysts (Wu and Yeh, 2005, Lee and Wu, 2004, Lee and Sun, 2003, Fan, 2003) have showed that Hwang et al.’s papers are all failed
Conclusions
Recently, Sun et al. pointed out that Tan et al.’s schemes and Awasthi–Lal’s scheme cannot satisfy the unlinkability property of the proxy blind signature scheme. In this paper, we show that Sun et al.’s linkability attack is failed and these schemes are still satisfy the unlinkability property.
Acknowledgement
This work was supported in part by the Bestwise International co.
References (16)
- et al.
Traceability on RSA-based partially signature with low computation
Appl. Math. Comput.
(2003) - et al.
On the security of some proxy blind signature scheme
J. Syst. Software
(2005) - et al.
Proxy blind signature scheme
Transaction on Cryptology
(2005) - Camenisch, J.L., Piveteau, J.M., Stadler, M.A., 1994. Blind signatures based on the discrete logarithm problem. In:...
Blind signature systems
Comments on Hwang–Lee–Lai attack upon Fan–Lee partially blind signature scheme
IEICE Trans. Fundam.
(2003)Cryptanalysis of the blind signatures based on the discrete logarithm problem
Electron. Lett.
(1995)- et al.
Comment: cryptanalysis of the blind signatures based on the discrete logarithm problem
Electron. Lett.
(1995)
Cited by (7)
An electronic voting mechanism for fighting bribery and coercion
2014, Journal of Network and Computer ApplicationsAn Improved and Efficient Coercion-resistant Measure for Electronic Voting System
2024, Research SquareAn electronic voting system immune to coercion and bribery from cross layers in large scale election
2019, Journal of Internet TechnologyAnalysis on the generalization of proxy signature
2013, Security and Communication NetworksA new proxy blind signature scheme with message recovery
2013, Information Technology JournalA proxy blind signature scheme with proxy revocation
2007, Proceedings - CIS Workshops 2007, 2007 International Conference on Computational Intelligence and Security Workshops