Improved bounds for separating hash families

@article{Bazrafshan2013ImprovedBF,
  title={Improved bounds for separating hash families},
  author={Marjan Bazrafshan and Tran van Trung},
  journal={Des. Codes Cryptography},
  year={2013},
  volume={69},
  pages={369-382}
}
An (N ;n,m, {w1, . . . , wt})-separating hash family is a set H of N functions h : X −→ Y with |X| = n, |Y | = m, t ≥ 2 having the following property. For any pairwise disjoint subsets C1, . . . , Ct ⊆ X with |Ci| = wi, i = 1, . . . , t, there exists at least one function h ∈ H such that h(C1), h(C2), . . . , h(Ct) are pairwise disjoint. Separating hash families generalize many known combinatorial structures such as perfect hash families, frameproof codes, secure frameproof codes, identifiable… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Separating Hash Families

  • Marjan Bazrafshan
  • PhD thesis, University of Duisburg-Essen,
  • 2011
1 Excerpt

Tran van Trung

  • S. S. Martirosyan
  • Explicit constructions for perfect hash families…
  • 2008
1 Excerpt

editors

  • C. J. Colbourn, J. H. Dinitz
  • The CRC Handbook of Combinatorial Designs Chapman…
  • 2007
2 Excerpts

R

  • P. C. Li
  • Wei and G. H. J. van Rees, Constructions of 2…
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…