Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
From MaRDI portal
Publication:4388977
DOI10.1137/S0895480196304246zbMath0972.94028OpenAlexW2002087984MaRDI QIDQ4388977
Douglas R. Stinson, Rui Zhong 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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items
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, On Symmetric Designs and Binary 3-Frameproof Codes, Unnamed Item, Separation and Witnesses, \((2,1)\)-separating systems beyond the probabilistic bound, New approaches to traitor tracing with embedded identities, Linear Time Constructions of Some $$d$$-Restriction Problems, On tight bounds for binary frameproof codes, Complete tree subset difference broadcast encryption scheme and its analysis, Hardness of \(k\)-LWE and applications in traitor tracing, Generalization of IPP codes and IPP set systems, Traceability codes and their generalizations, 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, Optimal 2-traceability codes of length 4, Wide-sense 2-frameproof codes, Collusion Resistant Traitor Tracing from Learning with Errors, Generalized cover-free families., Improved upper bounds for parent-identifying set systems and separable codes, Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing, 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, 2-secure codes from 2-SFP codes, A tight bound for frameproof codes viewed in terms of separating hash families, Improved bounds on 2-frameproof codes with length 4, On 2-parent-identifying set systems of block size 4, Binary fingerprinting codes, Some new \(p\)-ary two-secure frameproof codes, Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys, New constructions for IPP codes, Union-intersection-bounded families and their applications, Watermarking cryptographic functionalities from standard lattice assumptions, Scalable public-key tracing and revoking, Upper bounds for parent-identifying set systems, Intersecting codes and separating codes, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, A class of I.P.P. codes with efficient identification, Upper Bounds for Set Systems with the Identifiable Parent Property, Distributing hash families with few rows, A public-key traitor tracing scheme with revocation using dynamic shares, Frameproof codes against limited coalitions of pirates
