Improved bounds for separating hash families
From MaRDI portal
Publication:369437
DOI10.1007/s10623-012-9673-7zbMath1273.94339OpenAlexW2001991924MaRDI QIDQ369437
Marjan Bazrafshan, Tran van Trung
Publication date: 24 September 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9673-7
Related Items (6)
Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Some intriguing upper bounds for separating hash families ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Constructions and bounds for separating hash families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bound on the size of separating hash families
- Explicit constructions for perfect hash families
- On codes with the identifiable parent property
- 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
- New constructions for IPP codes
- Bounds for separating hash families
- On generalized separating hash families
- Constructions of 2-cover-free families and related separating hash families
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- More on (2,2)-separating systems
- Collusion-secure fingerprinting for digital data
- Perfect Hash Families: Constructions and Existence
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
This page was built for publication: Improved bounds for separating hash families
