<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:09:43Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/11192" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/11192</identifier><datestamp>2026-05-14T13:49:46Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Machanavajjhala, Ashwin Kumar VenkataNaga</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-07-31T21:19:44Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-07-31T06:24:49Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-07-31T21:19:44Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/11192</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6397240</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Prof. Johannes Gehrke, Committee Chair.&#xd;
Prof. Eva Tardos, Committee Member.&#xd;
Prof. Joseph Halpern, Committee Member.&#xd;
Dr. Jayavel Shanmugasundaram, Committee Member.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Recent advances in processing and storing information has led to an explosion of data collection. Many organizations like the Census, hospitals and even search engine companies collect, analyze and distribute personal information in return for useful services. However, the collected data track entire public and private lives of individuals, thus resulting in an immense privacy risk of unauthorized disclosure.  This dissertation presents novel conceptual and practical tools to ensure privacy of individuals while enabling the dissemination of valuable data about humans to improve their lives. Our contributions include novel formal definitions of the privacy risk arising from unauthorized disclosure, and practical algorithms for enforcing these definitions of privacy.&#xd;
&#xd;
We consider two distinct settings of data dissemination that require different notions of privacy. In the first part of this dissertation, we consider a setting where no sensitive information should be disclosed. We consider the problem of deciding whether answering a query on a relational database leads to any disclosure of sensitive information. This problem was shown to be intractable; we propose practical algorithms for a reasonably large set of query classes.&#xd;
&#xd;
In the second part of the dissertation, we consider the problem of publishing  ``anonymous'' aggregate information about populations of individuals while preserving the privacy of individual-specific information. We present a novel framework for reasoning about the privacy risk in this setting. We also propose the first formal privacy definition and practical algorithms for publishing ``anonymous'' data that provably guarantees privacy of the individuals contributing to the data while releasing useful aggregate information. We also present a case study of applying formal privacy definitions to a real Census data publishing application.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Privacy</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Databases</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">K-Anonymity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">L-Diversity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Access Control</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Anonymous Data Publishing</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Defining and Enforcing Privacy in Data Sharing</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Machanavajjhala, Ashwin Kumar VenkataNaga</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="afcfce2a-a6f9-44d0-a5f6-3c7094f47553">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Defining and Enforcing Privacy in Data Sharing&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008-07-31T21:19:44Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Machanavajjhala, Ashwin Kumar VenkataNaga&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Privacy&lt;/Keyword>
    &lt;Keyword>Databases&lt;/Keyword>
    &lt;Keyword>K-Anonymity&lt;/Keyword>
    &lt;Keyword>L-Diversity&lt;/Keyword>
    &lt;Keyword>Access Control&lt;/Keyword>
    &lt;Keyword>Anonymous Data Publishing&lt;/Keyword>
   	&lt;Abstract>Recent advances in processing and storing information has led to an explosion of data collection. Many organizations like the Census, hospitals and even search engine companies collect, analyze and distribute personal information in return for useful services. However, the collected data track entire public and private lives of individuals, thus resulting in an immense privacy risk of unauthorized disclosure.  This dissertation presents novel conceptual and practical tools to ensure privacy of individuals while enabling the dissemination of valuable data about humans to improve their lives. Our contributions include novel formal definitions of the privacy risk arising from unauthorized disclosure, and practical algorithms for enforcing these definitions of privacy.&#xd;
&#xd;
We consider two distinct settings of data dissemination that require different notions of privacy. In the first part of this dissertation, we consider a setting where no sensitive information should be disclosed. We consider the problem of deciding whether answering a query on a relational database leads to any disclosure of sensitive information. This problem was shown to be intractable; we propose practical algorithms for a reasonably large set of query classes.&#xd;
&#xd;
In the second part of the dissertation, we consider the problem of publishing  ``anonymous&amp;apos;&amp;apos; aggregate information about populations of individuals while preserving the privacy of individual-specific information. We present a novel framework for reasoning about the privacy risk in this setting. We also propose the first formal privacy definition and practical algorithms for publishing ``anonymous&amp;apos;&amp;apos; data that provably guarantees privacy of the individuals contributing to the data while releasing useful aggregate information. We also present a case study of applying formal privacy definitions to a real Census data publishing application.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>