Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Dewri, Rinkua | Ray, Indrajitb; * | Ray, Indrakshib | Whitley, Darrellb
Affiliations: [a] Department of Computer Science, University of Denver, Denver, CO, USA. Email: rdewri@cs.du.edu | [b] Department of Computer Science, Colorado State University, Fort Collins, CO, USA. E-mails: indrajit@cs.colostate.edu, iray@cs.colostate.edu, whitley@cs.colostate.edu
Correspondence: [*] Corresponding author: Indrajit Ray, 1873 Campus Delivery, Department of Computer Science, Colorado State University, Fort Collins, CO 80523-1873, USA. Tel.: +1 970 491 7097; Fax: +1 970 491 2466; E-mail: indrajit@cs.colostate.edu.
Abstract: Data anonymization techniques have received extensive attention in the privacy research community over the past several years. Various models of privacy preservation have been proposed: k-anonymity, ℓ-diversity and t-closeness, to name a few. An oft-cited drawback of these models is that there is considerable loss in data quality arising from the use of generalization and suppression techniques. Optimization attempts in this context have so far focused on maximizing the data utility for a pre-specified level of privacy. To determine if better privacy levels are obtainable with the same level of data utility, majority of the existing formulations require exhaustive analysis. Further, the data publisher's perspective is often missed in the process. The publisher wishes to maintain a given level of data utility (since the data utility is the revenue earner) and then maximize the level of privacy within acceptable limits. In this paper, we explore this privacy versus data quality trade-off as a multi-objective optimization problem. Our goal is to provide substantial information to a data publisher about the trade-offs available between the privacy level and the information content of an anonymized data set.
Keywords: Privacy, data utility, multi-objective optimization, cost-benefit analysis
DOI: 10.3233/JCS-2011-0428
Journal: Journal of Computer Security, vol. 19, no. 5, pp. 935-974, 2011
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl