Cryptography Reference
In-Depth Information
83. M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In
EUROCRYPT, pages 512-526, 1998.
84. T. Matsushita and H. Imai. A public-key black-box traitor tracing scheme with
sublinear ciphertext size against self-defensive pirates. In P. J. Lee, editor,
ASIACRYPT, volume 3329 of Lecture Notes in Computer Science, pages 260-
275. Springer, 2004.
85. M. Mitzenmacher and E. Upfal. Probability and Computing: randomized algo-
rithms and probabilistic analysis. Cambridge University Press, London, 2005.
86. D. Naccache, editor. Topics in Cryptology - CT-RSA 2001, The Cryptog-
rapher's Track at RSA Conference 2001, San Francisco, CA, USA, April 8-
12, 2001, Proceedings, volume 2020 of Lecture Notes in Computer Science.
Springer, 2001.
87. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for
stateless receivers. In Kilian [
72
], pages 41-62.
88. D. Naor, M. Naor, and J. Lotspiech. Revocation and tracing schemes for state-
less receivers. Electronic Colloquium on Computational Complexity (ECCC),
(043), 2002.
89. M. Naor and B. Pinkas. Threshold traitor tracing. In H. Krawczyk, editor,
CRYPTO, volume 1462 of Lecture Notes in Computer Science, pages 502-517.
Springer, 1998.
90. M. Naor and B. Pinkas. E
cient trace and revoke schemes. In Y. Frankel,
editor, Financial Cryptography, volume 1962 of Lecture Notes in Computer
Science, pages 1-20. Springer, 2000.
91. M. Naor and M. Yung. Public-key cryptosystems provably secure against cho-
sen ciphertext attacks. In STOC, pages 427-437. ACM, 1990.
92. K. Nuida, M. Hagiwara, H. Watanabe, and H. Imai. Optimization of tardos's
fingerprinting codes in a viewpoint of memory amount. In T. Furon, F. Cayre,
G. J. Doerr, and P. Bas, editors, Information Hiding, volume 4567 of Lecture
Notes in Computer Science, pages 279-293. Springer, 2007.
93. C. Peikert, A. Shelat, and A. Smith. Lower bounds for collusion-secure finger-
printing. In SODA, pages 472-479, 2003.
94. B. Pfitzmann. Trials of traced traitors. In R. J. Anderson, editor, Informa-
tion Hiding, volume 1174 of Lecture Notes in Computer Science, pages 49-64.
Springer, 1996.
95. B. Pfitzmann and M. Schunter. Asymmetric fingerprinting (extended abstract).
In EUROCRYPT, pages 84-95, 1996.
96. B. Pfitzmann and M. Waidner. Asymmetric fingerprinting for larger collusions.
In ACM Conference on Computer and Communications Security, pages 151-
160, 1997.
97. Z. Ramzan and D. P. Woodruff. Fast algorithms for the free riders problem in
broadcast encryption. In C. Dwork, editor, CRYPTO, volume 4117 of Lecture
Notes in Computer Science, pages 308-325. Springer, 2006.
98. R. L. Rivest. All-or-nothing encryption and the package transform. In E. Bi-
ham, editor, FSE, volume 1267 of Lecture Notes in Computer Science, pages
210-218. Springer, 1997.
99. R. Safavi-Naini and Y. Wang. Sequential traitor tracing. In Bellare [
8
], pages
316-332.
100. R. Safavi-Naini and Y. Wang. New results on frame-proof codes and trace-
ability schemes. IEEE Transactions on Information Theory, 47(7):3029-3033,
2001.
