A tight bound for frameproof codes viewed in terms of separating hash families
From MaRDI portal
Publication:2249796
DOI10.1007/s10623-013-9800-0zbMath1321.94142MaRDI QIDQ2249796
Publication date: 3 July 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9800-0
Related Items
Unnamed Item, On tight bounds for binary frameproof codes, New upper bounds for parent-identifying codes and traceability codes, Improved bounds on 2-frameproof codes with length 4, New bounds on 2-frameproof codes of length 4, Wide-sense 2-frameproof codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for separating hash families
- A bound on the size of separating hash families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- 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
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Collusion-secure fingerprinting for digital data
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity