Show simple item record

dc.contributor.authorZaverucha, Gregory 15:17:20 (GMT) 15:17:20 (GMT)
dc.description.abstractThis thesis is focused on hash families and cover-free families and their application to problems in cryptography. We present new necessary conditions for generalized separating hash families, and provide new explicit constructions. We then consider three cryptographic applications of hash families and cover-free families. We provide a stronger de nition of anonymity in the context of shared symmetric key primitives and give a new scheme with improved anonymity properties. Second, we observe that nding the invalid signatures in a set of digital signatures that fails batch veri cation is a group testing problem, then apply and compare many group testing algorithms to solve this problem e ciently. In particular, we apply group testing algorithms based on cover-free families. Finally, we construct a one-time signature scheme based on cover-free families with short signatures.en
dc.publisherUniversity of Waterlooen
dc.subjectperfect hash familiesen
dc.subjectseparating hash familiesen
dc.subjectcover-free familiesen
dc.subjectgroup testingen
dc.subjectbatch verificationen
dc.subjectshared symmetric key primitivesen
dc.subjectone-time signaturesen
dc.titleHash Families and Cover-Free Families with Cryptographic Applicationsen
dc.typeDoctoral Thesisen
dc.subject.programComputer Scienceen of Computer Scienceen
uws-etd.degreeDoctor of Philosophyen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages