scientific article; zbMATH DE number 1228785
From MaRDI portal
Publication:4221879
Recommendations
Cited in
(34)- Explicit constructions for perfect hash families
- Optimal linear perfect hash families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Perfect hash families: Probabilistic methods and explicit constructions
- Randomness in secret sharing and visual cryptography schemes
- Perfect hash families: the generalization to higher indices
- A sequence approach to linear perfect hash families
- Cheating-immune secret sharing schemes from codes and cumulative arrays
- Bounds for separating hash families
- On generalized separating hash families
- Geometric constructions of optimal linear perfect hash families
- Recursive constructions of secure codes and hash families using difference function families.
- Linear Time Constructions of Some d-Restriction Problems
- On the state of strength-three covering arrays
- Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing
- A recursive construction for perfect hash families
- Constructing Perfect Hash Families Using a Greedy Algorithm
- Improved bounds for separating hash families
- Constructing heterogeneous hash families by puncturing linear transversal designs
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- Bounds And Constructions For Threshold Shared Generation Of Authenticators
- scientific article; zbMATH DE number 1439481 (Why is no real title available?)
- scientific article; zbMATH DE number 7300351 (Why is no real title available?)
- Perfect Hash Families: Constructions and Existence
- The combinatorics of generalised cumulative arrays
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Broadcast authentication for group communication
- Detecting arrays for effects of single factors
- A survey of cover-free families: constructions, applications, and generalizations
- Constructions and bounds for separating hash families
- Generalised cumulative arrays in secret sharing
- Roux-type constructions for covering arrays of strengths three and four
- Secret sharing schemes with partial broadcast channels
- Perfect hash families of strength three with three rows from varieties on finite projective geometries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221879)