Tracing traitors

By Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas. IEEE Transactions on Information Theory, 2000

764 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/becddb754d41fa2055be5d50eac0cade5b4004ce

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

Citations in the corpus

Interactive fingerprinting codes and the hardness of preventing false discovery (2014, neutral): “28 4.2 Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 4.3 An Information-Theoretic Lower Bound . . . . . . . . . . . . . . . . . . . . . . . 33 References 33 A Security Reductions from Sections 3 and 4 34”
Anti-collusion fingerprinting for multimedia (2003, neutral): “Wade Trappe, Member, IEEE, Min Wu, Member, IEEE, Z. Jane Wang, Member, IEEE, and K. J. Ray Liu, Fellow, IEEE”
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005, background): “Another problem is to build a tracing traitors system [CFN94] with the same parameters as our system.”
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (2014, background): “Private broadcast-encryption is further motivated by its application to traitor tracing systems [18].”
Preventing False Discovery in Interactive Data Analysis Is Hard (2014, methodology): “” Traitor-tracing schemes were introduced by Chor, Fiat, and Naor [11], also for the problem of secure distribution of digital content.”
SiRiUS: Securing Remote Untrusted Storage (2003, background): “A traitor-tracing scheme [8] allows the recovery, from a box capable of decoding broadcast transmissions, of the identity of (one of) the users who colluded in the box’s creation.”
Self Protecting Pirates and Black-Box Traitor Tracing (2001, methodology): “Thus, our work can be seen as retrofitting a design criterion for the early work of [CFN94] and it provides a separation with respect to black-box traceability between [CFN94, CFNP00] and [BF99,KD98].”
On optimal superimposed codes (2004, background): “Superimposed codes have wide applications in combinatorial science such as group testing (see [10,14,15]), perfect hash families (see [34]) , key storage in secure network (see [8], [26–29], [36]), and tracing traitors (see [6]).”
Secret handshakes from pairing-based key agreements (2003, neutral): “Finally, we note that we provide traitor tracing in the sense of [15].”
Answering n{2+o(1)} counting queries with differential privacy is hard (2012, methodology): “Our construction is based on a well-known fully collusion resilient traitor-tracing scheme [5], but with a modified tracing algorithm.”
On the complexity of differentially private data release: efficient algorithms and hardness results (2009, methodology): “On the Complexity of Differentially Private Data Release Ef.cient Algorithms and Hardness Results * Cynthia Dwork Moni Naor Omer Reingold Microsoft Research SVC Weizmann Institute Weizmann Institute § Guy N. Rothblum MIT ABSTRACT We consider private data analysis in the setting in which a trusted”
The Complexity of Differential Privacy (2017, methodology): “[28] as a cryptographic tool for preventing piracy of digital content, like fingerprinting codes.”
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (2010, background): “Traitor tracing systems, introduced by Chor, Fiat, and Naor [12], allow content distributors to identify pirates.”