This thesis is focused on hash families and cover-free families and their application to problems in cryptography. We present new necessary conditions for ...
This thesis is focused on hash families and cover-free families and their application to problems in cryptography. We present new necessary conditions for ...
... Cover-free families have found many applications in cryptography and communications, including blacklisting [186], broadcast encryption [82,130,293,294] ...
Jan 3, 2024 · I have seen claims that hash function families can be collision resistant while single hash functions can not be. Is this true? And if so, why?
Missing: Cover- | Show results with:Cover-
People also ask
Mar 30, 2023 · Cover-free families were considered from different subjects such as information theory, com- binatorics and group testing.
Cover-free families (CFFs) were considered from different subjects by numerous researchers. In this article, we mainly consider explicit constructions of (2 ...
Apr 21, 2006 · In this article, we mainly consider explicit constructions of (2; d)-cover-free families. We also determine the size of optimal 2-cover-free-families on 9, 10, ...
Missing: Cryptographic | Show results with:Cryptographic
In this paper, we provide explicit constructions of perfect hash families based on algebraic curves over finite fields.
In this paper, we present a two-dimensional representation technique for cover free families, and show that this technique is quite useful for reducing the ...
Zaverucha, Gregory. "Hash Families and Cover-Free Families with Cryptographic Applications." Thesis, 2010. http://hdl.handle.net/10012/5532. Full text.