Linkable Ring Signature with Unconditional Anonymity
- 25 January 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 26 (1), 157-165
- https://doi.org/10.1109/tkde.2013.17
Abstract
In this paper, we construct a linkable ring signature scheme with unconditional anonymity. It has been regarded as an open problem in [22] since 2004 for the construction of an unconditional anonymous linkable ring signature scheme. We are the first to solve this open problem by giving a concrete instantiation, which is proven secure in the random oracle model. Our construction is even more efficient than other schemes that can only provide computational anonymity. Simultaneously, our scheme can act as an counterexample to show that [19, Theorem 1] is not always true, which stated that linkable ring signature scheme cannot provide strong anonymity. Yet we prove that our scheme can achieve strong anonymity (under one of the interpretations).Keywords
This publication has 21 references indexed in Scilit:
- Efficient Linkable and/or Threshold Ring Signature Without Random OraclesThe Computer Journal, 2012
- Enforcing Role-Based Access Control for Secure Data Storage in the CloudThe Computer Journal, 2011
- Linkable Ring Signatures from Linear Feedback Shift RegisterPublished by Springer Science and Business Media LLC ,2007
- Efficient Ring Signatures Without Random OraclesPublished by Springer Science and Business Media LLC ,2007
- Short Linkable Ring Signatures for E-Voting, E-Cash and AttestationLecture Notes in Computer Science, 2005
- Anonymous Identification in Ad Hoc GroupsLecture Notes in Computer Science, 2004
- Stability analysis of regional and national voting schemes by a continuous modelIEEE Transactions on Knowledge and Data Engineering, 2003
- On the RS-Code Construction of Ring Signature Schemes and a Threshold Setting of RSTLecture Notes in Computer Science, 2003
- Efficient group signature schemes for large groupsLecture Notes in Computer Science, 1997
- A new dynamic voting algorithm for distributed database systemsIEEE Transactions on Knowledge and Data Engineering, 1994