Toggle Main Menu Toggle Search

Open Access padlockePrints

Efficient attributes for anonymous credentials

Lookup NU author(s): Professor Thomas Gross


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves upon existing approaches, which suffer from a linear number of modular exponentiations in the total number of attributes. This limitation makes them unfit for many practical applications, such as electronic identity cards. Our novel approach can incorporate a large number of binary and finite-set attributes without significant performance impact. It compresses all such attributes into a single attribute base and, thus, boosts the efficiency of all proofs of possession. The core idea is to encode discrete binary and finite-set values as prime numbers. We then use the divisibility property for efficient proofs of their presence or absence. In addition, we contribute efficient methods for conjunctions and disjunctions. The system builds on the strong RSA assumption. We demonstrate the aptness of our method in realistic application scenarios, notably electronic identity cards, and show its advantages for small devices, such as smartcards and cell phones.

Publication metadata

Author(s): Camenisch J, Gross T

Publication type: Article

Publication status: Published

Journal: ACM Transactions on Information and System Security (TISSEC)

Year: 2012

Volume: 15

Issue: 1

Print publication date: 01/03/2012

ISSN (print): 1094-9224

ISSN (electronic): 1557-7406

Publisher: Association for Computing Machinery, Inc.


DOI: 10.1145/2133375.2133379


Altmetrics provided by Altmetric