Reidentification and k-anonymity: a model for disclosure risk in graphs

Details Reidentification and k-anonymity: a model for disclosure risk in graphs Reidentification and k-anonymity: a model for disclosure risk in graphs

2011-12-08

arxiv.org/abs/1112.1978v2

Computer Science

Cryptography and Security

Scientific paper

In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modelling the anonymity of a database table and we prove that n-confusion is a generalization of k- anonymity. After a short survey on the different available definitions of k- anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the non-regular case. We also introduce the more flexible concept of (k,l)-anonymous graph. Our definition of (k,l)-anonymous graph is meant to replace a previous definition of (k, l)-anonymous graph, which we here prove to have severe weaknesses. Finally we provide a set of algorithms for k-anonymization of graphs.

Affiliated with

Also associated with

No associations

Rating

Reidentification and k-anonymity: a model for disclosure risk in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reidentification and k-anonymity: a model for disclosure risk in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reidentification and k-anonymity: a model for disclosure risk in graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43127