  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.
