New upper bounds for parent-identifying codes and traceability codes

DOI10.1007/S10623-017-0420-YMaRDI QIDQ1650430zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

parent-identifying codestraceability codestraitor tracing schemes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Improved upper bounds for parent-identifying set systems and separable codes
• Upper bounds for parent-identifying set systems
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• A note on an upper bound of traceability codes
• Traceability codes and their generalizations

Cites work

• A class of I.P.P. codes with efficient identification
• A note on an upper bound of traceability codes
• A tight bound for frameproof codes viewed in terms of separating hash families
• An upper bound on the size of a code with the \(k\)-identifiable parent property
• Applications of list decoding to tracing traitors
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Frameproof Codes
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• New Bounds for Frameproof Codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• On codes with the identifiable parent property
• Parent-identifying codes
• Separating hash families: a Johnson-type bound and new constructions
• Traceability codes
• Tracing traitors

Cited in

(12)

• Generalized hashing and parent-identifying codes.
• Some intriguing upper bounds for separating hash families
• Multimedia IPP codes with efficient tracing
• Traceability codes and their generalizations
• Wide-sense 2-frameproof codes
• Improved upper bounds for parent-identifying set systems and separable codes
• Optimal 2-traceability codes of length 4
• A note on an upper bound of traceability codes
• Probabilistic Existence Results for Parent-Identifying Schemes
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
• Lemmas on traceability codes and an upper bound for 4-traceability
• New upper bounds for wide-sense frameproof codes

This page was built for publication: New upper bounds for parent-identifying codes and traceability codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650430)