Research on Anonymity Measure

Luming Yang · Journal of Chinese Computer Systems · 2008

Some typical anonymity measures are introduced and compared in this paper,which points out that neither the entropy measure nor the θ-method can accurately the difficulty for anonymity attacker.Based on the analysis,a new anonymity measure based on the entropy value of partial members is proposed.In the new measure,on the premise of the attack being effective,the definition of close anonymity set is given and a new metric for anonymity evaluation is proposed considering the number of members,sum of and distribution of probability in the close anonymity set.The idea of the new measure is discussed detailedly in this paper.The results of analysis and calculation show that the new measure can well explain the fact that elimination is always used in practical attacks and only the objects with relative large adjacent probability could confuse the attacker's decisions,which is a preferable measure for anonymity evaluation.

Read the paper · More papers on PaperTik