Anon-Pass: Practical Anonymous Subscriptions
Date: May 2013
Publication: 34th IEEE Symposium on Security and Privacy, SP '13
Source 1: https://www.cs.utexas.edu/~adunn/pubs/lee13oakland-anonpass-full.pdf
Source 2: http://z.cs.utexas.edu/users/osa/anon-pass/pubs/lee_sp13.pdf
Source 3: http://z.cs.utexas.edu/users/osa/anon-pass/pubs/lee_sp13_fullversion.pdf
Abstract or Summary:
We present the design, security proof, and implementation of an anonymous subscription service. Users register for the service by providing some form of identity, which might or might not be linked to a real-world identity such as a credit card, a web login, or a public key. A user logs on to the system by presenting a credential derived from information received at registration. Each credential allows only a single login in any authentication window, or epoch. Logins are anonymous in the sense that the service cannot distinguish which user is logging in any better than random guessing. This implies unlinkability of a user across different logins.
We find that a central tension in an anonymous subscription service is the service provider’s desire for a long epoch (to reduce server-side computation) versus users’ desire for a short epoch (so they can repeatedly “re-anonymize” their sessions). We balance this tension by having short epochs, but adding an efficient operation for clients who do not need unlinkability to cheaply re-authenticate themselves for the next time period.
We measure performance of a research prototype of our protocol that allows an independent service to offer anonymous access to existing services. We implement a music service, an Android-based subway-pass application, and a web proxy, and show that adding anonymity adds minimal client latency and only requires 33 KB of server memory per active user.
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.