Privacy enhancing profile disclosure

被引:0
作者
Dornbach, P [1 ]
Németh, Z [1 ]
机构
[1] Software Technol Lab, Nokia Res Ctr, H-1092 Budapest, Hungary
来源
PRIVACY ENHANCING TECHNOLOGIES | 2003年 / 2482卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
To offer personalized services on the web and on mobile devices, service providers want to have as much information about their users as possible. In the ideal case, the user controls how much of this information is revealed during a transaction. This is a tradeoff between privacy and personalization: if the disclosed profile is too complex, it may become a pseudonym for the user, making it possible to recognize the user at a later time and link different revealed profile parts into one comprehensive profile of the individual. This paper introduces a model for profiles and analyzes it with the methods of probability theory: how much information is revealed and what is the the user's probability of staying anonymous. The paper examines how likely it is that a provider can link different disclosed profiles and recommends algorithms to avoid a possible privacy compromise.
引用
收藏
页码:85 / 98
页数:14
相关论文
共 14 条
[1]  
ALAMAKI T, 2002, PRIV ENH SERV ARCH
[2]  
BREESE JS, 1998, P 14 C UNC ART INT J
[3]  
Chaum D. L., 1981, UNTRACEABLE ELECT MA
[4]  
CHICKERING DM, 1997, P 13 C UNC ART INT
[5]  
CLARKE R, 1999, IDENTIFIED ANONYMOUS
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]  
GOLDBERG IA, 2000, THESIS U CALIF, P7
[8]  
Jakobsson Markus, EUROCRYPT 98
[9]  
PFITZMANN A, 2000, ANONYMITY UNOBSERVAB
[10]  
RAO JR, 2000, P 9 US SEC S DENV CO