Anon-Pass: Practical Anonymous Subscriptions.
Anon-Pass: Practical Anonymous Subscriptions.
复制标题
DOI：
10.1109/sp.2013.29
复制
发表时间：
2013-12-31
期刊：
影响因子：
--
通讯作者：
Witchel E
中科院分区：
文献类型：
--
作者：
Lee MZ;Dunn AM;Katz J;Waters B;Witchel E
我们介绍匿名订阅服务的设计、安全证明和实现。用户通过提供某种形式的身份来注册服务，该身份可能会或可能不会链接到现实世界的身份，例如信用卡、网络登录或公钥。用户通过出示从注册时收到的信息派生的凭证来登录系统。每个凭证仅允许在任何身份验证窗口或时期内进行一次登录。登录是匿名的，因为服务无法比随机猜测更好地区分哪个用户正在登录。这意味着用户在不同登录中不可链接。我们发现，匿名订阅服务中的一个核心矛盾是服务提供商对长纪元的渴望（以减少服务器端计算）与用户对短纪元的渴望（以便他们可以反复“重新匿名化”其会话）。我们通过较短的时期来平衡这种紧张关系，但为不需要不可链接性的客户添加高效的操作，以便在下一个时间段以廉价的方式重新验证自己的身份。我们测量协议研究原型的性能，该协议允许独立服务提供对现有服务的匿名访问。我们实现了音乐服务、基于 Android 的地铁通行证应用程序和 Web 代理，并表明添加匿名性可将客户端延迟降至最低，并且每个活动用户仅需要 33 KB 的服务器内存。
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.