3

Based on this theoretical work of Latanya Sweeney about k-anonymity:

Definition 2.1 (Quasi-Identifier)

Let be a table. A quasi-identifier of is a set of attributes whose release must be controlled.

Definition 2.2 (k-anonymity)

Let be a table and be the quasi-identifiers associated with it. is said to satisfy k-anonymity if for each quasi-identifier each sequence of values in appears at least with occurrences in .


Can anyone approve these next assumptions on an object-oriented approach?

Definition 1.1 (object-table)

Let and be a table and a mapping from the original table to the object-table .

Definition 1.2 (oject-space)

Let there be a space of all alterations of one object-attribute and a space of functions mapping between those.

Definition 1.2b

and so is the non-anonymizing-function.

Definition 1.3 (quasi-identifier)

Let be a the qausi-identifier regarding the space as

Definition 1.4

Let be a second table and be the quasi-identifiers associated with it. is said to satisfy k-anonymity if for each quasi-identifier each sequence of values in appears at least with occurrences in .

So there is a bridge between the k-anonymity and the k-anonymity inbetween space of attributes and their anonymisations

Ben H
  • 435
  • 5
  • 15

0 Answers0