Perfect hash families: Constructions and existence

Robert A. Walker; Charles Colbourn

doi:10.1515/JMC.2007.008

Perfect hash families: Constructions and existence

Robert A. Walker, Charles Colbourn

IAFSE-CIDSE: Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

Abstract

A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.

Original language	English (US)
Pages (from-to)	125-150
Number of pages	26
Journal	Journal of Mathematical Cryptology
Volume	1
Issue number	2
DOIs	https://doi.org/10.1515/JMC.2007.008
State	Published - Apr 19 2007

Keywords

Interaction testing
Perfect hash family
Three-term arithmetic progression

ASJC Scopus subject areas

Computer Science Applications
Computational Mathematics
Applied Mathematics

Access to Document

10.1515/JMC.2007.008

Fingerprint Dive into the research topics of 'Perfect hash families: Constructions and existence'. Together they form a unique fingerprint.

Cite this

@article{56ddb2458323493dbe61a83236232a2e,

title = "Perfect hash families: Constructions and existence",

abstract = "A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.",

keywords = "Interaction testing, Perfect hash family, Three-term arithmetic progression",

author = "Walker, {Robert A.} and Charles Colbourn",

year = "2007",

month = apr,

day = "19",

doi = "10.1515/JMC.2007.008",

language = "English (US)",

volume = "1",

pages = "125--150",

journal = "Journal of Mathematical Cryptology",

issn = "1862-2976",

publisher = "Walter de Gruyter GmbH & Co. KG",

number = "2",

}

TY - JOUR

T1 - Perfect hash families

T2 - Constructions and existence

AU - Walker, Robert A.

AU - Colbourn, Charles

PY - 2007/4/19

Y1 - 2007/4/19

N2 - A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.

AB - A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.

KW - Interaction testing

KW - Perfect hash family

KW - Three-term arithmetic progression

UR - http://www.scopus.com/inward/record.url?scp=37149032099&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37149032099&partnerID=8YFLogxK

U2 - 10.1515/JMC.2007.008

DO - 10.1515/JMC.2007.008

M3 - Article

AN - SCOPUS:37149032099

VL - 1

SP - 125

EP - 150

JO - Journal of Mathematical Cryptology

JF - Journal of Mathematical Cryptology

SN - 1862-2976

IS - 2

ER -

Perfect hash families: Constructions and existence

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this