Wide-sense 2-frameproof codes
From MaRDI portal
Publication:2211333
DOI10.1007/s10623-020-00797-wzbMath1478.94150arXiv2002.11266OpenAlexW3084529647MaRDI QIDQ2211333
Publication date: 11 November 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11266
Hypergraphs (05C65) Combinatorics in computer science (68R05) Extremal set theory (05D05) Bounds on codes (94B65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tight bounds for binary frameproof codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- New upper bounds for parent-identifying codes and traceability codes
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Traceability codes
- A tight bound for frameproof codes viewed in terms of separating hash families
- On generalized separating hash families
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Improved Constructions of Frameproof Codes
- Extremal Combinatorics
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- New Bounds for Frameproof Codes
- Asymptotic bounds on frameproof codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
- Intersection theorems for systems of finite sets
- A Combinatorial Theorem on Systems of Sets
- Dynamic traitor tracing
- Parent-identifying codes
This page was built for publication: Wide-sense 2-frameproof codes
