On computational anonymity

摘要: The concern of data privacy is to mask so that they can be transferred untrusted third parties without leaking confidential individual information. In this work we distinguish between theoretical anonymity and computational anonymity. We present a relaxation k-anonymity, called (k,l)-anonymity, which makes sense when it assumed the knowledge an adversary limited. (k,l)-Anonymity also regarded as quantification in terms adversary's limitations. Combinatorics, or more precisely, hypergraphs, are used represent relations (k,l)-anonymous table. Finally, algorithm for (k,l)-anonymization tables.