Bounds for separating hash families

DOI10.1016/j.jcta.2010.11.006zbMath1231.68173OpenAlexW2018821316MaRDI QIDQ2431271

Marjan Bazrafshan, Tran van Trung

Publication date: 11 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.11.006

zbMATH Keywords

perfect hash familyframeproof codeseparating hash family\(w\)-IPP code

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (13)

Strongly separable codes ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Improved bounds for separating hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ On tight bounds for binary frameproof codes ⋮ Strengthening hash families and compressive sensing ⋮ Some intriguing upper bounds for separating hash families ⋮ New bounds on 2-frameproof codes of length 4 ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Constructions and bounds for separating hash families ⋮ Unnamed Item ⋮ Distributing hash families with few rows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bound on the size of separating hash families
• Explicit constructions for perfect hash families
• On codes with the identifiable parent property
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Perfect hash families: Probabilistic methods and explicit constructions
• New constructions for IPP codes
• On generalized separating hash families
• Constructions of 2-cover-free families and related separating hash families
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Collusion-secure fingerprinting for digital data
• Perfect Hash Families: Constructions and Existence

This page was built for publication: Bounds for separating hash families