%0 Conference Paper %B Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on %D 2005 %T Mitigating risk of data loss in preservation environments %A Moore,R.W. %A JaJa, Joseph F. %A Chadduck,R. %K archives; %K authentication; %K authenticity; %K computing; %K data %K databases; %K digital %K distributed %K environment; %K Grid %K integrity; %K management; %K message %K objects; %K persistent %K preservation %K record %K risk %K storage %X 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. %B Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on %P 39 - 48 %8 2005/04// %G eng %R 10.1109/MSST.2005.20 %0 Journal Article %J Selected Areas in Communications, IEEE Journal on %D 2002 %T Scalable secure group communication over IP multicast %A Banerjee,S. %A Bhattacharjee, Bobby %K access %K algorithm; %K authentication; %K Bandwidth %K communication; %K CONTROL %K costs; %K cryptography; %K dynamics; %K group %K group; %K Internet %K Internet-like %K Internet; %K IP %K logarithmic %K map; %K membership; %K message %K Multicast %K multicast; %K network %K overhead; %K PROCESSING %K protocol %K protocols; %K rekeying %K requirements; %K routers; %K routing; %K scalable %K secure %K security; %K server; %K simulation; %K storage %K Telecommunication %K topologies; %K Topology %K topology; %K transport %K usage; %X 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. %B Selected Areas in Communications, IEEE Journal on %V 20 %P 1511 - 1527 %8 2002/10// %@ 0733-8716 %G eng %N 8 %R 10.1109/JSAC.2002.803986