Constructions of 2-cover-free families and related separating hash families

DOI10.1002/jcd.20109zbMath1108.05090OpenAlexW2052666099MaRDI QIDQ3419697

G. H. J. van Rees, Rui Zhong Wei, (Ben) P. C. Li

Publication date: 7 February 2007

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20109

zbMATH Keywords

cryptographycombinatorial designsuperimposed codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Cryptography (94A60) Extremal set theory (05D05) Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Improved bounds for separating hash families ⋮ Bounds for separating hash families ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures ⋮ On generalized separating hash families ⋮ A tight bound for frameproof codes viewed in terms of separating hash families

Cites Work

• Families of finite sets in which no set is covered by the union of \(r\) others
• Unnamed Item

This page was built for publication: Constructions of 2-cover-free families and related separating hash families