<?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-22T21:40:03Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/23689" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/23689</identifier><datestamp>2026-07-07T15:06:32Z</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="author">Shehata, Mohannad</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-07-07T15:06:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2026-07-07T15:06:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026-07-07</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2026-06-18</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/23689</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">Machine learning has permeated every part of our data lives. With the prevalence of machine learning comes an insatiable need for data, including sensitive personal data. As
a result, the need arose to develop techniques for machine learning tasks that preserve individual privacy while providing high utility by learning from private data somehow. An
important class of machine learning tasks is clustering, which can potentially be used to study diseases by identifying clusters of patients. As patient information is private, private
clustering algorithms would help us infer patterns among patients while protecting their data. DBSCAN is a clustering algorithm that is widely used to detect clusters of arbitrary
shape among the data points. Existing private implementations of DBSCAN either exhibit significant leakage, are highly sequential, or are asymptotically inefficient both in runtime
and communication cost. In this thesis, we present an efficient approximation of DBSCAN that takes O(log²n) parallel time and O(nlog²n) total work, breaking the quadratic
barrier in Secure Multiparty implementations of DBSCAN algorithms and reducing the communication rounds asymptotically from O(n²) to O(log²n).</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject">secure multiparty computation</dim:field>
   <dim:field mdschema="dc" element="subject">privacy</dim:field>
   <dim:field mdschema="dc" element="subject">security</dim:field>
   <dim:field mdschema="dc" element="subject">machine learning</dim:field>
   <dim:field mdschema="dc" element="subject">clustering</dim:field>
   <dim:field mdschema="dc" element="title">Parallel Efficient Secure DBSCAN Approximation</dim:field>
   <dim:field mdschema="dc" element="type">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">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">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Kerschbaum, Florian</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">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>