<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-21T03:45:45Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/27376" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/27376</identifier><datestamp>2026-09-24T00:44:45Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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="advisor">Boden, Hans U.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">White, Lindsay A.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computational Engineering and Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-02-18T20:52:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-02-18T20:52:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/27376</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/13559</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis, we present a quantitative measure called the Database Privacy&#xd;
Score to assess the level of privacy in an anonymous database. Individuals in an&#xd;
anonymous database are still at risk of having personal information uncovered&#xd;
about them in a linkage attack. A privacy score is assigned to each individual&#xd;
in the database, measuring the risk of an adversary gaining new knowledge&#xd;
about them in a linkage attack. This requires looking at a set of attributes&#xd;
K and determining which additional attributes can be inferred from knowing&#xd;
K. This is where the bulk of the computational work occurs, and we present&#xd;
algorithms for computing this. C++ source code is included in the Appendix&#xd;
for all computations involved in computing the Database Privacy Score. We&#xd;
also show that under certain assumptions, applying k-anonymity to a database&#xd;
cannot worsen the privacy score, although there is no guarantee that it will&#xd;
improve the score. We also look at privacy from a topological perspective, and&#xd;
propose a solution for removing inferences that come from topological holes in&#xd;
the Dowker Complex representing our database.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Privacy Score for Anonymous Databases</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>