Abstract
Providing methods to anonymously validate the user's identity is essential in many applications of electronic identity (eID) systems. A feasible approach to realize such a privacy-preserving eID is the usage of group signature protocols or pseudonym-based signatures. However, providing a revocation mechanism that preserves privacy is often the bottleneck for the scalability of such schemes. In order to bridge this gap between practicability and privacy, we propose a scalable and efficient revocation scheme suitable for smart cards in a mobile eID architecture. By using a pseudo-random function, we derive one-time revocation tokens for the revocation check and generate proofs of validity using a new method referred to as disposable dynamic accumulators. Our scheme thereby preserves unlinkability and anonymity of the eID holder even beyond revocation and does not require online connectivity to a trusted party for the verification and revocation check.
Original language | English |
---|---|
Title of host publication | Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018 |
Publisher | ACM Press |
Pages | 1601-1609 |
Number of pages | 9 |
ISBN (Electronic) | 9781450351911 |
DOIs | |
Publication status | Published - 9 Apr 2018 |
Event | 33rd ACM Symposium on Applied Computing - Pau, France Duration: 9 Apr 2018 → 13 Apr 2018 https://www.sigapp.org/sac/sac2018/ |
Publication series
Name | Proceedings of the ACM Symposium on Applied Computing |
---|
Workshop
Workshop | 33rd ACM Symposium on Applied Computing |
---|---|
Country/Territory | France |
City | Pau |
Period | 09.04.2018 → 13.04.2018 |
Internet address |
Keywords
- Electronic identities
- privacy-preserving revocation
- scalability
- dynamic accumulators
- smart cards
- Privacy-preserving revocation
- Smart cards
- Scalability
- Dynamic accumulators