<?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:40:34Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5532" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5532</identifier><datestamp>2017-03-21T21:32:18Z</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="a794b9da-d989-4832-b783-5ab0ae538415" confidence="600">Zaverucha, Gregory</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-09-28T15:17:20Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-09-28T15:17:20Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-09-28T15:17:20Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010-09-22</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5532</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis is focused on hash families and cover-free families and their application to&#xd;
problems in cryptography. We present new necessary conditions for generalized separating&#xd;
hash families, and provide new explicit constructions. We then consider three cryptographic&#xd;
applications of hash families and cover-free families. We provide a stronger de nition of&#xd;
anonymity in the context of shared symmetric key primitives and give a new scheme with&#xd;
improved anonymity properties. Second, we observe that  nding the invalid signatures&#xd;
in a set of digital signatures that fails batch veri cation is a group testing problem, then&#xd;
apply and compare many group testing algorithms to solve this problem e ciently. In&#xd;
particular, we apply group testing algorithms based on cover-free families. Finally, we&#xd;
construct a one-time signature scheme based on cover-free families with short signatures.</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">perfect hash families</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">separating hash families</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cover-free families</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">group testing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">batch verification</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">shared symmetric key primitives</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">one-time signatures</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Hash Families and Cover-Free Families with Cryptographic Applications</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">This version makes the four changes suggested by Trevor (tclews) on Sept 24.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</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">Doctor of Philosophy</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>