You are looking at a specific version 20161117:021624 of this paper. See the latest version.

Paper 2016/1073

Group Signatures with Linking-Based Revocation: A Pragmatic Approach for Efficient Revocation Checks

Daniel Slamanig and Raphael Spreitzer and Thomas Unterluggauer

Abstract

Group signatures represent an important mechanism for privacy-preserving applications. However, their practical applicability is restricted due to inefficiencies of existing membership revocation mechanisms that place a computational burden and communication overhead on signers and verifiers. In particular, it seems that the general belief (or unwritten law) of avoiding online authorities by all means artificially and unnecessarily restricts the efficiency and practicality of revocation mechanisms in group signature schemes. While a mindset of preventing online authorities might have been appropriate more than 10 years ago, today the availability of highly reliable cloud computing infrastructures could be used to solve open challenges. More specifically, in order to overcome the inefficiencies of existing revocation mechanisms, we propose an alternative approach denoted as linking-based revocation (LBR). The novelty of LBR is its transparency for signers and verifiers that spares additional computations as well as updates. We introduce dedicated revocation authorities (RAs) that can be contacted for efficient (constant time) revocation checks. In order to protect these RAs and to reduce the trust in these authorities, we also introduce distributed controllable linkability such that RAs need to cooperate with multiple authorities to compute the required linking/revocation tokens. Besides efficiency, an appealing benefit of LBR is its generic applicability to pairing-based GSSs secure in the BSZ model and GSSs with controllable linkability. This includes the XSGS scheme, and the GSSs proposed by Hwang et al., one of which has been standardized in the recent ISO 20008-2 standard.

Note: This paper will appear in the post-proceedings of the International Conference on Cryptology & Malicious Security 2016 (Mycrypt 2016), which seeks submissions in the context of paradigm-shifting crypto and unconventional solutions to existing problems. As there is still time to prepare the conference version of this paper, we would appreciate any comments on this somehow unconventional proposal of using an online revocation authority to achieve efficient revocation in group signature schemes.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. International Conference on Cryptology & Malicious Security 2016 (Mycrypt 2016)
Keywords
Group signaturescontrollable linkabilitylinking-based revocationefficient revocation mechanism
Contact author(s)
raphael spreitzer @ iaik tugraz at
History
2017-07-19: revised
2016-11-17: received
See all versions
Short URL
https://ia.cr/2016/1073
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.