Microdata Privacy Protection Through Permutation-Based Approaches

dc.contributor.advisorTing Yu, Committee Chairen_US
dc.contributor.advisorMunindar P. Singh , Committee Co-Chairen_US
dc.contributor.advisorPeng Ning, Committee Memberen_US
dc.contributor.advisorRada Chirkova, Committee Memberen_US
dc.contributor.authorZhang, Qingen_US
dc.date.accessioned2010-04-02T18:29:50Z
dc.date.available2010-04-02T18:29:50Z
dc.date.issued2008-03-25en_US
dc.degree.disciplineOperations Researchen_US
dc.degree.disciplineComputer Scienceen_US
dc.degree.leveldissertationen_US
dc.degree.namePhDen_US
dc.description.abstractData analysts often prefer access to data in the form of original tuples(i.e., microdata), instead of pre-aggregated statistics, since the former offers advantages in information flexibility and availability. Two problems should be addressed before releasing microdata. First, individual's privacy needs to be adequately protected. In general, the data will be anonymized before sharing. Second, the utility of the anonymized microdata should be maintained and common aggregate queries should be answered with reasonable accuracy. Most existing works on microdata anonymization are based on attribute generalization. Though popular, these approaches have limitations: the generalization of attributes make it difficult to answer typical aggregate queries with reasonable accuracy. This dissertation investigates new techniques to address the limitations of existing approaches. We propose to anonymize microdata through permutation-based approaches. In particular, we first extend existing privacy goals to better fit the protection requirement of numerical data, and develop a scheme to achieve this privacy goal through sensitive attribute permutation. Second, we propose a stronger privacy goal where an attacker can only learn from the microdata that an individual's sensitive attribute follows a pre-specified target distribution, but nothing more. We combine sensitive attribute permutation and generalization techniques to achieve this goal. To get better query answers when the target distribution is far from that of the original microdata, we further provide mechanisms to allow users to better control the tradeoff between privacy and accuracy. Third, we extend our techniques to anonymize graph data and support the accurate answering of queries that involve graph properties. Specifically, we partition the nodes and relabel (a form of permutation) the nodes within the same partition. Finally, we study anonymization techniques that can support personalized privacy, which allows individuals to flexibly control the privacy protection they desire.en_US
dc.identifier.otheretd-03202008-123703en_US
dc.identifier.urihttp://www.lib.ncsu.edu/resolver/1840.16/3411
dc.rightsI hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dis sertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.en_US
dc.subjectmicrodataen_US
dc.subjectprivacyen_US
dc.subjectsecurityen_US
dc.subjectanonymizationen_US
dc.subjectpermutationen_US
dc.titleMicrodata Privacy Protection Through Permutation-Based Approachesen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
etd.pdf
Size:
870.09 KB
Format:
Adobe Portable Document Format

Collections