Privacy-Preserving User-Auditable Pseudonym Systems

被引:11
作者
Camenisch, Jan [1 ]
Lehmann, Anja [1 ]
机构
[1] IBM Res Zurich, Zurich, Switzerland
来源
2017 IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P) | 2017年
关键词
MULTIPARTY COMPUTATION; SECURE COMPUTATION; ENCRYPTION; PROOFS;
D O I
10.1109/EuroSP.2017.36
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Personal information is often gathered and processed in a decentralized fashion. Examples include health records and governmental data bases. To protect the privacy of individuals, no unique user identifier should be used across the different databases. At the same time, the utility of the distributed information needs to be preserved which requires that it be nevertheless possible to link different records if they relate to the same user. Recently, Camenisch and Lehmann (CCS 15) have proposed a pseudonym scheme that addresses this problem by domain-specific pseudonyms. Although being unlinkable, these pseudonyms can be converted by a central authority (the converter). To protect the users' privacy, conversions are done blindly without the converter learning the pseudonyms or the identity of the user. Unfortunately, their scheme sacrifices a crucial privacy feature: transparency. Users are no longer able to inquire with the converter and audit the flow of their personal data. Indeed, such auditability appears to be diametral to the goal of blind pseudonym conversion. In this paper we address these seemingly conflicting requirements and provide a system where user-centric audits logs are created by the oblivious converter while maintaining all privacy properties. We prove our protocol to be UC-secure and give an efficient instantiation using novel building blocks.
引用
收藏
页码:269 / 284
页数:16
相关论文
共 26 条
[1]  
Abdalla M, 2010, LECT NOTES COMPUT SC, V5978, P480, DOI 10.1007/978-3-642-11799-2_28
[2]  
Ateniese G., 2005, IACR CRYPTOLOGY EPRI, V2005, P385
[3]  
Barak B, 2005, LECT NOTES COMPUT SC, V3621, P361
[4]  
Belenkiy M, 2009, LECT NOTES COMPUT SC, V5677, P108, DOI 10.1007/978-3-642-03356-8_7
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P223
[6]  
Camenisch J, 2003, LECT NOTES COMPUT SC, V2729, P126
[7]  
Camenisch J, 1997, LECT NOTES COMPUT SC, V1294, P410
[8]   (Un)linkable Pseudonyms for Governmental Databases [J].
Camenisch, Jan ;
Lehmann, Anja .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :1467-1479
[9]  
Camenisch J, 2009, LECT NOTES COMPUT SC, V5479, P425, DOI 10.1007/978-3-642-01001-9_25
[10]  
Canetti R., 2000, IACR Cryptology ePrint Archive, V2000, P67