MARKS: Multicast Key Management using Arbitrarily Revealed Key Sequences

The goal of this work is to separately control individual secure sessions between unlimited pairs of multicast receivers and senders. At the same time, the solution given preserves the scalability of receiver initiated Internet multicast for the data transfer itself. Unlike other multicast key management solutions, there are absolutely no side eects on other receivers when a single receiver joins or leaves a session and no smartcards are required. Solutions are presented for single and for multi-sender multicast. Further, we show how each receiver’s data can be subject to an individual, watermarked audit trail. The cost per receiver-session is typically just one short set-up message exchange with a key manager. Key managers can be replicated without limit because they are only loosely coupled to the senders who can remain oblivious to members being added or removed. The technique is a general solution for access to an arbitrary sub-range of a sequence of information and for its revocation, as long as each session end can be planned at the time each access is requested. It might therefore also be appropriate for virtual private networks or for information distribution on other duplicated media such as DVD.

[1]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 1998, SIGCOMM '98.

[2]  Moni Naor,et al.  Threshold Traitor Tracing , 1998, CRYPTO.

[3]  Suvo Mittra,et al.  Iolus: a framework for scalable secure multicasting , 1997, SIGCOMM '97.

[4]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.

[5]  Dilip D. Kandlur,et al.  Key management for secure lnternet multicast using Boolean function minimization techniques , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Alan T. Sherman,et al.  Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization , 2000 .

[7]  염흥렬,et al.  [서평]「Applied Cryptography」 , 1997 .

[8]  Colin Perkins,et al.  Watercasting: Distributed Watermarking of Multicast Media , 1999, Networked Group Communication.

[9]  Peter Bagnall,et al.  Taxonomy of Communication Requirements for Large-scale Multicast Applications , 1999, RFC.

[10]  Ralf Steinmetz,et al.  Evaluation of Different Video Encryption Methods for a Secure Multimedia Conferencing Gateway , 1997, COST 237 Workshop.

[11]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[12]  Thierry Turletti,et al.  A N aming Approach for ALF Design , 1998 .

[13]  Mark Handley,et al.  On Scalable Internet Multimedia Conferencing Systems , 1997 .

[14]  Bob Briscoe,et al.  Nark: receiver-based multicast non-repudiation and key management , 1999, EC '99.

[15]  Charalampos Manifavas,et al.  Chameleon - A New Kind of Stream Cipher , 1997, FSE.

[16]  Chak-Kuen Wong,et al.  A conference key distribution system , 1982, IEEE Trans. Inf. Theory.