Explicit constructions for perfect hash families

Authors:
Sosina Martirosyan;Tran Trung
Affiliations:
University of Houston-Clear Lake, Houston, U.S.A 77058;Institut für Experimentelle Mathematik, Universität Duisburg-Essen, Essen, Germany 45326
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 15
Cited 5

Explicit construction of exponential sized families of K-independent sets

Discrete Mathematics
New bounds for perfect hashing via information theory

European Journal of Combinatorics
Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Perfect hashing

Theoretical Computer Science
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
Explicit constructions of perfect hash families from algebraic curves over finite fields

Journal of Combinatorial Theory Series A
On t-Covering Arrays

Designs, Codes and Cryptography
New Constructions for IPP Codes

Designs, Codes and Cryptography
Recursive constructions of secure codes and hash families using difference function families

Journal of Combinatorial Theory Series A
Covering arrays and perfect hash families

Covering arrays and perfect hash families
Roux-type constructions for covering arrays of strengths three and four

Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A sequence approach to linear perfect hash families

Designs, Codes and Cryptography
Efficient multiplicative sharing schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Linear hash families and forbidden configurations

Designs, Codes and Cryptography
A perfect-hashing scheme for fast IP lookup

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory
Bounds for separating hash families

Journal of Combinatorial Theory Series A
Improved bounds for separating hash families

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.06

Visualization

Abstract

Let k, v, t be integers such that k 驴 v 驴 t 驴 2. A perfect hash family $${\mathsf{PHF}}$$ (N; k, v, t) can be defined as an N 脳 k array with entries from a set of v symbols such that every N 脳 t subarray contains at least one row having distinct symbols. Perfect hash families have been studied by over 20 years and they find a wide range of applications in computer sciences and in cryptography. In this paper we focus on explicit constructions for perfect hash families using combinatorial methods. We present many recursive constructions which result in a large number of improved parameters for perfect hash families. The paper also includes extensive tables for parameters with t = 3, 4, 5, 6 of newly constructed perfect hash families.