Constructions and bounds for separating hash families

DOI10.1016/J.DISC.2018.06.018zbMATH Open1422.94033arXiv1611.03274OpenAlexW2758883502MaRDI QIDQ724890FDOQ724890

Authors: Xiaolei Niu, H. Cao 

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

hypergraphseparating hash familyhash familystrong separating hash family

Mathematics Subject Classification ID

Cryptography (94A60) Hypergraphs (05C65)

Cites Work

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

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
• Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma
• Improved bounds for separating hash families
• 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
• Detecting arrays for effects of multiple interacting factors
• Bounds for separating hash families
• 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)