@conference {14986,
	title = {Mitigating risk of data loss in preservation environments},
	booktitle = {Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on},
	year = {2005},
	month = {2005/04//},
	pages = {39 - 48},
	abstract = {Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.},
	keywords = {archives;, authentication;, authenticity;, computing;, data, databases;, digital, distributed, environment;, Grid, integrity;, management;, message, objects;, persistent, preservation, record, risk, storage},
	doi = {10.1109/MSST.2005.20},
	author = {Moore,R.W. and JaJa, Joseph F. and Chadduck,R.}
}
@article {18187,
	title = {Data hiding in binary image for authentication and annotation},
	journal = {Multimedia, IEEE Transactions on},
	volume = {6},
	year = {2004},
	month = {2004/08//},
	pages = {528 - 538},
	abstract = {This paper proposes a new method to embed data in binary images, including scanned text, figures, and signatures. The method manipulates "flippable" pixels to enforce specific block-based relationship in order to embed a significant amount of data without causing noticeable artifacts. Shuffling is applied before embedding to equalize the uneven embedding capacity from region to region. The hidden data can be extracted without using the original image, and can also be accurately extracted after high quality printing and scanning with the help of a few registration marks. The proposed data embedding method can be used to detect unauthorized use of a digitized signature, and annotate or authenticate binary documents. The paper also presents analysis and discussions on robustness and security issues.},
	keywords = {annotation;, authentication;, binary, coding;, data, digital, digitized, document, EMBEDDING, encapsulation;, extraction;, feature, hiding;, image, image;, method;, signature;, unauthorized, user;, watermarking;},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2004.830814},
	author = {M. Wu and Liu,Bede}
}
@article {18194,
	title = {Data hiding in image and video .II. Designs and applications},
	journal = {Image Processing, IEEE Transactions on},
	volume = {12},
	year = {2003},
	month = {2003/06//},
	pages = {696 - 705},
	abstract = {For pt. I see ibid., vol.12, no.6, p.685-95 (2003). This paper applies the solutions to the fundamental issues addressed in Part I to specific design problems of embedding data in image and video. We apply multilevel embedding to allow the amount of embedded information that can be reliably extracted to be adaptive with respect to the actual noise conditions. When extending the multilevel embedding to video, we propose strategies for handling uneven embedding capacity from region to region within a frame as well as from frame to frame. We also embed control information to facilitate the accurate extraction of the user data payload and to combat such distortions as frame jitter. The proposed algorithm can be used for a variety of applications such as copy control, access control, robust annotation, and content-based authentication.},
	keywords = {access, annotation;, authentication;, capacity;, conditions;, content-based, CONTROL, control;, copy, data, distortions;, EMBEDDING, embedding;, encapsulation;, extraction;, frame, hiding;, image, information;, jitter;, message, multilevel, NOISE, noise;, payload, processing;, robust, signal, uneven, user, video},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2003.810589},
	author = {M. Wu and Yu,H. and Liu,Bede}
}
@article {18234,
	title = {Joint security and robustness enhancement for quantization based data embedding},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {13},
	year = {2003},
	month = {2003/08//},
	pages = {831 - 841},
	abstract = {The paper studies joint security and robustness enhancement of quantization-based data embedding for multimedia authentication applications. We present an analysis showing that through a nontrivial run lookup table (LUT) that maps quantized multimedia features randomly to binary data, the probability of detection error can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion-compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {(signal);, authentication;, binary, compensation;, data, data;, DETECTION, digital, distortion, distortion;, embedding;, encapsulation;, enhancement;, error, features;, hiding;, lookup, lookup;, LUT;, message, multimedia, nontrivial, probability;, quantisation, quantization, quantized, Robustness, run, Security, statistics;, systems;, table, table;, watermarking;},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2003.815951},
	author = {Wu,M.}
}
@conference {18235,
	title = {Joint security robustness enhancement for quantization embedding},
	booktitle = {Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/09//},
	pages = {II - 483-6 vol.3 - II - 483-6 vol.3},
	abstract = {This paper studies joint security and robustness enhancement of quantization based data embedding for multimedia authentication applications. We present analysis showing that through a lookup table (LUT) of nontrivial run that maps quantized multimedia features randomly to binary data, the detection error probability can be considerably smaller than the traditional quantization embedding. We quantify the security strength of LUT embedding and enhance its robustness through distortion compensation. Introducing a joint security and capacity measure, we show that the proposed distortion compensated LUT embedding provides joint enhancement of security and robustness over the traditional quantization embedding.},
	keywords = {applications;, Authentication, authentication;, binary, communication;, data, data;, embedding;, error, joint, lookup, lookup;, message, multimedia, probability;, security;, statistics;, table, table;, watermarking;},
	doi = {10.1109/ICIP.2003.1246722},
	author = {Wu,M.}
}
@conference {18166,
	title = {Anti-collusion codes: multi-user and multimedia perspectives},
	booktitle = {Image Processing. 2002. Proceedings. 2002 International Conference on},
	volume = {2},
	year = {2002},
	month = {2002///},
	pages = {II-149 - II-152 vol.2 - II-149 - II-152 vol.2},
	abstract = {Digital fingerprinting is an effective method to identify users who might try to redistribute multimedia content, such as images and video. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cheap and effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are averaged or combined to disrupt the underlying fingerprint. We present a construction of collusion-resistant fingerprints based upon anti-collusion codes (ACC) and binary code modulation. ACC have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we build fingerprints that allow for the identification of groups of K or less colluders. We present a construction of binary-valued ACC under the logical AND operation using the theory of combinatorial designs. Our code construction requires only Oscr;( radic;n) orthogonal signals to accommodate n users. We demonstrate the performance of our ACC for fingerprinting multimedia by identifying colluders through experiments using real images.},
	keywords = {and, anti-collusion, authentication;, binary, code, codes;, coding;, combinatorial, computing;, content;, data, designs;, digital, embedding;, encapsulation;, fingerprinting;, image, images;, logical, mathematics;, message, Modulation, modulation;, multimedia, operation;, performance;, watermarking;},
	doi = {10.1109/ICIP.2002.1039909},
	author = {Trappe,W. and M. Wu and Liu,K. J.R}
}
@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}
}
