Linkability of Blind Signature Schemes over Braid Groups

Blindness and unforgeability are two essential security requirements of a secure blind signature scheme. Blindness means that after interacting with various users, the signer can never be able to link a valid message pair. Blindness is meaningless if after interacting with various users, the signer is able to link a valid message signature pair. This security vulnerability is known as linkability attack. Recently, Verma proposed two blind signature schemes over braid groups. Verma claimed that the proposed schemes are secure against all possible security vulnerabilities and also satisfy all essential securities properties.This paper reviews Verma’s proposed blind signature schemes and found that these scheme do not withstand against the linkability vulnerability.

[1]  Jianhong Zhang,et al.  Linkability of a Blind Signature Scheme and Its Improved Scheme , 2006, ICCSA.

[2]  Joan S. Birman,et al.  A new approach to the word and conjugacy problems in the braid groups , 1997 .

[3]  F. A. Garside,et al.  THE BRAID GROUP AND OTHER GROUPS , 1969 .

[4]  J. Birman Braids, Links, and Mapping Class Groups. , 1975 .

[5]  E. Artin The theory of braids. , 1950, American scientist.

[6]  Jang-Won Lee,et al.  New Signature Scheme Using Conjugacy Problem , 2002, IACR Cryptol. ePrint Arch..

[7]  Wun-She Yap,et al.  Linkability of Some Blind Signature Schemes , 2007, WISTP.

[8]  Girraj Kumar Verma Blind Signature Scheme over Braid Groups , 2008, IACR Cryptol. ePrint Arch..

[9]  Kwangjo Kim,et al.  ID-Based Blind Signature and Ring Signature from Pairings , 2002, ASIACRYPT.

[10]  Zuowen Tan,et al.  Digital Proxy Blind Signature Schemes Based on DLP and ECDLP , 2002 .

[11]  Kwangjo Kim,et al.  Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings , 2003, ACISP.

[12]  Tatsuaki Okamoto,et al.  Provably Secure Partially Blind Signatures , 2000, CRYPTO.

[13]  Jung Hee Cheon,et al.  New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.

[14]  Hugh R. Morton,et al.  ALGORITHMS FOR POSITIVE BRAIDS , 1994 .

[15]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[16]  Manoj Kumar Security Analysis of a Proxy Signature Scheme over Braid Groups , 2009, IACR Cryptol. ePrint Arch..

[17]  Dennis Hofheinz,et al.  A Practical Attack on Some Braid Group Based Cryptographic Primitives , 2003, Public Key Cryptography.

[18]  Jacques Stern,et al.  Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.

[19]  David Chaum,et al.  Blind Signature System , 1983, CRYPTO.

[20]  Sangjin Lee,et al.  Pseudorandomness from Braid Groups , 2001, CRYPTO.