Bounds for separating hash families

DOI10.1016/J.JCTA.2010.11.006MaRDI QIDQ2431271zbMATH OpenOpenAlexFDO

Authors 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

frameproof codeperfect hash familyseparating hash family\(w\)-IPP code

Mathematics Subject Classification ID

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

Recommendations

• A bound on the size of separating hash families
• Constructions and bounds for separating hash families
• Some intriguing upper bounds for separating hash families
• Improved bounds for separating hash families
• A tight bound on the size of certain separating hash families
• On generalized separating hash families
• Separating hash families: a Johnson-type bound and new constructions
• Improved bounds on the size of separating hash families of short length
• Covering strong separating hash families
• A new lower bound on perfect hash families

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 1462939 (Why is no real title available?)
• A bound on the size of separating hash families
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Constructions of 2-cover-free families and related separating hash families
• Explicit constructions for perfect hash families
• Frameproof Codes
• New constructions for IPP codes
• On codes with the identifiable parent property
• On generalized separating hash families
• Perfect Hash Families: Constructions and Existence
• Perfect hash families: Probabilistic methods and explicit constructions
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

Cited in

(13)

• Improved bounds on the size of separating hash families of short length
• Improved bounds for separating hash families
• On tight bounds for binary frameproof codes
• Some intriguing upper bounds for separating hash families
• Separating hash families: a Johnson-type bound and new constructions
• Strongly separable codes
• New bounds on 2-frameproof codes of length 4
• Linear Time Constructions of Some $$d$$-Restriction Problems
• A tight bound for frameproof codes viewed in terms of separating hash families
• Constructions and bounds for separating hash families
• Distributing hash families with few rows
• Improved bounds on 2-frameproof codes with length 4
• Strengthening hash families and compressive sensing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431271)