A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials

Derler, David; Hanser, Christian; Slamanig, Daniel

doi:10.1007/978-3-319-27239-9_4

Cited by 15 publications

(20 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the revocations of the group signature scheme and anonymous credential systems (e.g., Refs. [3], [11], [17], [21], [22], [24] shown as the related works in Section 1.4), the same approach is often adopted, where the IDs of revoked users are not hidden.…”

Section: Our Contributionsmentioning

confidence: 99%

An Efficient Revocable Delegatable Anonymous Credential System Using an Accumulator

Begum

Nakanishi

2022

Journal of Information Processing

View full text Add to dashboard Cite

For privacy-enhancing user authentication, an anonymous credential system was proposed. In the system, a user is issued a credential on attributes from an issuer, and the user can anonymously prove the ownership of the credential. As the extension, a delegatable anonymous credential (DAC) system was proposed. In the DAC system, the owner of a credential can hierarchically delegate it to another entity, who can also issue a credential to lower entities. Since intermediate issuers in the chaining credentials can be hidden, the DAC system is considered to be applied to a permissioned blockchain. Furthermore, to enable the revocation of credentials, a revocable DAC system was proposed. However, in the previously proposed revocable DAC system, an issuer, who manages the user group, has to issue the non-revocation credentials to all non-revoked users at every epoch, and thus the issuer can be in a bottleneck and the communication cost is high. In this paper, we propose a revocable DAC system using an accumulator. In the proposed system, only a single accumulator and the credential on the accumulator are published at every epoch. Thus there is no bottleneck of the issuer and the communication cost is very low.

show abstract

Section: Our Contributionsmentioning

confidence: 99%

An Efficient Revocable Delegatable Anonymous Credential System Using an Accumulator

Begum

Nakanishi

2022

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…Hébant and Pointcheval proposed [15] a TABAC scheme that allows traceability in case of abuse of credentials, but the tracing authority is needed, and they also did not consider access policy. Similarly, Hajny et al [16] presented an ABAC scheme supporting practical revocation of users, and Derler et al [17] proposed a revocable attribute-based anonymous credential (RABAC) scheme, but they cannot achieve the public traceability and hold the functionality of access control.…”

Section: 2mentioning

confidence: 99%

Publicly Traceable Attribute-Based Anonymous Authentication and Its Application to Voting

Lai

2021

Security and Communication Networks

View full text Add to dashboard Cite

Numerous anonymous authentication schemes are designed to provide efficient authentication services while preserving privacy. Such schemes may easily neglect access control and accountability, which are two requirements that play an important role in some particular environments and applications. Prior designs of attribute-based anonymous authentication schemes did not concentrate on providing full anonymity while at the same time holding public traceability. To address this problem, we formally define and present a new primitive called traceable attribute-based anonymous authentication (TABAA) which achieves (i) full anonymity, i.e., both registration and authentication cannot reveal user’s privacy; (ii) reusable credential, i.e., a registered credential can be repeatedly used without being linked; (iii) access control, i.e., only when the user’s attribute satisfies the access policy can the user be involved in authentication; and (iv) public traceability, i.e., anyone, without help from the trusted third party, can trace a misbehaving user who has authenticated two messages corresponding to a common address. Then, we formally define the security requirements of TABAA, including unforgeability, anonymity, and accountability, and give a generic construction satisfying the security requirements. Furthermore, based on TABAA, we propose the first attribute-based, decentralized, fully anonymous, publicly traceable e-voting, which enables voters to engage in a number of different voting activities without repeated registration.

show abstract

“…We briefly mention the candidate solutions in the literature. A line of work that can be useful is anonymous credential schemes [3,14,15,17,18,23,31,48] that can be utilized for proving conformation to some attribute policy while keeping the anonymity. However, they cannot be trivially modified for directly providing all requirements of the e-donation at once (e.g., fair distribution of donations among recipients).…”

Section: Related Workmentioning

confidence: 99%

“…The anonymous decentralized e-cash schemes [51,60] cannot be directly applied for the e-donation purpose, as they do not provide a mechanism for anonymous attribute-based money transfer between donors and recipients who are non-privy to each other. Also, it is non-trivial to directly combine these with the existing anonymous attribute proving techniques (e.g., anonymous credentials [14,15,17,18,23,31,48]), attribute based signatures [19,26,32,49,56,67], group signatures [5,16,27,35,55,62,71]), while satisfying the above-mentioned requirements. We note that even letting ICOs use anonymous cryptocurrencies (e.g., Zerocash [60]) does not help with all of our e-donation requirements.…”

Section: Introductionmentioning

confidence: 99%

Anonymous, Attribute Based, Decentralized, Secure, and Fair e-Donation

Biçer

Küpçü

2020

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

E-cash and cryptocurrency schemes have been a focus of applied cryptography for a long time. However, we acknowledge the continuing need for a cryptographic protocol that provides global scale, decentralized, secure, and fair delivery of donations. Such a protocol would replace central trusted entities (e.g., charity organizations) and guarantee the privacy of the involved parties (i.e., donors and recipients of the donations). In this work, we target this online donation problem and propose a practical solution for it. First, we propose a novel decentralized e-donation framework, along with its operational components and security definitions. Our framework relies on a public ledger that can be realized via a distributed blockchain. Second, we instantiate our e-donation framework with a practical scheme employing privacy-preserving cryptocurrencies and attributebased signatures. Third, we provide implementation results showing that our operations have feasible computation and communication costs. Finally, we prove the security of our e-donation scheme via formal reductions to the security of the underlying primitives.

show abstract

A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials

Cited by 15 publications

References 38 publications

An Efficient Revocable Delegatable Anonymous Credential System Using an Accumulator

An Efficient Revocable Delegatable Anonymous Credential System Using an Accumulator

Publicly Traceable Attribute-Based Anonymous Authentication and Its Application to Voting

Anonymous, Attribute Based, Decentralized, Secure, and Fair e-Donation

Contact Info

Product

Resources

About