Fast and secure distributed read-only file system

By Kevin Fu, M. Frans Kaashoek, David Mazières. 2000

294 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Information Systems

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, methodology): “Prior work suggested achieving similar properties via Merkle hash trees [8, 12, 27, 29, 43], but implementations show that this approach increases the degree of the QAP by tens or hundreds per state element [9, 16, 54], whereas with MultiQAPs, the degree increases only by 1.”
Verifying computations with state (2013, methodology): “We now describe this approach.”
Efficient RAM and control flow in verifiable outsourced computation (2015, background): “The principal costs are the setup work and the prover’s work to generate the certificate.”
Dissent in Numbers: Making Strong Anonymity Scale (2012, unknown): “A cryptographic hash of this group definition file thereafter serves as a self-certifying identifier for the group [31], avoiding membership consensus and PKI issues at the cost of making the group’s composition static.”
Shielding Applications from an Untrusted Cloud with Haven (2014, background): “Like other systems [16, 17, 26, 36, 62], a Merkle tree [42] protects the integrity of the overall disk.”
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility (2001, background): “There are currently many projects aimed at constructing peer-to-peer applications and understanding more of the issues and requirements of such applications and systems [4, 2, 5, 6 , 7, 8]. We are developing PAST, an Internet based, peer-to-peer global storage utility, which aims to provide strong ”
Wide-area cooperative storage with CFS (2001, methodology): “SFSRO defines protocols and authentication mechanisms which a client can use to retrieve data from a given server.”
Networking named content (2009, background): “2 notes, the full name of a ContentObject contains a cryptographic digest of its contents (a self-certifying name [14, 15, 6, 4]) and the identity (key) of its publisher.”
Security Considerations for Peer-to-Peer Distributed Hash Tables (2002, unknown): “techniques, such as self-certifying path names [3].”
Depot: Cloud Storage with Minimal Trust (2010, background): “(A node fetches the actual values on demand, which it can do by using the hash as an index [Fu et al. 2002]; this happens in modules layered over the core replication protocol.”