|
|
|
     |
                                     |
Return to Security and Privacy
to limit privacy breaches without knowledge of the data distribution. Next, we address the problem that the amount of randomization required to avoid privacy breaches (when mining association rules) results in very long transactions. By using pseudorandom generators and carefully choosing seeds such that the desired items from the original transaction are present in the randomized transaction, we can send just the seed instead of the transaction, resulting in a dramatic drop in communication and storage cost. Finally, we define new information measures that take privacy breaches into account when quantifying the amount of privacy preserved by randomization.
@inproceedings {DBLP:conf/pods/EvfimievskiGS03, author = {Alexandre V. Evfimievski and Johannes Gehrke and Ramakrishnan Srikant}, booktitle = {PODS}, title = {Limiting privacy breaches in privacy preserving data mining.}, pages = {211-222}, year = {2003}, url = {db/conf/pods/pods2003.html#EvfimievskiGS03}, ee = {http://doi.acm.org/10.1145/773153.773174}, crossref = {conf/pods/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
