Constructions and bounds for separating hash families

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.

Hash family, separating hash family, strong separating hash family, hypergraph

References in corpus (2)

• New Bounds For Frameproof Codes
• Some intriguing upper bounds for separating hash families

Cited by in corpus (2)

• Distributing hash families with few rows
• Some intriguing upper bounds for separating hash families