Fast revocation of attribute-based credentials for both users and verifiers

Lueks, Wouter; Alpár, Gergely; Hoepman, Jaap-Henk; Vullers, Pim

doi:10.1016/j.cose.2016.11.018

Cited by 15 publications

(17 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme by Lueks et al [24] constrains the usage of revocation tokens to a specific time epoch and verifier. Revocation checks are performed with epoch specific revocation lists downloaded from a semi-trusted party.…”

Section: Related Workmentioning

confidence: 99%

Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation

Hölzl¹,

Roland²,

Mir³

et al. 2019

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Providing methods to anonymously validate user identity is essential in many applications of electronic identity (eID) systems. A feasible approach to realize such a privacy-preserving eID is the usage of group signature protocols or pseudonym-based signatures. However, providing a revocation mechanism that preserves privacy is often the bottleneck for the scalability of such a system. In order to bridge this gap between practicability and privacy, we propose a new pseudonym-based mobile eID signature scheme suitable for smart cards and secure elements that also enables efficient and scalable revocation checks. By using a pseudorandom function, we derive one-time verification tokens used for identity verification as well as revocation checks and generate proofs of validity using a new method referred to as disposable dynamic accumulators. Our scheme preserves unlinkability and anonymity of the eID holder even beyond revocation and does not require online connectivity to a trusted party for verification and revocation checks.

show abstract

Section: Related Workmentioning

confidence: 99%

Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation

Hölzl¹,

Roland²,

Mir³

et al. 2019

Int. J. Inf. Secur.

View full text Add to dashboard Cite

show abstract

“…The size of the revocation token per user is also linear with the total number of pseudonyms, which makes it challenging to use short epochs. On the other hand, unlike [55,56], SRBE does not require centralized computations for revocation management and unlike [46], SRBE supports backward unlinkability and constant sized revocation tokens.…”

Section: Revocation In Group Signaturesmentioning

confidence: 99%

“…Expensive revocation check has been a major performance bottleneck for anonymous credential schemes as well. In [55,56], authors proposed an efficient VLR mechanism for anonymous credential systems supporting backward unlinkability. To generate and distribute the revocation list for an epoch, it requires O(R) exponentiation operations of large numbers (expensive) at the revocation authority's end.…”

Section: Revocation In Group Signaturesmentioning

confidence: 99%

Provably Secure Anonymous-yet-Accountable Crowdsensing with Scalable Sublinear Revocation

Rahaman

Cheng

Yao

et al. 2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Group signature schemes enable anonymous-yetaccountable communications. Such a capability is extremely useful for applications, such as smartphone-based crowdsensing and citizen science. However, the performance of modern group signature schemes is still inadequate to manage large dynamic groups. In this paper, we design the first provably secure verifier-local revocation (VLR) -based group signature scheme that supports sublinear revocation, named Sublinear Revocation with Backward unlinkability and Exculpability (SRBE). To achieve this performance gain, SRBE introduces time bound pseudonyms for the signer. By introducing lowcost short-lived pseudonyms with sublinear revocation checking, SRBE drastically improves the efficiency of the groupsignature primitive. The backward-unlinkable anonymity of SRBE guarantees that even after the revocation of a signer, her previously generated signatures remain unlinkable across epochs. This behavior favors the dynamic nature of real-world crowdsensing settings. We prove its security and discuss parameters that influence its scalability. Using SRBE, we also implement a prototype named GROUPSENSE for anonymousyet-accountable crowdsensing, where our experimental findings confirm GROUPSENSE's scalability. We point out the open problems remaining in this space.

show abstract

“…The revocation scheme [17] for IRMA authentication that has been proposed by the IRMA design team avoids identifiers in revocation that would enable linking the revocation checks to a single user. This scheme involves a semi-trusted party in the system, a Revocation Authority (RA) that is responsible for revoking the credentials.…”

Section: Revocation Of Credentials In Irmamentioning

confidence: 99%

“…In the existing IRMA-revocation scheme [17] the time is split into epochs (time intervals) and the RA chooses a generator for each epoch and each verifier. When a credential is revoked the RA makes a global revocation list RL that consists of revocation tokens R i1..n that are computed from the generators and the individual revocation values of the credential holders.…”

Section: Revocation Of Credentials In Irmamentioning

confidence: 99%

Towards Practical Attribute-Based Signatures

Hampiholi

Alpár

Broek

et al. 2015

Security, Privacy, and Applied Cryptography Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. An attribute-based signature (ABS) is a special digital signature created using a dynamic set of issued attributes. For instance, a doctor can sign a medical statement with his name, medical license number and medical speciality. These attributes can be verified along with the signature by any verifier with the correct public keys of the respective attribute issuers. This functionality not only makes ABS a much more flexible alternative to the standard PKI-based signatures, but also offers the ability to create privacy-preserving signatures. However, none of the ABS constructions presented in the literature is practical or easily realizable. In fact, to the best of our knowledge, there is currently no ABS implementation used in practice anywhere. This is why we put forward a new ABS technique based on the IRMA attribute-based authentication. IRMA already has an efficient and practical smart-card implementation, and an experimental smart-phone implementation too. They are currently used in several pilot projects. In this paper, we propose an ABS scheme based on the existing IRMA technology, extending the currently available IRMA devices with ABS functionality. We study the practical issues that arise due to the introduction of the signature functionality to an existing attribute-based authentication scheme, and we propose possible cryptographic and infrastructural solutions. We also discuss use cases and implementation aspects.

show abstract

Fast revocation of attribute-based credentials for both users and verifiers

Cited by 15 publications

References 29 publications

Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation

Disposable dynamic accumulators: toward practical privacy-preserving mobile eIDs with scalable revocation

Provably Secure Anonymous-yet-Accountable Crowdsensing with Scalable Sublinear Revocation

Towards Practical Attribute-Based Signatures

Contact Info

Product

Resources

About