New upper bounds for parent-identifying codes and traceability codes
From MaRDI portal
Publication:1650430
DOI10.1007/s10623-017-0420-yzbMath1402.94127OpenAlexW2766065688MaRDI QIDQ1650430
Chong Shangguan, Jingxue Ma, Gennian Ge
Publication date: 3 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0420-y
Related Items (4)
Multimedia IPP codes with efficient tracing ⋮ Optimal 2-traceability codes of length 4 ⋮ Wide-sense 2-frameproof codes ⋮ Some intriguing upper bounds for separating hash families
Cites Work
- Unnamed Item
- Unnamed Item
- On codes with the identifiable parent property
- A class of I.P.P. codes with efficient identification
- 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
- Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Tracing traitors
- New Bounds for Frameproof Codes
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
- Applications of list decoding to tracing traitors
- Collusion-secure fingerprinting for digital data
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Separating Hash Families: A Johnson-type bound and New Constructions
- Parent-identifying codes
This page was built for publication: New upper bounds for parent-identifying codes and traceability codes
