Threshold traitor tracing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1462, Issue , 1998, Pages 502-517

  Naor, Moni ^a   Pinkas, Benny ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PROBABILITY;

PIRATE DECODERS; TRAITOR TRACING; TV PROGRAMS;

DECODING;

EID: 84957617696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055750     Document Type: Conference Paper

References (19)

1. N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth, Construction of Asymptotically Good Low-Rate Error-Correcting Codes through Pseudo-Random Graphs, IEEE Transactions on Information Theory, vol. 38 (1992), 509-516.
2. N. Alon and J. Spencer, The Probabilistic Method, Wiley, 1992.
3. R. Anderson and M. Kuhn, Tamper Resistance-A Cautionary Note, Usenix Electronic Commerce Workshop, Oakland (1996), 1-11.
4. E. Biham and A. Shamir, Differential Fault Analysis of Secret Key Cryptosystems, Proc. Advances in Cryptology-Crypto '97, Springr-Verlag LNCS 1294 (1997), 513-525.
5. D. Boneh, R. A. Demillo and R. J. Lipton, On the Importance of Checking Computations, Proc. Advances in Cryptology-Eurocrypt '97 (1997), 37-51.
6. D. Boneh and J. Shaw, Collusion-Secure Fingerprinting for Digital date, Proc. Advances in Cryptology-Crypto '95 (1995), 452-465.
7. J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences 18 (1979), 143-154.
8. B. Chor, A. Fiat and M. Naor, Tracing Traitors, Proc. Advances in Cryptology-Crypto '94, Springr-Verlag LNCS 839 (1994), 257-270.
9. B. Chor, A. Fiat, M. Naor and B. Pinkas, Tracing Traitors, manuscript, (1998).
10. Cox I., Kilian J., Leighton T. and Shamoon T., A Secure, Robust Watermark for Multimedia, Information Hiding Workshop, Cambridge, UK, Springer-Verlag LNCS 1174, (1996), 185-206.
11. C. Dwork, J. Lotspiech and M. Naor, Digital Signets: Self-Enforcing Protection of Digital Information, 28th Symposium on the Theory of Computation (1996), 489-498.
12. P. Erdös, P. Frankl and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. of math. 51 (1985), 79-89.
13. A. Fiat and M. Naor, Broadcast Encryption, Proc. Advances in Cryptology-Crypto '93 (1994), 480-491.
14. M.L. Fredman, J. Komlós and E. Szemerédi, Storing a Sparse Table with 0(1) Worst Case Access Time, Journal of the ACM, Vol 31 (1984), 538-544.
15. K. Mehlhorn, Data Structures and Algorithms: Sorting and Searching, Springer-Verlag (1984).
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North Holland, Amsterdam, (1977).
17. B. Pfttzmann, Trials of Traced Traitors, Information Hiding Workshop, Cambridge, UK, Springer-Verlag LNCS 1174, (1996), 49-64.
18. D.M. Wallner, E. J. Harder, R.C. Agee, Key Management for Multicast: Issues and Architectures, internet draft draft-wallner-key-arch-00.txt (1997). Avaliable at ftp://ietf.org/internet-drafts/draft-wallner-key-arch-00.txt
19. M. N. Wegman and J. L. Carter, New Hash Functions and Their Use in Authentication and Set Equality, Journal of Computer and System Sciences 22 (1981), 265-279.