Anon-Pass: Practical Anonymous Subscriptions.

Michael Z Lee, Alan M Dunn, Jonathan Katz, Brent Waters, Emmett Witchel
{"title":"Anon-Pass: Practical Anonymous Subscriptions.","authors":"Michael Z Lee,&nbsp;Alan M Dunn,&nbsp;Jonathan Katz,&nbsp;Brent Waters,&nbsp;Emmett Witchel","doi":"10.1109/SP.2013.29","DOIUrl":null,"url":null,"abstract":"<p><p>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 <i>epoch</i>. 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.</p>","PeriodicalId":90300,"journal":{"name":"Proceedings. IEEE Symposium on Security and Privacy","volume":"2013 ","pages":"319-333"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/SP.2013.29","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Symposium on Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SP.2013.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

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.

Abstract Image

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Anon-Pass:实用匿名订阅。
我们介绍了一个匿名订阅服务的设计、安全证明和实现。用户通过提供某种形式的身份来注册服务,这些身份可能与真实世界的身份(如信用卡、web登录或公钥)相关联,也可能不关联。用户通过出示从注册时收到的信息派生的凭据登录系统。每个凭据只允许在任何身份验证窗口或epoch中进行一次登录。登录是匿名的,因为服务无法区分哪个用户正在登录,比随机猜测要好得多。这意味着用户跨不同登录的不可链接性。我们发现,匿名订阅服务的核心矛盾在于服务提供商希望获得较长的epoch(以减少服务器端计算),而用户希望获得较短的epoch(以便他们可以反复“重新匿名化”他们的会话)。我们通过缩短时间来平衡这种紧张关系,但为不需要不可链接性的客户增加了一个有效的操作,以便为下一个时间段廉价地重新验证自己。我们测量了协议的研究原型的性能,该原型允许一个独立的服务提供对现有服务的匿名访问。我们实现了一个音乐服务、一个基于android的地铁通行证应用程序和一个web代理,并表明添加匿名功能可以最小化客户端延迟,并且每个活跃用户只需要33 KB的服务器内存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distance-Bounding Protocols: Verification without Time and Location Anon-Pass: Practical Anonymous Subscriptions. Reflections on the 30th Anniversary of the IEEE Symposium on Security and Privacy SecureWorld Expo 2005 Programming languages and systems security
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1