Cryptography Reference
In-Depth Information
49. C. Gentry, Z. Ramzan, and D. P. Woodruff. Explicit exclusive set systems with
applications to broadcast encryption. In FOCS, pages 27-38. IEEE Computer
Society, 2006.
50. M. T. Goodrich, J. Z. Sun, and R. Tamassia. E
cient tree-based revocation
in groups of low-state devices. In M. K. Franklin, editor, CRYPTO, volume
3152 of Lecture Notes in Computer Science, pages 511-527. Springer, 2004.
51. V. Guruswami and M. Sudan. Improved decoding of reed-solomon and
algebraic-geometric codes. In FOCS, pages 28-39, 1998.
52. H.-J. Guth and B. Pfitzmann. Error- and collusion-secure fingerprinting for
digital data. In A. Pfitzmann, editor, Information Hiding, volume 1768 of
Lecture Notes in Computer Science, pages 134-145. Springer, 1999.
53. D. Halevy and A. Shamir. The lsd broadcast encryption scheme. In M. Yung,
editor, CRYPTO, volume 2442 of Lecture Notes in Computer Science, pages
47-60. Springer, 2002.
54. H. D. L. Hollmann, J. H. van Lint, J.-P. M. G. Linnartz, and L. M. G. M.
Tolhuizen. On codes with the identifiable parent property. J. Comb. Theory,
Ser. A, 82(2):121-133, 1998.
55. J. Y. Hwang, D. H. Lee, and J. Lim. Generic transformation for scalable
broadcast encryption schemes. In Shoup [
109
], pages 276-292.
56. Y. H. Hwang and P. J. Lee. E
cient broadcast encryption scheme with log-key
storage. In G. D. Crescenzo and A. D. Rubin, editors, Financial Cryptography,
volume 4107 of Lecture Notes in Computer Science, pages 281-295. Springer,
2006.
57. N.-S. Jho, J. Y. Hwang, J. H. Cheon, M.-H. Kim, D. H. Lee, and E. S. Yoo.
One-way chain based broadcast encryption schemes.
In Cramer [
31
], pages
559-574.
58. H. Jin and J. Lotspiech. Renewable traitor tracing: A trace-revoke-trace system
for anonymous attack. In J. Biskup and J. Lopez, editors, ESORICS, volume
4734 of Lecture Notes in Computer Science, pages 563-577. Springer, 2007.
59. H. Jin and J. B. Lotspiech. Defending against the pirate evolution attack. In
F. Bao, H. Li, and G. Wang, editors, ISPEC, volume 5451 of Lecture Notes in
Computer Science, pages 147-158. Springer, 2009.
60. H. Jin and S. Pehlivanoglu. Traitor tracing without a priori bound on the
coalition size. In P. Samarati, M. Yung, F. Martinelli, and C. A. Ardagna,
editors, ISC, volume 5735 of Lecture Notes in Computer Science, pages 234-
241. Springer, 2009.
61. P. Junod, A. Karlov, and A. K. Lenstra. Improving the boneh-franklin traitor
tracing scheme. In S. Jarecki and G. Tsudik, editors, Public Key Cryptography,
volume 5443 of Lecture Notes in Computer Science, pages 88-104. Springer,
2009.
62. A. Kiayias and S. Pehlivanoglu. Pirate evolution: How to make the most of
your traitor keys. In A. Menezes, editor, CRYPTO, volume 4622 of Lecture
Notes in Computer Science, pages 448-465. Springer, 2007.
63. A. Kiayias and S. Pehlivanoglu. On the security of a public-key traitor trac-
ing scheme with sublinear ciphertext size. In E. Al-Shaer, H. Jin, and G. L.
Heileman, editors, Digital Rights Management Workshop, pages 1-10. ACM,
2009.
64. A. Kiayias and S. Pehlivanoglu. Tracing and revoking pirate rebroadcasts. In
