Constructions and bounds for separating hash families

DOI10.1016/J.DISC.2018.06.018MaRDI QIDQ724890zbMATH OpenOpenAlexFDO

Authors Xiaolei Niu, H. Cao

Publication date 26 July 2018

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.03274

zbMATH Keywords

hypergraphseparating hash familyhash familystrong separating hash family

Mathematics Subject Classification ID

Cryptography (94A60) Hypergraphs (05C65)

Abstract: In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families. We also improve some previously known bounds of separating hash families.

Recommendations

• Improved bounds for separating hash families
• Separating hash families: a Johnson-type bound and new constructions
• A tight bound on the size of certain separating hash families
• On generalized separating hash families
• Improved bounds on the size of separating hash families of short length

Cites work

• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 1857520 (Why is no real title available?)
• A bound on the size of separating hash families
• A tight bound on the size of certain separating hash families
• Balanced incomplete block designs and related designs
• Bounds for separating hash families
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Covering graphs: The covering problem solved
• Explicit constructions of separating hash families from algebraic curves over finite fields
• Frameproof Codes
• Improved bounds for separating hash families
• New Bounds for Frameproof Codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• New Bounds on Separable Codes for Multimedia Fingerprinting
• On Quadruple Systems
• On a packing and covering problem
• On generalized separating hash families
• On t-Designs and Groups
• On tight bounds for binary frameproof codes
• Perfect Hash Families: Constructions and Existence
• Perfect hash families of strength three with three rows from varieties on finite projective geometries
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separating hash families: a Johnson-type bound and new constructions
• Some intriguing upper bounds for separating hash families
• The CRC handbook of combinatorial designs

Cited in

(14)

• Computing and Combinatorics
• A tight bound on the size of certain separating hash families
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
• Explicit constructions of separating hash families from algebraic curves over finite fields
• Improved bounds for separating hash families
• Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma
• Detecting arrays for effects of single factors
• Improved bounds on the size of separating hash families of short length
• Constructions of 2-cover-free families and related separating hash families
• Some intriguing upper bounds for separating hash families
• Separating hash families: a Johnson-type bound and new constructions
• Bounds for separating hash families
• Detecting arrays for effects of multiple interacting factors
• On generalized separating hash families

This page was built for publication: Constructions and bounds for separating hash families

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