Name
Abstract | ||
|---|---|---|
Nowadays, the need for privacy motivates the use of methods that allow to protect a microdata file both minimizing the disclosure risk and preserving the data utility. A very popular microdata protection method is rank swapping. Record linkage is the standard mechanism used to measure the disclosure risk of a microdata protection method. In this paper we present a new record linkage method, specific for rank swapping, which obtains more links than standard ones. The consequence is that rank swapping has a higher disclosure risk than believed up to now. Motivated by this, we present two new variants of the rank swapping method, which make the new record linkage technique unsuitable. Therefore, the real disclosure risk of these new methods is lower than the standard rank swapping. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.datak.2007.07.006 | Data Knowl. Eng. |
Keywords | Field | DocType |
disclosure risk,higher disclosure risk,popular microdata protection method,new variant,new record linkage method,new record linkage technique,new method,microdata protection method,rethinking rank,real disclosure risk,standard rank,record linkage | Data mining,Swap (computer programming),Record linkage,Information retrieval,Computer security,Computer science,Microdata (HTML) | Journal |
Volume | Issue | ISSN |
64 | 1 | 0169-023X |
Citations | PageRank | References |
43 | 1.86 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jordi Nin | 1 | 311 | 26.53 |
| Javier Herranz | 2 | 628 | 31.52 |
| Vicenç Torra | 3 | 2666 | 234.27 |