<?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:03:44Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1118" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1118</identifier><datestamp>2017-03-21T19:04:17Z</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="author" lang="en" authority="6dc9a893-bd5b-4a4c-b8c6-363afbd6c8ce" confidence="600">Kim, Kyung-Mi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:27:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:27:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2003</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2003</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1118</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Let &amp;lt;b&amp;gt;A&amp;lt;/b&amp;gt; and &amp;lt;b&amp;gt;B&amp;lt;/b&amp;gt; be finite sets with |&amp;lt;b&amp;gt;A&amp;lt;/b&amp;gt;|=&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; and |&amp;lt;b&amp;gt;B&amp;lt;/b&amp;gt;|=&amp;lt;i&amp;gt;m&amp;lt;/i&amp;gt;.    An (&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;,&amp;lt;i&amp;gt;m&amp;lt;/i&amp;gt;,&amp;lt;i&amp;gt;w&amp;lt;/i&amp;gt;)-&amp;lt;i&amp;gt;perfect hash&amp;lt;/i&amp;gt; family&amp;lt;/i&amp;gt;  is a collection &amp;lt;i&amp;gt;F&amp;lt;/i&amp;gt;  of functions  from &amp;lt;b&amp;gt;A&amp;lt;/b&amp;gt; to &amp;lt;b&amp;gt;B&amp;lt;/b&amp;gt; such that for any &amp;lt;b&amp;gt;X&amp;lt;/b&amp;gt;  &amp;amp;#8838; &amp;lt;b&amp;gt;A&amp;lt;/b&amp;gt; with |&amp;lt;b&amp;gt;X&amp;lt;/b&amp;gt;|=&amp;lt;i&amp;gt;w&amp;lt;/i&amp;gt;, there exists at least one ? &amp;amp;#8712; &amp;lt;i&amp;gt;F&amp;lt;/i&amp;gt; such that ? is one-to-one when restricted to &amp;lt;b&amp;gt;X&amp;lt;/b&amp;gt;.    Perfect hash families are basic combinatorial structures and they  have played important roles in Computer Science in areas such as database  management, operating systems, and compiler constructions.   Such hash  families are used for memory efficient storage and fast retrieval  of items such as reserved words in programming languages, command  names in interactive systems, or commonly used words in natural  languages.   More recently, perfect hash families have found numerous  applications to cryptography, for example, to broadcast encryption  schemes, secret sharing, key distribution patterns, visual  cryptography, cover-free families and secure frameproof codes.      
In this thesis, we survey constructions and applications of perfect  hash families.   For constructions, we divided the results into three  parts, depending on underlying structure and properties of the  constructions: combinatorial structures, linear functionals, and algebraic structures.   For applications, we focus on those related to cryptography.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">755109 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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="rights" lang="en">Copyright: 2003, 
  Kim, Kyung-Mi. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Perfect Hash Families</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combinatorial Structures</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Probability Methods</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Perfect Hash Families: Constructions and Applications</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">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" 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>