On the RS-Code Construction of Ring Signature Schemes and a Threshold Setting of RST

We propose a Reed-Solomon (RS) code construction of the 1-out-n (ring) signature scheme. It is obtained from the observation of the equivalency between the erasure correction technique of the RS code and the polynomial interpolation. The structure is very simple and yields a ring equation that can appropriately denoted by Z 1 + ... + Z n =v, which represents the summation of n evaluations of a polynomial. We also show how to extend the generic RST scheme [6] to a t-out-n threshold ring signature scheme.

[1]  Jacques Stern,et al.  Threshold Ring Signatures for Ad-hoc Groups , 2002, CRYPTO 2002.

[2]  Ivan Damgård,et al.  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.

[3]  Yuliang Zheng,et al.  Advances in Cryptology — ASIACRYPT 2002 , 2002, Lecture Notes in Computer Science.

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

[5]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[6]  Moti Yung,et al.  Advances in Cryptology — CRYPTO 2002 , 2002, Lecture Notes in Computer Science.

[7]  Jacques Stern,et al.  Threshold Ring Signatures and Applications to Ad-hoc Groups , 2002, CRYPTO.

[8]  Colin Boyd,et al.  Advances in Cryptology - ASIACRYPT 2001 , 2001 .

[9]  Masayuki Abe,et al.  1-out-of-n Signatures from a Variety of Keys , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[11]  Yael Tauman Kalai,et al.  How to Leak a Secret: Theory and Applications of Ring Signatures , 2001, Essays in Memory of Shimon Even.