Abstract: Several anonymous authentication schemes allow servers to revoke a misbehaving user's ability to make future accesses. Traditionally, these schemes have relied on powerful TTPs capable of deanonymizing (or linking) users' connections. Recent schemes such as Blacklistable Anonymous Credentials (BLAC) and Enhanced Privacy ID (EPID) support privacy-enhanced -- servers can revoke misbehaving users without a TTP's involvement, and without learning the revoked users' identities.In BLAC and EPID, however, the computation required for authentication at the server is linear in the size (L) of the revocation list. We propose PEREA, a new anonymous authentication scheme for which this bottleneck computation is independent of the size of the revocation list. Instead, the time complexity of authentication is linear in the size (K
Publication Year: 2008
Publication Date: 2008-10-27
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 74
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot