Combinatorial properties of frameproof and traceability codes
From MaRDI portal
Publication:4544540
DOI10.1109/18.915661zbMath1001.94032OpenAlexW2165902826MaRDI QIDQ4544540
Jessica N. Staddon, Rui Zhong Wei, Douglas R. Stinson
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/20517c7b4b15adc84988f371801ffeb156b598a2
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Bounds on codes (94B65) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)
Related Items
An upper bound on the size of a code with the \(k\)-identifiable parent property, Almost separating and almost secure frameproof codes over \(q\)-ary alphabets, Bounds and constructions for \(\overline{3}\)-separable codes with length 3, Separating Hash Families: A Johnson-type bound and New Constructions, On the Properties of Algebraic Geometric Codes as Copy Protection Codes, Sliding-window dynamic frameproof codes, Sequential and dynamic frameproof codes, On optimal codes with \(w\)-identifiable parent property, Explicit constructions of separating hash families from algebraic curves over finite fields, Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection, New upper bounds for parent-identifying codes and traceability codes, Separation and Witnesses, Improved bounds for separating hash families, Traceable PRFs: Full Collusion Resistance and Active Security, New approaches to traitor tracing with embedded identities, Black-box Trace\&Revoke codes, Multimedia IPP codes with efficient tracing, On tight bounds for binary frameproof codes, 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 non-binary traceability set systems, Bounds for separating hash families, Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions, Optimal 2-traceability codes of length 4, Generalized hashing and parent-identifying codes., Wide-sense 2-frameproof codes, Traceability codes, Collusion Resistant Traitor Tracing from Learning with Errors, On codes with \(w\)-identifiable parent property, A Note About the Traceability Properties of Linear Codes, Some intriguing upper bounds for separating hash families, New bounds on \(\bar{2}\)-separable codes of length 2, On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems, ON APPLICATION OF ALGEBRAIC GEOMETRY CODES OF L-CONSTRUCTION IN COPY PROTECTION, Constructions of almost secure frameproof codes with applications to fingerprinting schemes, On traceability property of equidistant codes, Asymptotically optimal \(\overline {2}\)-separable codes with length 4, On generalized separating hash families, Cover-free codes and separating system codes, New bounds on 2-frameproof codes of length 4, 2-secure codes from 2-SFP codes, Codes with the identifiable parent property for multimedia fingerprinting, Bounds on the rate of separating codes, A tight bound for frameproof codes viewed in terms of separating hash families, A bound on the size of separating hash families, Improved bounds on 2-frameproof codes with length 4, Binary fingerprinting codes, Recursive constructions of secure codes and hash families using difference function families., Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys, New constructions for IPP codes, A new kind of selectors and their applications to conflict resolution in wireless multichannels networks, Watermarking cryptographic functionalities from standard lattice assumptions, Constructions and bounds for separating hash families, Defending against the Pirate Evolution Attack, Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes, Upper bounds for parent-identifying set systems, A class of I.P.P. codes with efficient identification, A study of the separating property in Reed-Solomon codes by bounding the minimum distance
