References - Encryption for Digital Content - page 202

65. A. Kiayias and S. Pehlivanoglu. Detecting and revoking pirate redistribution
of content. U.S. Patent, Publication Number 2010/0043081, 2010.
66. A. Kiayias and S. Pehlivanoglu. Improving the round complexity of traitor
tracing schemes. In J. Zhou and M. Yung, editors, ACNS, Lecture Notes in
Computer Science, 2010.
67. A. Kiayias and M. Yung. On crafty pirates and foxy tracers. In Sander [ 104 ] ,
pages 22-39.
68. A. Kiayias and M. Yung. Self protecting pirates and black-box traitor tracing.
In Kilian [ 72 ] , pages 63-79.
69. A. Kiayias and M. Yung. Breaking and repairing asymmetric public-key traitor
tracing. In Feigenbaum [ 41 ], pages 32-50.
70. A. Kiayias and M. Yung. Traitor tracing with constant transmission rate.
In L. R. Knudsen, editor, EUROCRYPT, volume 2332 of Lecture Notes in
Computer Science, pages 450-465. Springer, 2002.
71. A. Kiayias and M. Yung. Public-key traitor tracing from e cient decoding and
unbounded enrollment: extended abstract. In G. L. Heileman and M. Joye,
editors, Digital Rights Management Workshop, pages 9-18. ACM, 2008.
72. J. Kilian, editor. Advances in Cryptology - CRYPTO 2001, 21st Annual In-
ternational Cryptology Conference, Santa Barbara, California, USA, August
19-23, 2001, Proceedings, volume 2139 of Lecture Notes in Computer Science.
Springer, 2001.
73. D. Kirovski and F. A. P. Petitcolas. Replacement attack on arbitrary water-
marking systems. In Feigenbaum [ 41 ], pages 177-189.
74. N. Kogan, Y. Shavitt, and A. Wool. A practical revocation scheme for broad-
cast encryption using smart cards. In IEEE Symposium on Security and Pri-
vacy, pages 225-235. IEEE Computer Society, 2003.
75. H. Komaki, Y. Watanabe, G. Hanaoka, and H. Imai. E cient asymmetric
self-enforcement scheme with public traceability. In K. Kim, editor, Public
Key Cryptography, volume 1992 of Lecture Notes in Computer Science, pages
225-239. Springer, 2001.
76. R. Kumar, S. Rajagopalan, and A. Sahai. Coding constructions for blacklist-
ing problems without computational assumptions. In M. J. Wiener, editor,
CRYPTO, volume 1666 of Lecture Notes in Computer Science, pages 609-623.
Springer, 1999.
77. R. Kumar and A. Russell. A note on the set systems used for broadcast
encryption. In SODA, pages 470-471, 2003.
78. K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric
schemes. In EUROCRYPT, pages 145-157, 1998.
79. K. Kurosawa and T. Yoshida. Linear code implies public-key traitor tracing.
In D. Naccache and P. Paillier, editors, Public Key Cryptography, volume 2274
of Lecture Notes in Computer Science, pages 172-187. Springer, 2002.
80. M. Lee, D. Ma, and M. Seo. Breaking two k-resilient traitor tracing schemes
with sublinear ciphertext size. In Abdalla et al. [ 2 ], pages 238-252.
81. T. Lindkvist. Fingerprinting Digital Documents. PhD thesis, Linkoping Studies
in Science and Technology, 1999.
82. D. Liu, P. Ning, and K. Sun. E cient self-healing group key distribution with
revocation capability. In S. Jajodia, V. Atluri, and T. Jaeger, editors, ACM
Conference on Computer and Communications Security, pages 231-240. ACM,
2003.