<?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:45:42Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/13770" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/13770</identifier><datestamp>2025-03-26T23:38:33Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</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">Menezes, Alfred</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="45f0f780-c6c8-476e-b50e-d8467c937ffe" confidence="600">Soundararajan, Priya</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-09-10T17:32:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-09-10T17:32:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-09-10</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/13770</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In the field of cryptography, one generally obtains assurances for the&#xd;
security of a cryptographic protocol by giving a reductionist security&#xd;
proof, which is comprised of a reduction from breaking a mathematical&#xd;
problem (that is well-studied and widely believed to be intractable)&#xd;
to the breaking of the cryptographic protocol. While such reductions&#xd;
are generally constructive, some authors give non-constructive&#xd;
reductions (also called non-uniform reductions) in order to reduce&#xd;
the tightness gap of the reduction. However, in order to assess the&#xd;
concrete security that the proof provides, one also needs to assess&#xd;
the intractability of the underlying mathematical problem against&#xd;
non-constructive attacks. Unfortunately, there has been very little&#xd;
work in the literature on non-constructive attacks on these problems,&#xd;
and sometimes non-constructive attacks are found that are much faster&#xd;
than their constructive counterparts. Thus, it is sometimes very&#xd;
difficult to obtain meaningful security assurances about a cryptographic&#xd;
protocol from a non-constructive reductionist security proof.&#xd;
&#xd;
In this thesis, we examine three instances of non-constructive security&#xd;
proofs for cryptographic protocols in the literature:&#xd;
(1) a password-based key derivation function; (2) an HMAC-related message&#xd;
authentication code scheme; and (3) a&#xd;
round-optimal blind signature scheme.</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">Non-Constructivity in Security Proofs</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">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</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" element="contributor" qualifier="advisor">Menezes, Alfred</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>