Name
Abstract | ||
|---|---|---|
In the paper we point out that the released dataset of an association rule hiding method may have severe privacy problem since they all achieve to minimize the side effects on the original dataset. We show that an attacker can discover the hidden sensitive association rules with high confidence when there is not enough "blindage". We give a detailed analysis of the attack and propose a novel association rule hiding metric, K-anonymous. Based on the K-anonymous metric, we present a framework to hide a group of sensitive association rules while it is guaranteed that the hidden rules are mixed with at least other K-1 rules in the specific region. Several heuristic algorithms are proposed to achieve the hiding process. Experiment results are reported to show the effectiveness and efficiency of the proposed approaches. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1755688.1755726 | Computer and Communications Security |
Keywords | Field | DocType |
association rule hiding,detailed analysis,sensitive association rule,original dataset,k-anonymity,novel association rule,k-anonymous association rule hiding,association rule hiding method,hidden rule,hidden sensitive association rule,k-1 rule,hiding process,association rule,side effect,heuristic algorithm | Data mining,Heuristic,Computer security,Computer science,k-anonymity,Association rule learning,Association rule hiding | Conference |
Citations | PageRank | References |
9 | 0.66 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zutao Zhu | 1 | 77 | 4.56 |
| wenliang du | 2 | 4906 | 241.77 |