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.
Cite this version of the work
Gregory Zaverucha (2010). Hash Families and Cover-Free Families with Cryptographic Applications. UWSpace. http://hdl.handle.net/10012/5532
Showing items related by title, author, creator and subject.
Le Clair, Keilah (University of Waterloo, 2019-04-30)Seneca the Younger, writing in the early Roman Empire, is the only known Roman tragedian whose works survive. His Phaedra, considered to be one of his earlier tragedies, is centered on the royal family of Athens, consisting ...
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 ...
Oltean, Irina (University of Waterloo, 2019-05-31)In Canada, the prevalence of mental illness is high among young people with 13% of Canadian youth aged 15-24 years affected. This striking mental health burden warranted further investigation of the contextual (i.e., ...