Data repository and method for promoting network storage of...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000, C709S203000, C709S225000, C713S176000, C370S230000

Reexamination Certificate

active

10752769

ABSTRACT:
In general, the invention features methods by which more than one client program connected to a network stores the same data item on a storage device of a data repository connected to the network. In one aspect, the method comprises encrypting the data item using a key derived from the content of the data item, determining a digital fingerprint of the data item, and storing the data item on the storage device at a location or locations associated with the digital fingerprint. In a second aspect, the method comprises determining a digital fingerprint of the data item, testing for whether the data item is already stored in the repository by comparing the digital fingerprint of the data item to the digital fingerprints of data items already in storage in the repository, and challenging a client that is attempting to deposit a data item already stored in the repository, to ascertain that the client has the full data item.

REFERENCES:
patent: 4641274 (1987-02-01), Swank
patent: 4864616 (1989-09-01), Pond et al.
patent: RE34954 (1995-05-01), Haber et al.
patent: 5490258 (1996-02-01), Fenner
patent: 5532920 (1996-07-01), Hartrick et al.
patent: 5579501 (1996-11-01), Lipton et al.
patent: 5594227 (1997-01-01), Deo
patent: 5765152 (1998-06-01), Erickson
patent: 5778395 (1998-07-01), Whiting et al.
patent: 5781901 (1998-07-01), Kuzma
patent: 5860136 (1999-01-01), Fenner
patent: 5872784 (1999-02-01), Rostoker et al.
patent: 5884297 (1999-03-01), Noven
patent: 5914938 (1999-06-01), Brady et al.
patent: 5915025 (1999-06-01), Taguchi et al.
patent: 5931947 (1999-08-01), Burns et al.
patent: 5940507 (1999-08-01), Cane et al.
patent: 5978791 (1999-11-01), Farber et al.
patent: 5990810 (1999-11-01), Williams
patent: 6016404 (2000-01-01), DiRisio
patent: 6052688 (2000-04-01), Thorsen
patent: 6148342 (2000-11-01), Ho
patent: 6205533 (2001-03-01), Margolus
patent: 6272492 (2001-08-01), Kay
patent: 6308325 (2001-10-01), Dobbek
patent: 6374266 (2002-04-01), Shnelyar
patent: 6374269 (2002-04-01), Ishikawa et al.
patent: 6415280 (2002-07-01), Farber et al.
patent: 6415302 (2002-07-01), Garthwaite et al.
patent: 6430618 (2002-08-01), Karger et al.
patent: 6438631 (2002-08-01), Kawase
patent: 6493804 (2002-12-01), Soltis et al.
patent: 6526418 (2003-02-01), Midgley et al.
patent: 6532542 (2003-03-01), Thomlinson et al.
patent: 6535867 (2003-03-01), Waters
patent: 6549992 (2003-04-01), Armangau et al.
patent: 6557102 (2003-04-01), Wong et al.
patent: 6600737 (2003-07-01), Lai et al.
patent: 6601172 (2003-07-01), Epstein
patent: 6714952 (2004-03-01), Dunham et al.
patent: 6760756 (2004-07-01), Davis et al.
patent: 7058692 (2006-06-01), Yamamoto et al.
patent: 7095715 (2006-08-01), Buckman et al.
patent: 7124305 (2006-10-01), Margolus et al.
patent: 2003/0012147 (2003-01-01), Buckman et al.
patent: 2003/0140051 (2003-07-01), Fujiwara et al.
patent: 0774715 (1997-05-01), None
patent: 1 049 988 (2002-09-01), None
patent: 1 049 989 (2003-05-01), None
patent: 99/09480 (1999-02-01), None
patent: 01/18633 (2001-03-01), None
patent: 01/61563 (2001-08-01), None
Kaliski, “PKCS #1: RSA Encryption,” Mar. 1998, The Internet Society, Request for Comments 2313, pp. 1-19, http://www.ietf.org/rfc/rfc2313.txt.
Berners-Lee et al., “Universal Document Identifiers,” available at http://www.webhistory.org/www-talk.1992/0032.html (Mar. 11, 1992).
Bowman et al., “Harvest: A Scalable, Customizable Discovery and Access System,” Technical Report CU-CS-732-94, Dept. of Comp. Science, Univ. of Colorado (Aug. 1994).
Browne et al., “Location-Independent Naming for Virtual Distributed Software Repositories,” available at www.netlib.org/utk/papers/lefn/main.html (Nov. 11, 1994).
Crespo et al., “Archival Storage for Digital Libraries,” Procs. of the Third ACM Conf. on Digital Libraries, pp. 69-78 (ISBN: 0-89791-965-3) (1998).
Heckel, “A Technique for Isolating Differences Between Files,” Communications of the ACM, vol. 21, No. 4 (Apr. 1978).
Kantor, FWKCS™ Contents—Signature Systems, Version 1.18 (Sep. 11, 1992).
Rabin, “Fingerprinting by Random Polynomials,” Center for Research in Computing Technology, Harvard University, Technical Report TR-15-81 (1981).
Rivest, “The MD5 Message-Digest Algorithm,” Network Working Group, Request for Comments: 1321, MIT Lab. for Comp. Science and RSA Data Security , Inc. (Apr. 1992).
Sollins, “Functional Requirements for Uniform Resource Names,” Network Working Group, Request for Comments: 1737, MIT Lab. For Comp. Science (Dec. 1994).
Tridgell et al., The Rsync Algorithm, Jun. 18, 1996, Department of Computer Science Australian National University Canberra, pp. 1-6.
Williams, “An Introduction to Digest Algorithms,” available at ftp.rocksoft.com:/pub/rocksoft/., (Sep. 1994).
Chaum et al., “Utraceable Electronic Cash”, Advances in Cryptology CRYPTO '88, Springer-Verlag, pp. 319-327 (1998).
Feige et al., “Zero-Knowledge Proofs of Identity,” Journal of Cryptology 1:77-94 (1988).
Margolus, Crystalline Computation, Chapter 18 of Feynman and Computation (A. Hey, ed.), Perseus Books, pp. 267-305 (1999).
National Institute of Standards and Technology, NIST FIPS PUB 180-1, “Secure Hash Standard”, U.S. Department of Commerce (Apr. 1995).
Nowicki, “NFS: Network File System Protocol Specification” Network Working Group RFC1094, Sun Microsystems, Inc. (Mar. 1989).
Preface from FWKCS(TM) Contents—Signature System, Version 2.05, Copypright Frederick W. Kantor (Apr. 26, 1996).
Rabin, “Efficient Dispersal of Information for Security,” Load Balancing, and Fault Tolerance, Journal of the ACM, vol. 36, No. 2, pp. 335-348 (Apr. 1989).
Rivest, “The MD4 Message Digest Algorithm,” Network Working Group RFC1186, MIT Laboratory for Computer Science (Oct. 1990).
Karger et al., “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” Laboratory for Computer Science and Department of Mathematics, MIT, Cambridge, MA.

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

Data repository and method for promoting network storage of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data repository and method for promoting network storage of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data repository and method for promoting network storage of... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3888116

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