<<

. 11
( 11 .)



information (or rather a succinct representation of
it) can be reduced to 1 log2 N based on a GGM-like graphic keys: The trace and revoke approach.” The
2
Computer Journal, 36 (7), 47“53.
tree construction; for details see [14].
[14] Naor, D., M. Naor and J. Lotspiech (2001). “Revo-
cation and tracing schemes for stateless receivers.”
Dalit Naor
Advances in Cryptology”CRYPTO 2001, Lecture
Notes in Computer Science, vol. 2139, ed. J.
References Killian. Springer, Berlin, 41“62. Full version:
ECCC Report 43, 2002. Available: http://www.eccc
.uni-trier.de/eccc/
[1] Berkovits, S. (1991). “How to Broadcast a Secret.”
[15] Naor, M. and B. Pinkas (2001). “Ef¬cient trace and
Advances in Cryptology”EUROCRYPT™91, Lec-
revoke schemes.” Financial Cryptography, 4th In-
ture Notes in Computer Science, vol. 547, ed. D.W.
ternational Conference, FC 2000 Proceedings, Lec-
Davies. Springer, Berlin, 535“541.
ture Notes in Computer Science, vol. 1962, ed. Y.
[2] Canetti, R., J. Garay, G. Itkis, D. Micciancio,
Frankel. Springer, Berlin, 1“20.
M. Naor, and B. Pinkas (1999). “Multicast secu-
[16] Perrig, A., D. Song, and J.D. Tygar (2001). “ELK, a
rity: A taxonomy and some ef¬cient constructions.”
new protocol for ef¬cient large-group key distribu-
Proc. of Proceedings IEEE INFOCOM™99, vol. 2,
tion.” 2001 IEEE Symposium on Research in Secu-
708“716.
rity and Privacy, 247“262.
[3] Canetti, R., T. Malkin, and K. Nissim (1999).
[17] Waldvogel, M., G. Caronni, D. Sun, N. Weiler, and
“Ef¬cient communication-storage tradeoffs for
B. Plattner (1999). “The VersaKey framework: Ver-
multicast encryption.” Advances in Cryptology”
satile group key management.” IEEE Journal on
EUROCRYPT™99, Lecture Notes in Computer Sci-
Selected Areas in Communications, 17 (9), 1614“
ence, vol. 1592, ed. J. Stern. Springer, Berlin, 459“
1631.
474.
[18] Wallner, D.M., E.J. Harder, and R.C. Agee (1999).
[4] Content Protection for Recordable Media. Avail-
“Key management for multicast: Issues and archi-
able: http://www.4centity.com/4centity/tech/cprm
tectures.” Internet Request for Comments 2627.
[5] Fiat, A. and M. Naor (1994). “Broadcast encryp-
Available: ftp.ietf.org/rfc/rfc2627.txt
tion.” Advances in Cryptology”CRYPTO™93, Lec-
[19] Wong, C.K., M. Gouda, and S. Lam (1998). “Secure
ture Notes in Computer Science, vol. 773, ed. D.R.
group communications using key graphs.” Proc.
Stinson. Springer, Berlin, 480“491.
ACM SIGCOMM™98, 68“79.
[6] Garay, J.A., J. Staddon, and A. Wool (2000).
[20] Wong, C.K. and S. Lam (2000). “Keystone: A group
“Long-lived broadcast encryption.” Advances in
key management service.” International Confer-
Cryptology”CRYPTO 2000, Lecture Notes in
ence on Telecommunications, Acapulco, Mexico,
Computer Science, vol. 1880, ed. M. Bellare.
May 2000.
Springer-Verlag, Heidelberg, 333“352.
60

<<

. 11
( 11 .)