Privacy Hash Table

Privacy Hash Table

Xiaoxun Sun (Australian Council for Educational Research, Australia) and Min Li (University of Southern Queensland, Australia)
DOI: 10.4018/978-1-61350-501-4.ch005
OnDemand PDF Download:
No Current Special Offers


A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such as name, are generally removed, these databases can sometimes be joined with other public databases on attributes such as Zip code, Gender, and Age to re-identify individuals who were supposed to remain anonymous. These linking attacks are made easier by the availability of other complementary databases over the Internet. K-anonymity is a technique that prevents linking attacks by generalizing or suppressing portions of the released microdata so that no individual can be uniquely distinguished from a group of size k. In this chapter, we investigate a practical full-domain generalization model of k-anonymity and examine the issue of computing minimal k-anonymous solution. We introduce the hash-based technique previously used in mining associate rules and present an efficient and effective privacy hash table structure to derive the minimal solution. The experimental results show the proposed hash-based technique is highly efficient compared with the binary search method.
Chapter Preview

Protecting anonymity when publishing microdata has long been recognized as a problem, and there has been much recent work on computing k-anonymity for this purpose. The u-Argus system (Willenborg, 1996) was implemented to anonymize microdata but considered attribute combinations of only a limited size, so the results were not always guaranteed to be k-anonymous.

Complete Chapter List

Search this Book: