An Efficient Group Signature Scheme from Bilinear Maps
Jun Furukawa · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
We propose a new group signature scheme which is secure if we assume the Decision Diffie-Hellman assumption, the q-Strong Diffie-Hellman assumption, and the existence of random oracles. The proposed scheme is the most efficient among the all previous group signature schemes in signature length and in computational complexity. This paper is the full version of the extended abstract appeared in ACISP 2005 [17].