Tracing traitors
From MaRDI portal
Publication:4545764
DOI10.1109/18.841169zbMath1007.94017OpenAlexW2295616646MaRDI QIDQ4545764
Benny Chor, Benny Pinkas, Moni Naor, Amos Fiat
Publication date: 15 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/becddb754d41fa2055be5d50eac0cade5b4004ce
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
On the measurement complexity of differentially private query answering ⋮ Almost separating and almost secure frameproof codes over \(q\)-ary alphabets ⋮ Pirate decoder for the broadcast encryption schemes from Crypto 2005 ⋮ Codes for copyright protection: the case of two pirates ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Traceable PRFs: Full Collusion Resistance and Active Security ⋮ New approaches to traitor tracing with embedded identities ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Individual cryptography ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Optimal 2-traceability codes of length 4 ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Uniqueness of some optimal superimposed codes ⋮ A Note About the Traceability Properties of Linear Codes ⋮ On the Effects of Pirate Evolution on the Design of Digital Content Distribution Systems ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ On 2-parent-identifying set systems of block size 4 ⋮ 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 ⋮ Union-intersection-bounded families and their applications ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Defending against the Pirate Evolution Attack ⋮ Trade-Off Traitor Tracing ⋮ Separable collusion-secure multimedia codes ⋮ Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes ⋮ Improved versions of Tardos' fingerprinting scheme ⋮ Upper bounds for parent-identifying set systems ⋮ What Can We Learn Privately? ⋮ A class of I.P.P. codes with efficient identification ⋮ Upper Bounds for Set Systems with the Identifiable Parent Property ⋮ Efficient Traitor Tracing from Collusion Secure Codes ⋮ Distributing hash families with few rows ⋮ The Complexity of Differential Privacy ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
