The original paper on k -anonymity defined k-anonymity: A table provides k -anon

Question

The original paper on k -anonymity defined k-anonymity:

A table provides k -anonymity if attempts to link explicitly identifying information to its contents ambiguously map the information to at least k entities. A later paper defined k-anonymity slightly differently:

Each release of data must be such that every combination of values of quasi-identi ers can be indistinctly matched to at least k individuals.

1) Are these definitions the same? If the same, prove it (that is, show definition 1 implies definition 2 and vice versa). If different, give an example of a table/database that satisfies one definition but not the other.

Explanation / Answer

As per i knew the defination of k-anonymity says that, suppose we have some employee related structured data, then that structured data is said to be k-anonmity if the data and information of each employee in structured data can not be distinguished from at least "k-1" employee's whose data and information is also there in structured data.

You hav mentioned about matching with k individual, but according to me it should be "k-1" individuals

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.