Practical revocable anonymous credentials

Authors:
Jan Hajny;Lukas Malina
Affiliations:
Department of Telecommunications, Brno University of Technology, Brno, Czech Republic;Department of Telecommunications, Brno University of Technology, Brno, Czech Republic
Venue:
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Year:
2012

Citing 1
Cited 1

An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms

CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications

Unlinkable attribute-based credentials with practical revocation on smart-cards

CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Currently, there are many solutions for authentication. Mostly, the authentication protocols based on traditional cryptographic constructions, such as digital signatures, hash functions and symmetric encryption schemes, are used. To provide more privacy protection, credential systems were introduced. Using these systems, users can anonymously prove that they possess some attributes. The attributes can represent anything from the age of users to their citizenship or, e.g., driving license possession. The main problem of these systems is revocation since it is currently impossible to efficiently revoke invalid users, attackers or users who use stolen identities. In this paper, a novel conception for anonymous credentials with practical revocation is proposed.