Combinatorial properties of frameproof and traceability codes
From MaRDI portal
Recommendations
Cited in
(71)- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Upper bounds for parent-identifying set systems
- Generalized hashing and parent-identifying codes.
- On a class of traceability codes
- New upper bounds for parent-identifying codes and traceability codes
- Some intriguing upper bounds for separating hash families
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Bounds on the rate of separating codes
- Improved bounds on 2-frameproof codes with length 4
- New constructions for IPP codes
- 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
- New bounds on 2-frameproof codes of length 4
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- New approaches to traitor tracing with embedded identities
- Multimedia IPP codes with efficient tracing
- On non-binary traceability set systems
- Wide-sense 2-frameproof codes
- A tight bound for frameproof codes viewed in terms of separating hash families
- Sliding-window dynamic frameproof codes
- Sequential and dynamic frameproof codes
- On optimal codes with \(w\)-identifiable parent property
- Bounds for separating hash families
- On generalized separating hash families
- Binary fingerprinting codes
- Recursive constructions of secure codes and hash families using difference function families.
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions
- Optimal 2-traceability codes of length 4
- Almost separating and almost secure frameproof codes over q-ary alphabets
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3
- Analysis of properties of q-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Defending against the Pirate Evolution Attack
- Improved bounds for separating hash families
- Black-box Trace\&Revoke codes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- scientific article; zbMATH DE number 1996248 (Why is no real title available?)
- New bounds on \(\bar{2}\)-separable codes of length 2
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- On traceability property of equidistant codes
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4
- Traceable PRFs: full collusion resistance and active security
- Cover-free codes and separating system codes
- Collusion resistant traitor tracing from learning with errors
- On application of algebraic geometry codes of \(L\)-construction in copy protection
- Codes with the identifiable parent property for multimedia fingerprinting
- Comments on "New results on frame-proof codes and traceability schemes
- Separating hash families: a Johnson-type bound and new constructions
- Separation and Witnesses
- A Note About the Traceability Properties of Linear Codes
- 2-secure codes from 2-SFP codes
- Watermarking cryptographic functionalities from standard lattice assumptions
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Detecting arrays for effects of single factors
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Generic construction of trace-and-revoke inner product functional encryption
- On codes with \(w\)-identifiable parent property
- A survey of cover-free families: constructions, applications, and generalizations
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
- Combinatorial constructions of separating codes
- On cover-free families of finite vector spaces
- Lemmas on traceability codes and an upper bound for 4-traceability
- New upper bounds for wide-sense frameproof codes
- Constructions and bounds for separating hash families
- Explicit constructions of separating hash families from algebraic curves over finite fields
- On tight bounds for binary frameproof codes
- A bound on the size of separating hash families
This page was built for publication: Combinatorial properties of frameproof and traceability codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544540)
