|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/5532
|
| Title: | Hash Families and Cover-Free Families with Cryptographic Applications |
| Authors: | Zaverucha, Gregory |
| Keywords: | perfect hash families
separating hash families
cover-free families
group testing
batch verification
shared symmetric key primitives
one-time signatures |
| Approved Date: | 28-Sep-2010 |
| Date Submitted: | 22-Sep-2010 |
| Abstract: | This 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. |
| Program: | Computer Science |
| Department: | School of Computer Science |
| Degree: | Doctor of Philosophy |
| URI: | http://hdl.handle.net/10012/5532 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
