IEEE Xplore - Login

Cart | Sitemap | Help

Login


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT


Article Information

Data privacy through optimal k-anonymization Bayardo, R.J.; Rakesh Agrawal Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on Volume , Issue , 5-8 April 2005 Page(s): 217 - 228 Digital Object Identifier 10.1109/ICDE.2005.42 Summary: Data de-identification reconciles the demand for release of data for research purposes and the demand for privacy from individuals. This paper proposes and evaluates an optimization algorithm for the powerful de-identification procedure known as k-anonymization. A k-anonymized dataset has the property that each record is indistinguishable from at least k - 1 others. Even simple restrictions of optimized k-anonymity are NP-hard, leading to significant computational challenges. We present a new approach to exploring the space of possible anonymizations that tames the combinatorics of the problem, and develop data-management strategies to reduce reliance on expensive operations such as sorting. Through experiments on real census data, we show the resulting algorithm can find optimal k-anonymizations under two representative cost measures and a wide range of k. We also show that the algorithm can produce good anonymizations in circumstances where the input data or input parameters preclude finding an optimal solution in reasonable time. Finally, we use the algorithm to explore the effects of different coding approaches and problem variations on anonymization quality and performance. To our knowledge, this is the first result demonstrating optimal k-anonymization of a non-trivial dataset under a general model of the problem. » View citation and abstract



IEEE Members

Log in by entering your IEEE Web Account Username and Password. IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.



Users at Subscribing Institutions

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.



Already Purchased This Article?

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.



Guests

• Search and access Abstract records free of charge • Register for table of contents alerts • Purchase Full Text PDF documents » Learn more about subscription options or how to become an IEEE Member.

You are not logged in.

Username

Password

» Forgot your password?

Please remember to log out when you have finished your session.

You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML

Access this document

» Buy this document now

» Learn more about

subscription options

» Learn more about

purchasing articles

and standards

Learn more about IEEE Subscriptions

Help Contact Us Privacy & Security IEEE.org