A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials

  title={A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials},
  author={David Derler and Christian H. Hanser and Daniel Slamanig},
Recently, a new paradigm to construct very efficient multi-show attribute-based anonymous credential ABC systems has been introduced in Asiacrypt'14. Here, structure-preserving signatures on equivalence classes SPS-EQ-$$\mathcal {R}$$, a novel flavor of structure-preserving signatures SPS, and randomizable polynomial commitments are elegantly combined to yield the first ABC systems with O1 credential size and O1 communication bandwidth during issuing and showing. It has, however, been left open… 
Improved Constructions of Anonymous Credentials From Structure-Preserving Signatures on Equivalence Classes
Instantiating in the CRS model, an efficient credential system, anonymous under malicious organization keys, with increased expressiveness and privacy, proven secure in the standard model is obtained.
Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials
The ABC system is the first credential system whose bandwidth required for credential showing is independent of the number of its attributes, i.e., constant-size, and strengthened game-based security definitions for ABC are proposed and proved.
Versatile ABS: Usage Limited, Revocable, Threshold Traceable, Authority Hiding, Decentralized Attribute Based Signatures
This work revisit multi-authority attribute based signatures (MA-ABS), and elaborate on the limitations of the current MA-Abs schemes to provide a hard to achieve (yet very useful) combination of features, i.e., decentralization, periodic usage limitation, dynamic revocation of users and attributes, reliable threshold traceability, and authority hiding.
Publicly Traceable Attribute-Based Anonymous Authentication and Its Application to Voting
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 is proposed, based on TABAA.
Anonymous, Attribute Based, Decentralized, Secure, and Fair e-Donation
This work proposes a novel decentralized e-donation framework that relies on a public ledger that can be realized via a distributed blockchain and instantiates it with a practical scheme employing privacy-preserving cryptocurrencies and attributebased signatures.
Structure-Preserving Signatures on Equivalence Classes From Standard Assumptions
Structure-preserving signatures on equivalence classes (SPS-EQ) introduced at ASIACRYPT 2014 are a variant of SPS where a message is considered as a projective equivalence class, and a new
PRISMACLOUD - Privacy and Security Maintaining Services in the Cloud
The PRISMACLOUD work program is complemented with activities addressing secure user interfaces, secure service composition, secure implementation in software and hardware, security certi cation, and an impact analysis from an end-user view.
Weakly Secure Equivalence-Class Signatures from Standard Assumptions
Applications of EQS include the first constant-size anonymous attribute-based credentials, efficient round-optimal blind signatures without random oracles and efficient access-control encryption.
Efficient Signatures on Randomizable Ciphertexts
The unforgeability notion for SoRC is strengthened and a scheme that provably achieves it in the generic group model is given, which is considerably more efficient than prior schemes.


Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
This work proposes unlinkable redactable signatures URS, a new building block for privacy-enhancing protocols, which is used to construct the first efficient UC-secure anonymous credential system that supports multiple issuers, selective disclosure of attributes, and pseudonyms.
Formal Treatment of Privacy-Enhancing Credential Systems
This work presents and proves secure a generic and modular construction of a PABC system from simpler building blocks, allowing for a "plug-and-play" composition based on different instantiations of the building blocks.
Algebraic MACs and Keyed-Verification Anonymous Credentials
This work constructs two algebraic MACs in prime-order groups, along with efficient protocols for issuing credentials, asserting possession of a credential, and proving statements about hidden attributes, and shows that the performance of the new schemes is competitive with U-Prove, and many times faster than Idemix.
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
This paper proposes a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption modulo a safe prime product and is considerably superior to existing ones.
Anonymous credentials light
For the first time, this work gives a provably secure construction of anonymous credentials that can work in the elliptic group setting without bilinear pairings and is based on the DDH assumption.
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
A new dynamic accumulator scheme based on bilinear maps is proposed and shown how to apply it to the problem of revocation of anonymous credentials, believed to be the first authentication system offering privacy protection suitable for implementation with electronic tokens such as eID cards or drivers' licenses.
Structure-Preserving Signatures on Equivalence Classes and their Application to Anonymous Credentials
This paper introduces a new type of structure-preserving signatures, which allows to sign group element vectors and to consistently randomize signatures and messages without knowledge of any secret.
EUF-CMA-Secure Structure-Preserving Signatures on Equivalence Classes
This work provides an EUF-CMA-secure construction of an SPS-EQ scheme, which is also more efficient than the original construction in every respect, and proves the scheme secure in the generic group model for Type-3 bilinear groups.
Efficient Proofs of Attributes in Pairing-Based Anonymous Credential System
This paper shows how to achieve the constant complexity in a pairing-based anonymous credential system excluding the RSA by using zero-knowledge proofs of Pairing-based certificates and accumulators to prove AND and OR relations with Constant complexity in the number of finite-set attributes.
Decentralized Anonymous Credentials
This work proposes a novel anonymous credential scheme that eliminates the need for a trusted credential issuer and provides a proof of security for a basic anonymous credential system that allows users to make flexible identity assertions with strong privacy guarantees without relying on trusted parties.