Hash Families and Cover-Free Families with Cryptographic Applications
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Maleki-Tehrani, Marjan (University of Waterloo, 2006)This study investigated the association between the severity of Tourette Syndrome (TS) and comorbid tendencies (Attention Deficit Hyperactivity Disorder (ADHD), Obsessive-Compulsive Disorder (OCD), and rage), maternal ...
Müller, Maike (University of Waterloo, 2015-08-31)In my thesis I examine the crisis of masculinity and family in AMC’s TV series Breaking Bad. In prior research, the protagonist Walter White has been analyzed as a man who wants to escape his responsibilities and the ...
Milne, Emily (University of Waterloo, 2015-10-07)Academic success in public schools is facilitated by strong bonds between families and schools, including a shared sense of purpose and mutual trust and understanding (Lareau, 1987, 2000, 2002, 2011; Lareau and Weininger, ...