Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
From MaRDI portal
Publication:4388977
DOI10.1137/S0895480196304246zbMATH Open0972.94028OpenAlexW2002087984MaRDI QIDQ4388977FDOQ4388977
Authors: D. R. Stinson, Ruizhong Wei 
Publication date: 11 May 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480196304246
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cited In (53)
- Wide-sense 2-frameproof codes
- Intersecting codes and partially identifying codes
- New results on frame-proof codes and traceability schemes
- Complete tree subset difference broadcast encryption scheme and its analysis
- Sequential and dynamic frameproof codes
- A public-key traitor tracing scheme with revocation using dynamic shares
- Frameproof codes against limited coalitions of pirates
- \((2,1)\)-separating systems beyond the probabilistic bound
- Generalized cover-free families.
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- New constructions for IPP codes
- Distributing hash families with few rows
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Combinatorial properties of frameproof and traceability codes
- On Symmetric Designs and Binary 3-Frameproof Codes
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Separating Hash Families: A Johnson-type bound and New Constructions
- Improved bounds on 2-frameproof codes with length 4
- Watermarking cryptographic functionalities from standard lattice assumptions
- Upper Bounds for Set Systems with the Identifiable Parent Property
- Collusion Resistant Traitor Tracing from Learning with Errors
- Intersecting codes and separating codes
- Some new \(p\)-ary two-secure frameproof codes
- Upper bounds for parent-identifying set systems
- On tight bounds for binary frameproof codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Title not available (Why is that?)
- Binary fingerprinting codes
- Comments on "New results on frame-proof codes and traceability schemes
- On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems
- 2-secure codes from 2-SFP codes
- Sliding-window dynamic frameproof codes
- Separation and Witnesses
- On 2-parent-identifying set systems of block size 4
- Improved upper bounds for parent-identifying set systems and separable codes
- Hardness of \(k\)-LWE and applications in traitor tracing
- A tight bound for frameproof codes viewed in terms of separating hash families
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- ON APPLICATION OF ALGEBRAIC GEOMETRY CODES OF L-CONSTRUCTION IN COPY PROTECTION
- A class of I.P.P. codes with efficient identification
- Title not available (Why is that?)
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Union-intersection-bounded families and their applications
- Optimal 2-traceability codes of length 4
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- On non-binary traceability set systems
- Generic construction of trace-and-revoke inner product functional encryption
- New approaches to traitor tracing with embedded identities
- Scalable public-key tracing and revoking
- A survey of cover-free families: constructions, applications, and generalizations
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)
