Loading...
Loading...

Go to the content (press return)

On the efficiency of revocation in RSA-based anonymous systems

Author
Fueyo, M.; Herranz, J.
Type of activity
Journal article
Journal
IEEE transactions on information forensics and security
Date of publication
2016-08-01
Volume
11
Number
8
First page
1771
Last page
1779
DOI
https://doi.org/10.1109/TIFS.2016.2559443 Open in new window
Repository
http://hdl.handle.net/2117/104254 Open in new window
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7460913 Open in new window
Abstract
The problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work. One of the preferable solutions consists in maintaining either a whitelist L-W of non-revoked users or a blacklist L-B of revoked users, and then requiring users to additionally prove, when authenticating themselves, that they are in L-W (membership proof) or that they are not in L-B (non-membership proof). Of course, these additional proofs must not break the anonymity properties of the syst...
Citation
Fueyo, M., Herranz, J. On the efficiency of revocation in RSA-based anonymous systems. "IEEE transactions on information forensics and security", 1 Agost 2016, vol. 11, núm. 8, p. 1771-1779.
Keywords
ACCUMULATORS, Anonymous authentication, CREDENTIALS, PROOFS, PROTOCOLS, RSA, SIGNATURE SCHEME, non-membership arguments, revocation
Group of research
MAK - Mathematics Applied to Cryptography

Participants

Attachments