Secure recovery in a serverless distributed file system

Information security – Access control or authentication – Network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C726S029000, C726S030000, C713S158000, C713S165000

Reexamination Certificate

active

07428751

ABSTRACT:
Systems and methods for secure file writes after a catastrophic event are allowed over an unauthenticated channel in a serverless distributed file system if an authenticator accompanies the secure file writes. The authenticator can be a power-of-attorney certificate with time limitations, a vector of message authenticated code, or a single message authenticator with secured with a secret shared among members of the serverless distributed file system. The serverless distributed file system includes at least 3f+1 participating computer members, with f representing a number of faults tolerable by the system. The group requires at least one authenticator for file creation and file uploads. Any changes to files stored among the members can be made over an unauthenticated channel if the file changes are secured by the authenticator and the group is able to verify the authenticator.

REFERENCES:
patent: 5778395 (1998-07-01), Whiting et al.
patent: 5826021 (1998-10-01), Mastors et al.
patent: 5924094 (1999-07-01), Sutter
patent: 6247026 (2001-06-01), Waldo et al.
patent: 6732124 (2004-05-01), Koseki et al.
patent: 6847984 (2005-01-01), Midgley et al.
patent: 6952737 (2005-10-01), Coates et al.
patent: 7069443 (2006-06-01), Berringer et al.
patent: 7216135 (2007-05-01), Sawdon et al.
patent: 7328341 (2008-02-01), Eun et al.
patent: 2001/0047400 (2001-11-01), Bozeman et al.
patent: 2001/0051955 (2001-12-01), Wong
patent: 2002/0194209 (2002-12-01), Bolosky et al.
patent: 1 246 061 (2002-10-01), None
Mazieres,David and Shasha,Dennis;Building Secure File Systems out of Byzantine Storage;Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002),Jul. 2002,p. 108-117.
Bolosky et al., “Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs”, ACM, 2000, Retrieved from the Internet on Jan. 14, 2008: <URL: http://research.microsoft.com/sn/Farsite/Sigmetrics2000.pdf>.
Farrell et al., “RFC 3281—An Internet Attribute Certificate Profile for Authorization”, Network Working Group, Apr. 2002, pp. 7-24, Retrieved from the Internet on Jan. 14, 2008: <URL: http://citeseer.ist.psu.edu/farrell02internet.html>.
Rowstron et al., “Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility”, ACM, 2001, Retrieved from the Internet on Jan. 14, 2008: <URL: http://pages.cs.wisc.edu/˜remzi/Classes/736/Fall2007/Papers/past.pdf>.
Thompson et al., “Certificate-Based Access Control For Widely Distributed Resources”, USENIX, Aug. 1999, Retrieved from the Internet on Jan. 14, 2008: <URL: http://citeseer.ist.psu.edu/thompson99certificatebased.html>.
Farrell et al., “RFC 3281—An Internet Attibute Certificate Profile for Authorization”, Apr. 2002, pp. 1-6, 10-14, Retrieved from the Internet on Jul. 8, 2008: <URL: http://www.faqs.org/ftp/rfc/pdf/rfc3281.txt.pdf>.
Mazières, David and Shasha, Dennis,Don't Trust Your File Server, 8thHotOS, May 2001, pp. 113-118.
Tompa. Martin and Woll, Heather,How to Share a Secret with Cheaters, Journal of Cryptology, 1, 1988, pp. 261-265.

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

Secure recovery in a serverless distributed file system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Secure recovery in a serverless distributed file system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure recovery in a serverless distributed file system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3991360

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