Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
From MaRDI portal
(Redirected from Publication:4388977)
Recommendations
- Combinatorial properties of frameproof and traceability codes
- New results on frame-proof codes and traceability schemes
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Comments on "New results on frame-proof codes and traceability schemes
- A note on an upper bound of traceability codes
- A Note About the Traceability Properties of Linear Codes
- On the relationship between the traceability properties of Reed-Solomon codes
- scientific article; zbMATH DE number 2069521
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- On tight bounds for binary frameproof codes
Cited in
(56)- Upper bounds for parent-identifying set systems
- Generalized cover-free families.
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Frameproof codes against limited coalitions of pirates
- Hardness of \(k\)-LWE and applications in traitor tracing
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- Improved bounds on 2-frameproof codes with length 4
- New constructions for IPP codes
- Intersecting codes and separating codes
- A class of I.P.P. codes with efficient identification
- Complete tree subset difference broadcast encryption scheme and its analysis
- On 2-parent-identifying set systems of block size 4
- Union-intersection-bounded families and their applications
- New approaches to traitor tracing with embedded identities
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- On non-binary traceability set systems
- Wide-sense 2-frameproof codes
- Improved upper bounds for parent-identifying set systems and separable codes
- A tight bound for frameproof codes viewed in terms of separating hash families
- Distributing hash families with few rows
- Sliding-window dynamic frameproof codes
- Sequential and dynamic frameproof codes
- Binary fingerprinting codes
- A public-key traitor tracing scheme with revocation using dynamic shares
- Optimal 2-traceability codes of length 4
- Intersecting codes and partially identifying codes
- Linear Time Constructions of Some d-Restriction Problems
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- scientific article; zbMATH DE number 6534450 (Why is no real title available?)
- On symmetric designs and binary 3-frameproof codes
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- \((2,1)\)-separating systems beyond the probabilistic bound
- scientific article; zbMATH DE number 1996248 (Why is no real title available?)
- Combinatorial properties of frameproof and traceability codes
- New results on frame-proof codes and traceability schemes
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- Collusion resistant traitor tracing from learning with errors
- On application of algebraic geometry codes of \(L\)-construction in copy protection
- Comments on "New results on frame-proof codes and traceability schemes
- Separating hash families: a Johnson-type bound and new constructions
- Separation and Witnesses
- Upper Bounds for Set Systems with the Identifiable Parent Property
- 2-secure codes from 2-SFP codes
- Scalable public-key tracing and revoking
- Watermarking cryptographic functionalities from standard lattice assumptions
- Some new p-ary two-secure frameproof codes
- 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
- A survey of cover-free families: constructions, applications, and generalizations
- New upper bounds for wide-sense frameproof codes
- Constructions of \(\bar{3}\)-separable codes with length 4
- Fully collusion resistant traceable identity-based inner product functional encryption
- On tight bounds for binary frameproof codes
This page was built for publication: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388977)
