robust de-anonymization of large datasets (arXiv)

Sarad AV jtrjtrjtr2001 at yahoo.com
Mon Nov 26 20:31:04 PST 2007


The attack is possible because of the structure of the
database. section 3 of the paper goes as-" Define
database D to be a N*M matrix where each row is a
record associated with an individual..."

had the attributes been randomized across individuals,
it would not be possible to tie up the attributes to
any specific user.

Nevertheless, it is very handy for law enforcement,
with lots of mined data.

Sarad.


--- Eugen Leitl <eugen at leitl.org> wrote:

> 	http://arxiv.org/PS_cache/cs/pdf/0610/0610105v2.pdf
> 
> Robust De-anonymization of Large Datasets
> (How to Break Anonymity of the Netflix Prize
> Dataset)
> 
>



      ____________________________________________________________________________________
Be a better sports nut!  Let your teams follow you 
with Yahoo Mobile. Try it now.  http://mobile.yahoo.com/sports;_ylt=At9_qDKvtAbMuh1G1SQtBI7ntAcJ





More information about the cypherpunks-legacy mailing list