Bounds for separating hash families

Authors:
Marjan Bazrafshan;Tran van Trung
Affiliations:
Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Ellernstrasse 29, 45326 Essen, Germany;Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Ellernstrasse 29, 45326 Essen, Germany
Venue:
Journal of Combinatorial Theory Series A
Year:
2011

Citing 9
Cited 3

On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Optimal linear perfect hash families

Journal of Combinatorial Theory Series A
Perfect hash families: probabilistic methods and explicit constructions

Journal of Combinatorial Theory Series A
New Constructions for IPP Codes

Designs, Codes and Cryptography
On generalized separating hash families

Journal of Combinatorial Theory Series A
Explicit constructions for perfect hash families

Designs, Codes and Cryptography
A bound on the size of separating hash families

Journal of Combinatorial Theory Series A
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

IEEE Transactions on Information Theory

Strengthening hash families and compressive sensing

Journal of Discrete Algorithms
Testers and their applications

Proceedings of the 5th conference on Innovations in theoretical computer science
Improved bounds for separating hash families

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims to present new upper bounds on the size of separating hash families. These bounds improve previously known bounds for separating hash families.