Efficient state updates for key management

Proceedings of the IEEE

Volumn 92, Issue 6, 2004, Pages 910-917

  Pinkas, Benny ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Broadcast encryption; Digital rights management (DRM); Revocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DIGITAL COMMUNICATION SYSTEMS; HIERARCHICAL SYSTEMS; INFORMATION MANAGEMENT; SERVERS;

BROADCAST ENCRYPTION; DIGITAL RIGHTS MANAGEMENT (DRM); LOGICAL KEY HIERARCHY (LKH); REVOCATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 18844424009     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2004.827355     Document Type: Conference Paper

References (18)

1. J. Anzai, N. Matsuzaki, and T. Matsumoto, "A quick group key distribution scheme with entity revocation," in Lecture Notes in Computer Science, Advances in Cryptology. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1716, pp. 333-347.
2. B. Briscoe, "MARKS: zero side effect multicast key management using arbitrarily revealed key sequences," in Proc. 1st Int. Workshop Networked Group Communication (NGC'99), pp. 301-320.
3. R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast security: a taxonomy and some efficient constructions," in Proc. INFOCOM '99, vol. 2, pp. 708-716.
4. H. Edelsbrunner, Algorithms in Combinatorial Geometry. Heidelberg, Germany: Springer-Verlag, 1987.
5. A. Fiat and M. Naor, "Broadcast encryption," in Lecture Notes in Computer Science, Advances in Cryptology. Heidelberg, Germany: Springer-Verlag, 1994, vol. 773, pp. 480-491.
6. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," J. ACM, vol. 33, no. 4, pp. 792-807, 1986.
7. R. Kumar, S. Rajagopalan, and A. Sahai, "Coding constructions for blacklisting problems without computational assumptions," in Lecture Notes in Computer Science, Advances in Cryptology. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1666, pp. 609-623.
8. M. Luby, Pseudorandomness and Cryptographic Applications. Princeton, NJ: Princeton Univ. Press, 1996, Princeton Computer Science Notes.
9. M. Luby and J. Staddon, "Combinatorial bounds for broadcast encryption," in Lecture Notes in Computer Science, Advances in Cryptology. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1403, pp. 512-526.
10. D. Naor, M. Naor, and J. Lotspiech, "Revocation and tracing schemes for stateless receivers," in Lecture Notes in Computer Science, Advances in Cryptology. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2139, pp. 41-62.
11. D. McGrew and A. T. Sherman, "Key establishment in large groups using one-way function trees," IEEE Trans. Software Eng., vol. 29, pp. 444-458, May 2003.
12. M. Naor and B. Pinkas, "Efficient trace and revoke schemes," in Proc. Financial Crypto '2000, 2000, pp. 1-20.
13. M. Naor and O. Reingold, "Number-theoretic constructions of efficient pseudo-random functions," in Proc. 38th IEEE Symp. Foundations of Computer Science, 1997, pp. 458-467.
14. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlag, 1985.
15. M. Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner, "The VersaKey framework: versatile group key management," IEEE J. Select. Areas Commun., vol. 17, pp. 1614-1631, Sept. 1999.
16. D. M. Wallner, E. Harder, and R. C. Agee, "Key management for multicast: Issues and architecture," Network Working Group, RFC 2627, June 1999.
17. C. K. Wong, M. Gouda, and S. S. Lam, "Secure group communications using key graphs," in Proc. SIGCOMM '98, pp. 68-79.
18. A. Wool, "Key management for encrypted broadcast," ACM Trans. Inf. Syst. Security, vol. 3, no. 2, pp. 107-134, 2000.