On generalized separating hash families

DOI10.1016/j.jcta.2007.04.005zbMath1131.68070OpenAlexW2001092675MaRDI QIDQ2469200

Rui Zhong Wei, Ke-jun Chen, Douglas R. Stinson

Publication date: 4 February 2008

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.2007.04.005

zbMATH Keywords

separating hash familiesperfect hash families

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Other designs, configurations (05B30)

Related Items (20)

List decoding for a multiple access hyperchannel ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Improved bounds for separating hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Strengthening hash families and compressive sensing ⋮ Detecting arrays for effects of single factors ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Bounds for separating hash families ⋮ Wide-sense 2-frameproof codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Cover-free codes and separating system codes ⋮ New bounds on 2-frameproof codes of length 4 ⋮ Bounds on the rate of separating codes ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ A bound on the size of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Constructions and bounds for separating hash families

Uses Software

• I.P.P.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On codes with the identifiable parent property
• Optimal linear perfect hash families
• Separating systems
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Perfect hash families: Probabilistic methods and explicit constructions
• Frameproof codes against limited coalitions of pirates
• New constructions for IPP codes
• Intersecting codes and separating codes
• A class of I.P.P. codes with efficient identification
• An upper bound on the size of a code with the \(k\)-identifiable parent property
• Recursive constructions of secure codes and hash families using difference function families.
• Optimal linear perfect hash families with small parameters
• Constructions of 2-cover-free families and related separating hash families
• Upper Bounds on Separating Codes
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• Asymptotic bounds on frameproof codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Collusion-secure fingerprinting for digital data
• Cryptography and Coding
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Some new \(p\)-ary two-secure frameproof codes
• Parent-identifying codes

This page was built for publication: On generalized separating hash families