7 citations found. Retrieving documents...
Dan Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the 1997.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Robust and Efficient Data Management for a Distributed Hash Table - Cates (2003)   (11 citations)  (Correct)

....tool for file synchronization that exchanges just the delta between two replicas. The use of Merkle hash [29] trees for e#cient synchronization is used by a number of systems. Duchamp uses hierarchical hashes to e#ciently compare two file systems in a toolkit for partially connected operation [17]. BFS uses hierarchical hashes for e#cient state transfers between clients and replicas [9, 10] SFSRO uses Merkle hash trees both for computing digital signatures and synchronizing replicas through incremental updates e#ciently [20] 55 56 Summary 7.1 Conclusions This thesis presented the ....

Duchamp, D. A toolkit approach to partially disconnected operation. In Proc. USENIX 1997.


Building secure file systems out of Byzantine storage - Mazières, Shasha (2002)   (14 citations)  (Correct)

....If data is replicated in SUNDR, only one replica need be honest for the file system to function properly. However, SUNDR and BFS provide different freshness guarantees. SUNDR uses hash trees, introduced in [13] to verify a file block s integrity without touching the entire file system. Duchamp [7], BFS[5] SFSRO [9] and TDB [10] have all made use of hash trees for comparing data or checking the integrity of part of a larger collection of data. 3. ARCHITECTURE SUNDR decomposes the problem of reading proper file data into two parts. First, starting with a bit string known as a user s ....

Dan Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the 1997.


Building secure file systems out of Byzantine storage - Mazières, Shasha   (1 citation)  (Correct)

....If data is replicated in SUNDR, only one replica need be honest for the file system to func2 tion properly. However, SUNDR and BFS provide different freshness guarantees. SUNDR uses hash trees, introduced in [12] to verify a file block s integrity without touching the entire file system. Duchamp [7], BFS[5] SFSRO [9] and TDB [10] have all made use of hash trees for comparing data or checking the integrity of part of a larger collection of data. 3 Architecture SUNDR decomposes the problem of reading proper file data into two parts. First, starting with a bit string known as a user s ....

Dan Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the 1997.


Fast and Secure Distributed Read-Only File System - Fu, Kaashoek, Mazieres (2000)   (52 citations)  (Correct)

....state transfers between clients and replicas [6; 7] The cryptographic storage file system [13] uses cryptographic hashes in a similar fashion to the SFS read only file system. Duchamp uses hierarchical hashes to efficiently compare two file systems in a toolkit for partially connected operation [8]. TDB [17] uses hash trees combined with a small amount of trusted storage to construct a trusted database system on untrusted storage. Finally, a version of a network attached storage device uses an incremental Hash and MAC scheme to reduce the cost of protecting the integrity of read traffic ....

Dan Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the


Don't Trust Your File Server - Mazieres, Shasha (2001)   (22 citations)  (Correct)

....not resigned the file in the past year To address this problem SUNDR signs file systems rather than individual files, and it introduces the notion of relative freshness. SUNDR uses hash trees, introduced in [12] to verify a file block s integrity without touching the entire file system. Duchamp [4], BFS[3] SFSRO [6] and TDB [9] have all made use of hash trees for comparing data or checking the integrity of part of a larger collection of data. The CODA file system [7] saves network bandwidth by operating in a disconnected mode, saving changes locally and later reconciling the changes over ....

D. Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the


Fast and Secure Distributed Read-Only File System - Fu, Kaashoek, Mazieres (2000)   (52 citations)  (Correct)

....state transfers between clients and replicas [5, 6] The cryptographic storage file system [12] uses cryptographic hashes in a similar fashion to the SFS readonly file system. Duchamp uses hierarchical hashes to efficiently compare two file systems in a toolkit for partially connected operation [7]. TDB [16] uses hash trees combined with a small amount of trusted storages to construct a trusted database system on untrusted storage. Finally, a version of a networkattached storage device uses an incremental Hash and MAC scheme to reduce the cost of protecting the integrity of read traffic ....

D. Duchamp. A toolkit approach to partially disconnected operation. In Proc. USENIX 1997 Ann. Technical Conf., pages 305--318. USENIX, January 1997.


Secure Untrusted Data Repository (SUNDR) - Li, Krohn, Mazieres, Shasha   (Correct)

No context found.

Dan Duchamp. A toolkit approach to partially disconnected operation. In Proceedings of the 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC