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 Biacklistable Anonymous Credentials (BLAG) and Enhanced Privacy ID (EPID) support "privacy-enhanced revocation" servers can revoke misbehaving users without a TTP's involvement, and without learning the revoked users' identities. In BLAC and EPID, however, the coniputation required for authentication at the server is linear in tire 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 « L) of a revocation window, the number of subsequent authentications before which a user's misbehavior must be recognized if the user is to be revoked. We prove the security of our construction, and have developed a prototype implementation of PEREA to validate its efficiency experimentally.
Original language | English |
---|---|
Title of host publication | Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS'08 |
Pages | 333-343 |
Number of pages | 11 |
DOIs | |
Publication status | Published - 1 Dec 2008 |
Externally published | Yes |
Event | 15th ACM conference on Computer and Communications Security, CCS'08 - Alexandria, VA, United States Duration: 27 Oct 2008 → 31 Oct 2008 |
Conference
Conference | 15th ACM conference on Computer and Communications Security, CCS'08 |
---|---|
Country/Territory | United States |
City | Alexandria, VA |
Period | 27/10/08 → 31/10/08 |
Keywords
- Anonymous authentication
- Non-membership proofs
- Privacy-enhanced revocation
- Subjective blacklisting
ASJC Scopus subject areas
- Software
- Computer Networks and Communications