@conference {18278,
	title = {Security evaluation for communication-friendly encryption of multimedia},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {569 - 572 Vol. 1 - 569 - 572 Vol. 1},
	abstract = {This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.},
	keywords = {access, approximation, atomic, attacks;, bitrate, coding;, communication-friendly, communication;, control;, cryptography;, data, encryption, encryption;, generic, joint, method;, metrics;, multimedia, multimedia-specific, overhead;, primitives;, processing/cryptographic, Security, security;, signal, system;, Telecommunication, video},
	doi = {10.1109/ICIP.2004.1418818},
	author = {Mao,Yinian and M. Wu}
}
@conference {18182,
	title = {Communication-friendly encryption of multimedia},
	booktitle = {Multimedia Signal Processing, 2002 IEEE Workshop on},
	year = {2002},
	month = {2002/12//},
	pages = {292 - 295},
	abstract = {This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that work in different domains, namely, a syntax-aware selective bitstream encryption tool with bit stuffing, a generalized index mapping encryption tool with controlled overhead and an intra-bitplane encryption tool compatible with fine granularity scalable coding. The designs of these proposed encryption operations take into consideration the inherent structure and syntax of multimedia sources and have improved friendliness to communications, compression and computation.},
	keywords = {bit, bitstream, coding;, Communication, communication;, compression, compression;, COMPUTATION, controlled, cryptography;, data, encryption, encryption;, fine, friendliness;, granularity, image, index, intrabitplane, MAPPING, multimedia, operation;, overhead;, scalable, selective, sources, stream;, stuffing;, syntax-aware, syntax;, tool;},
	doi = {10.1109/MMSP.2002.1203303},
	author = {M. Wu and Mao,Yinian}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
