UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Hash Families and Cover-Free Families with Cryptographic Applications

dc.comment.hiddenThis version makes the four changes suggested by Trevor (tclews) on Sept 24.en
dc.contributor.authorZaverucha, Gregory
dc.date.accessioned2010-09-28T15:17:20Z
dc.date.available2010-09-28T15:17:20Z
dc.date.issued2010-09-28T15:17:20Z
dc.date.submitted2010-09-22
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.identifier.urihttp://hdl.handle.net/10012/5532
dc.language.isoenen
dc.pendingfalseen
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.subject.programComputer Scienceen
dc.titleHash Families and Cover-Free Families with Cryptographic Applicationsen
dc.typeDoctoral Thesisen
uws-etd.degreeDoctor of Philosophyen
uws-etd.degree.departmentSchool of Computer Scienceen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Zaverucha_Gregory.pdf
Size:
993.19 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
254 B
Format:
Item-specific license agreed upon to submission
Description: