A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

被引：0

作者：

Melchor, Carlos Aguilar ^{[1
]}

Cayrel, Pierre-Louis ^{[1
]}

Gaborit, Philippe ^{[1
]}

机构：

[1] Univ Limoges, XLIM DMI, F-87060 Limoges, France

来源：

POST-QUANTUM CRYPTOGRAPHY, PROCEEDINGS | 2008年 / 5299卷

关键词：

Threshold ring signature; code-based cryptography; Stern's Scheme; syndrome decoding;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Ring signatures were introduced by Rivest, Shamir and Tauman in 2001. Bresson, Stern and Szydlo extended the ring signature concept to t-out-of-N threshold ring signatures in 2002. We present in this paper a generalization of Stern's code based authentication (and signature) scheme to the case of t-out-of-N threshold ring signature. The size of our signature is in O(N) and does not depend on t. Our protocol is anonymous and secure in the random oracle model, it has a very short public key and has a complexity in O(N). This protocol is the first efficient code-based ring signature scheme and the first code-based threshold ring signature scheme. Moreover it has a better complexity than number-theory based schemes which have a complexity in O(Nt).

引用

页码：1 / 16

页数：16

共 32 条

[21] Sendrier N, 2002, MEMOIRE HABILITATION
[22] Shacham H, 2007, LECT NOTES COMPUT SC, V4450, P166
[23] HOW TO SHARE A SECRET
SHAMIR, A
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (11) : 612 - 613
[24] STERN J, 1996, IEEE T INFORM THEORY, V42, P2757
[25] STERN J, 1994, LNCS, V773
[26] Tsang PP, 2004, LECT NOTES COMPUT SC, V3348, P384
[27] The intractability of computing the minimum distance of a code
Vardy, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) : 1757 - 1766
[28] VERON P, 1995, P IEEE INT S INF THE
[29] Wong DS, 2003, LECT NOTES COMPUT SC, V2836, P34
[30] XU J, 2005, LNCS, V3325

← 1 2 3 4 →