<?xml version="1.0" standalone="no"?>
                    <!DOCTYPE div SYSTEM "/www/backend/www-xml-443/dtd/caidaML.dtd">
                    <!-- do NOT ERASE the DOCTYPE declaration! --><div>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>URL:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<a href="http://www.cs.purdue.edu/homes/ninghui/papers/t_closeness_icde07.pdf">http://www.cs.purdue.edu/homes/ninghui/papers/t_closeness_icde07.pdf</a>
</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>ENTRY DATE:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
2008-06-16


</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>ABSTRACT:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
The k-anonymity privacy requirement for publishing microdata requires
that each equivalence class (i.e., a set of records that are
indistinguishable from each other with respect to certain identifying
attributes) contains at least k records. Recently, several authors have
recognized that k-anonymity cannot prevent attribute disclosure. The
notion of l-diversity has been proposed to address this; l- diversity
requires that each equivalence class has at least l well-represented
values for each sensitive attribute.  In this paper we show that
l-diversity has a number of limitations. In particular, it is neither
necessary nor sufficient to prevent attribute disclosure. We propose a
novel privacy notion called t-closeness, which requires that the
distribution of a sensitive attribute in any equivalence class is close
to the distribution of the attribute in the overall table (i.e., the
distance between the two distributions should be no more than a
threshold t). We choose to use the Earth Mover Distance measure for our
t-closeness requirement.  We discuss the rationale for t-closeness and
illustrate its advantages through examples and experiments.




</font>
  </td>
</tr>
</div>

