<?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-22T15:52:46Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18322" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18322</identifier><datestamp>2025-03-26T23:36:04Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Kerschbaum, Florian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="321d9702-2b8a-44c6-a9f1-38649470960f" confidence="600">Premkumar, John Abraham</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-05-24T15:37:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-05-24T04:50:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-05-24</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-05-16</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18322</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The prevalence and increasing need for insights obtained from the collection of sensitive&#xd;
data gives rise to the problem of protecting the privacy of this data. The collection and&#xd;
storage of data can be distributed across locations and organizations, and gaining insights&#xd;
can require combining knowledge from different stores. Private record linkage (PRL) is&#xd;
the problem of finding approximately matching records across different databases while&#xd;
maintaining the privacy of all records involved. The PRL problem in the streaming data&#xd;
model is an emerging problem that tackles PRL in the context of a streaming database,&#xd;
where a service provider performs the matching and learns only the result to gain further&#xd;
insights. To the best of our knowledge our work is the first to address this problem.&#xd;
In this work, we introduce a new cryptographic primitive, the secure approximate&#xd;
equality operator that securely implements all-or-nothing disclosure for approximate matching,&#xd;
which has provable security guarantees in the semi-honest security model. We show that the&#xd;
new operator performs several times faster than a straightforward baseline approach using&#xd;
function-hiding inner product encryption. We also showcase a protocol that implements&#xd;
our new approximate equality operator to perform PRL in the streaming data model with&#xd;
high accuracy and performance.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">private record linkage</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">secure computation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">All-or-Nothing Private Record Linkage over Streaming Data</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">2 years</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Kerschbaum, Florian</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>