<?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-22T16:47:10Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5317" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5317</identifier><datestamp>2017-03-21T17:23:48Z</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" authority="456db676-4175-4030-bb3f-5cbf9ecd0eea" confidence="600">Xie, Qi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-07-28T14:23:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-07-28T14:23:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-07-28T14:23:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5317</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The success of online social networking has resulted in increased attention to mobile social&#xd;
networking research and applications. In mobile social networking, instead of looking for friends&#xd;
over the Internet, people look for friends who are physically located close and also based on other&#xd;
self-defined criteria. For example, a person could find other people who are nearby and who&#xd;
also share the same interests with her by using mobile social networking. As a result, they have&#xd;
common topics to talk about and may eventually become friends. There are two main approaches&#xd;
in the existing works. One approach focuses on efficiently establishing friendship and ignores&#xd;
the protection of private information of the participants. For example, some applications simply&#xd;
broadcast users’ personal information to everybody and rely on the other users to report the&#xd;
matches. From a privacy point of view, this approach is bad, since it makes the users vulnerable&#xd;
to context-aware attacks. The other approach requires a central server to participate in each&#xd;
matchmaking process. For example, an application deploys a central server, which stores the&#xd;
profile information of all users. When two nearby client devices query the central server at the&#xd;
same time, the central server fetches the profile information of both devices from the server’s&#xd;
database, performs matching based on the information, and reports the result back to the clients.&#xd;
However, a central server is not always available, so this approach does not scale. In addition, the&#xd;
central server not only learns all users’ personal information, it also learns which users become&#xd;
friends.&#xd;
&#xd;
This thesis proposes a privacy-preserving architecture for users to find potential friends with&#xd;
the same interests. The architecture has two matchmaking protocols to prevent privacy leaks.&#xd;
Our protocols let a user learn only the interests she has in common with the other party. One&#xd;
protocol is simpler, but works only if some assumptions hold. The other protocol is more secure,&#xd;
but requires longer execution time. Our architecture does not require any central server that is&#xd;
involved in the matchmaking process. We describe how the protocols work, analyze how secure&#xd;
the protocols are under different assumptions, and implement the protocols in a BlackBerry&#xd;
application. We test the efficiency of the protocols by conducting a number of experiments.&#xd;
We also consider the cheating-detection and friend-recognition problems.</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="title" lang="en">Privacy-Preserving Interest Matching for Mobile Social Networking</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">Please process it as soon as possible, since I am waiting for the letter to apply my work permit while my study permit will be expired soon. Thank you.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</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>