K-anonymity
Property of a dataset in which the information for each individual in the dataset can’t be distinguished from at least k−1 individuals whose information also appear in the release
k-anonymity is a property possessed by certain anonymized data. The term k-anonymity was first introduced by Pierangela Samarati and Latanya Sweeney in a paper published in 1998, although the concept dates to a 1986 paper by Tore Dalenius. k-anonymity is an attempt to solve the problem "Given person-specific field-structured data, produce a release of the data with scientific guarantees that the individuals who are the subjects of the data cannot be re-identified while the data remain practically useful."
Nº Q17061432 ★
Common · Knowledge
K-anonymity
Property of a dataset in which the information for each individual in the dataset can’t be distinguished from at least k−1 individuals whose information also appear in the release
k-anonymity is a property possessed by certain anonymized data. The term k-anonymity was first introduced by Pierangela Samarati and Latanya Sweeney in a paper published in 1998, although the concept dates to a 1986 paper by Tore Dalenius. k-anonymity is an attempt to solve the problem "Given person-specific field-structured data, produce a release of the data with scientific guarantees that the individuals who are the subjects of the data cannot be re-identified while the data remain practically useful."
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
k-anonymity is a property possessed by certain anonymized data. The term k-anonymity was first introduced by Pierangela Samarati and Latanya Sweeney in a paper published in 1998, although the concept dates to a 1986 paper by Tore Dalenius. k-anonymity is an attempt to solve the problem "Given person-specific field-structured data, produce a release of the data with scientific guarantees that the individuals who are the subjects of the data cannot be re-identified while the data remain practically useful." A release of data is said to have the k-anonymity property if the information for each person contained in the release cannot be distinguished from at least k − 1 {\displaystyle k-1} individuals whose information also appears in the release. The guarantees provided by k-anonymity are aspirational, not mathematical.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Data anonymization
Use of information sanitization to redact identifiable information
Nº Q17006654 ★
Anagnorisis
Moment in a play or other work when a character makes a critical discovery
Nº Q483998 ★★★
Social alienation
Condition in social relationships
Nº Q545825 ★★★
Proof of stake
Blockchain consensus algorithm class and instance based on count of owned units
Nº Q17083510 ★★
Nominative determinism
Hypothesis that people tend to gravitate towards areas of work that fit their name
Nº Q29043579 ★★★
Toponymy
Branch of onomastics, study of place names
Nº Q485762 ★★★