In anonymity networks it is important to be able to measure quantitatively the guarantee that is given to the system. The degree of anonymity <math>d</math> is a device that was proposed at the 2002 Privacy Enhancing Technology (PET) conference. There were two papers that put forth the idea of using entropy as the basis for formally measuring anonymity: "Towards an Information Theoretic Metric for Anonymity", and "Towards Measuring Anonymity".
| Property | Value |
|---|
| dbpedia-owl:thumbnail
| |
| dbpprop:abstract
|
- In anonymity networks it is important to be able to measure quantitatively the guarantee that is given to the system. The degree of anonymity <math>d</math> is a device that was proposed at the 2002 Privacy Enhancing Technology (PET) conference. There were two papers that put forth the idea of using entropy as the basis for formally measuring anonymity: "Towards an Information Theoretic Metric for Anonymity", and "Towards Measuring Anonymity". The ideas presented are very similar with minor differences in the final definition of <math>d</math>.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:reference
| |
| rdf:type
| |
| rdfs:comment
|
- In anonymity networks it is important to be able to measure quantitatively the guarantee that is given to the system. The degree of anonymity <math>d</math> is a device that was proposed at the 2002 Privacy Enhancing Technology (PET) conference. There were two papers that put forth the idea of using entropy as the basis for formally measuring anonymity: "Towards an Information Theoretic Metric for Anonymity", and "Towards Measuring Anonymity".
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:depiction
| |
| foaf:page
| |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
