Short linkable ring signatures for e-voting, e-cash and attestation
Publication in refereed journal

CUHK Authors
Author(s) no longer affiliated with CUHK


Full Text

Times Cited
Web of Science67WOS source URL (as at 29/11/2020) Click here for the latest count

Other information
AbstractA ring signature scheme can be viewed as a group signature scheme with no anonymity revocation and with simple group setup. A linkable ring signature (LRS) scheme additionally allows anyone to determine if two ring signatures have been signed by the same group member. Recently, Dodis et al. [18] gave a short (constant-sized) ring signature scheme. We extend it to the first short LRS scheme, and reduce its security to a new hardness assumption, the Link Decisional RSA (LD-RSA) Assumption. We also extend [18]'s other schemes to a generic LRS scheme and a generic linkable group signature scheme. We discuss three applications of our schemes. Kiayias and Yung [22] constructed the first e-voting scheme which simultaneously achieves efficient tallying, public verifiability, and write-in capability for a typical voter distribution under which only a small portion writes in. We construct an e-voting scheme based on our short LRS scheme which achieves the same even for all worst-case voter distribution. Direct Anonymous Attestation (DAA) [6] is essentially a ring signature scheme with certain linking properties that can be naturally implemented using LRS schemes. The construction of an offline anonymous e-cash scheme using LRS schemes is also discussed.
All Author(s) ListTsang PP, Wei VK
Name of Conference1st Information Security Practice and Experience Conference
Start Date of Conference11/04/2005
End Date of Conference14/04/2005
Place of ConferenceSingapore
Journal nameLecture Notes in Artificial Intelligence
Detailed descriptionorganized by ISPEC,
Year2005
Month1
Day1
Volume Number3439
PublisherSPRINGER-VERLAG BERLIN
Pages48 - 60
ISBN3-540-25584-2
ISSN0302-9743
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Theory & Methods

Last updated on 2020-30-11 at 01:13