Hidden proactive replication of data

Information security – Prevention of unauthorized use of data including prevention...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S150000, C713S193000

Reexamination Certificate

active

07631359

ABSTRACT:
Moving replicas in a cryptographically secure manner such that the target location and timing of the movements are completely hidden from any user, or is kept as a secret by a limited number of users who have been given advanced notice of the new location and relocation time for a replica. A catalog of replica locations that describe the current location of the replicas is stored in encrypted form so as to prevent individuals from determining the exact location of the replicas. Since the location of the replicas is hidden at any given moment, attackers may not use the location of the replicas in order to attack all of the replicas at the same time. Accordingly, recovery mechanisms may have an opportunity to recover from any given attack by once again creating replicas from those replicas that had not been attacked.

REFERENCES:
patent: 4558176 (1985-12-01), Arnold et al.
patent: 5812398 (1998-09-01), Nielsen
patent: 5835954 (1998-11-01), Duyanovich et al.
patent: 6145066 (2000-11-01), Atkin
patent: 6192472 (2001-02-01), Garay et al.
patent: 6292800 (2001-09-01), Eldreth
patent: 6324650 (2001-11-01), Ogilvie
patent: 6460055 (2002-10-01), Midgley et al.
patent: 6477583 (2002-11-01), Zayas et al.
patent: 6760808 (2004-07-01), Peters et al.
patent: 6973464 (2005-12-01), Gao
patent: 2001/0056546 (2001-12-01), Ogilvie
patent: 2002/0055942 (2002-05-01), Reynolds
patent: 2002/0099959 (2002-07-01), Redlich et al.
patent: 2002/0133590 (2002-09-01), McBrearty et al.
patent: 2003/0145086 (2003-07-01), O'Reilly
patent: 2003/0191938 (2003-10-01), Woods et al.
J. Gray, P. Helland, P. O'Neil, and D. Shasha. “The dangers of replication and a solution”. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 173-182, Jun. 1996. http://citeseer.ist.psu.edu/gray96danger.html.
J. Sidell, et al. “Data Replication in Mariposa,” Proceedings of the 12th International Conference on Data Engineering (Feb. 1996). http://citeseer.ist.psu.edu/article/sidell96data.html.
R. J. Anderson. The Eternity Service. In Proceedings of Pragocrypt '96, 1996. http://citeseer.ist.psu.edu/anderson96eternity.html.
J. Wylie, M. Bigrigg, J. Strunk, G. Ganger, H. Kiliccote and P. Khosla. Survivable information storage systems. IEEE Computer, Aug. 2000. http://citeseer.ist.psu.edu/wylie00survivable.html.
“Periodic” [definition], The American Heritage College Dictionary, 4thed., 2002, Houghton Mifflen Company.
Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, 2000. International Computer Science Institute. http://citeseer.ist.psu.edu/clarke00freenet.html.
Clarke, I. A distributed decentralised information storage and retrieval system, 1999. http://citeseer.ist.psu.edu/clarke99distributed.html.
C. Baru, R. Moore, A. Rajasekar, and M. Wan. The SDSC Storage Resource Broker. In Procs. of CASCON'98, Toronto, Canada, 1998. http://citeseer.ist.psu.edu/baru98sdsc.html.
Aschenbrenner, A. Long-Term Preservation of Digital Material. Thesis. Institut fr Softwaretechnik und Interaktive Systeme der Technischen Universitt Wien. 2001. http://citeseer.nj.nec.com/aschenbrenner01longterm.html http://citeseer.ist.psu.edu/aschenbrenner01longterm.html.
M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation, Feb. 1999. http://citeseer.ist.psu.edu/castro01practical.html.
A. Rauber and A. Aschenbrenner. Part of our culture is born digital—On efforts to preserve it for future generations. TRANS. On-line Journal for Cultural Studies (Internet-Zeitschrift f ur Kulturwissenschaften), Jul. 10, 2001. http://www.inst.at/trans/10Nr/inhalt10.htm. http://citeseer.ist.psu.edu/rauber01part.html.
B. Cooper and H. Garcia-Molin. Creating trading networks of digital archives. In E. Fox and C. Borgman, editors, Proceedings of the First ACM/IEEE Joint conference on Digital libraries (JCDL'01), pp. 353-362, Roanoke, VA, Jun. 24-28, 2001. ACM. http://www.acm.org/dl. http://citeseer.ist.psu.edu/cooper01creating.html.
Tonda Benes. The strong eternity service. In Ira S. Moskowitz, editor, Proceedings of Information Hiding Workshop (IH 2001). Springer-Verlag, LNCS 2137, Apr. 2001. http://citeseer.ist.psu.edu/benes01strong.html.
Rothenberg, J., Ensuring the Longevity of Digital Documents, 1995, Scientific American V.272, No. 1/Jan., p. 42, 1995.
D. M. Roger Dingledine, Michael J. Freedman. The Free Haven project: Distributed anonymous storage service. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Jul. 2000. http://citeseer.ist.psu.edu/article/dingledine00free.html.
Back, Adam. “The Eternity Service”, 1997, Phrack Magazine vol. 7., www.cypherspace.org/adam/eternity/phrack.html.
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. 2000. OceanStore: an architecture for global-scale persistent storage. SIGPLAN Not. 35, 11 (Nov. 2000), 190-201. DOI= http://doi.acm.org/10.1145/356989.357007.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Hidden proactive replication of data does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hidden proactive replication of data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hidden proactive replication of data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4068156

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.