Subscribe
Issue No.02  AprilJune (2009 vol.6)
pp: 149151
Huaqun Wang , Dalian Fisheries University, Dalian
Futai Zhang , College of Mathematics and Computer Science, Nanjing
Yanfei Sun , Nanjing University of Posts and Telecommunications, Nanjing
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2009.13
ABSTRACT
The concept of ring signature was first introduced by Rivest et al. in 2001. In a ring signature, instead of revealing the actual identity of the message signer, it specifies a set of possible signers. The verifier can be convinced that the signature was indeed generated by one of the ring members; however, the verifier is unable to tell which member actually produced the signature. A convertible ring signature scheme allows the real signer to convert a ring signature into an ordinary signature by revealing secret information about the ring signature. Thus, the real signer can prove the ownership of a ring signature if necessary, and the the other members in the ring cannot prove the ownership of a ring signature. Based on the original ElGamal signature scheme, a generalized ring signature scheme was proposed for the first time in 2008. The proposed ring signature can achieve unconditional signer ambiguity and is secure against adaptive chosenmessage attack in the random oracle model. By comparing to ring signatures based on RSA algorithm, the authors claimed that the proposed generalized ring signature scheme is convertible. It enables the actual message signer to prove to a verifier that only she is capable of generating the ring signature. Through cryptanalysis, we show that the convertibility of the generalized ring signature scheme cannot be satisfied. Everyone in the ring signature has the ability to claim that she generates the generalized ring signature.
INDEX TERMS
Ring signature, ElGamal signature, convertibility, anonymity, discrete logarithm.
CITATION
Huaqun Wang, Futai Zhang, Yanfei Sun, "Cryptanalysis of a Generalized Ring Signature Scheme", IEEE Transactions on Dependable and Secure Computing, vol.6, no. 2, pp. 149151, AprilJune 2009, doi:10.1109/TDSC.2009.13
REFERENCES
