A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123--135, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Verifiable Secret Redistribution for archive systems - Wong, Wang, Wing (2002) (2 citations) (Correct)
....detector to Ensemble [24, 40] Intermemory [10, 22] uses errorcorrecting encoding algorithms to disperse shares of data (also referred to as slices or fragments ) for servers; in order to recover from the loss of shares, the system reconstructs the data and redisperse new shares. e Vault [19, 27] and OceanStore (for its deep archive storage mode) use encoding algorithms similar to those in Intermemory, but rely on having enough servers remain non faulty to allow reconstruction of the original data. Since we assume that the servers are untrusted, we require a decentralized redistribution ....
....must rely on the old shareholders to distribute verification information. In the worse case, restarts are required to eliminate faulty shareholders and complete the protocol. Our research follows other work that employs threshold schemes to build secure, distributed archive systems [27, 30, 41]. In contrast to earlier systems, ours can accommodate dynamic server group membership changes. We have implemented a simple prototype of the protocol itself using the Ensemble group communication toolkit [24] and are currently implementing a prototype archive system that is based upon the PASIS ....
A. Iyengar, R. Cahn, J. A. Gray, and C. Jutla. Design and implementation of a secure distributed data repository. In Proc. of IFIP/SEC 1998.
Mnemosyne: Peer-to-Peer Steganographic Storage - Hand, Roscoe (2002) (21 citations) (Correct)
....3 co located nodes we can copy in files at around 80KB s, and copy them out at 160KB s. We intend to make the code for Mnemosyne available in the near future. 7 Relation to Existing Work Some recent systems have used distribution and self organisation to provide robustness and availability [1, 7, 9, 10, 12]. Other systems use their decentralised nature to provide anonymity of access and prevent censorship [4, 6, 8, 20] Mnemosyne is more aligned with the latter class of system. However it provides in addition plausible deniability for clients, and is more suited to private storage and messaging ....
IYENGAR, A., CAHN, R., GARAY, J. A., AND JUTLA, C. Design and implementation of a secure distributed data repository. In Proc. of the 14th IFIP International Information Security Conference (SEC 98) (1998).
The Proactive Security Toolkit and Applications - Barak, Herzberg, Naor, Shai (1999) (11 citations) (Correct)
....developed at Bell Labs. The W system is a distributed public key management system. It employs threshold techniques which can tolerate a number of server failures (via the implementation of the Rampart toolkit [25] but not recovering (proactive) techniques. The e Vault (electronic Vault) project [18] of IBM is an implementation of a distributed data repository. It employs RSA based shared signatures as the basic cryptographic function. There are a few implementation efforts of proactive algorithms. Specifically, the Network Randomization Protocol (NRP) of [8] which provides a proactive ....
A. Iyengar, R. Cahn, C. Jutla and J.A. Garay, Design and implementation of a secure distributed data repository, in IFIP 1998.
Survivable Storage Systems - Ganger, Khosla, Bakkaloglu, Bigrigg, .. (2001) (2 citations) (Correct)
....and prior efforts employ the PASIS architecture to achieve survivability. For example, the Intermemory Project [12] and the Eternity Service [1] proposal use decentralization and threshold schemes for long term availability and integrity of archived writeonce digital information. The e Vault [14] and Delta 4 [10] projects do the same for online read and write information storage. Delta 4 additionally addresses information confidentiality and other system services, such as authentication. All of these projects have advanced the understanding of these technologies and their roles in ....
A. Iyengar, R. Cahn, J. Garay, and C. Jutla, "Design and Implementation of a Secure Distributed Data Repository," in Proceedings of the 14th IFIP International Information Security Conference (SEC '98), September 1998.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123--135, 1998.
e-SAFE: An Extensible, Secure and Fault Tolerant Storage System - Arnab Paul Sandip (2005) (Correct)
No context found.
A. Iyengar, R. Cahn, J. Garay, and C. Jutla. Design and implementation of a secure distributed data repository. 1998.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123--135, 1998.
Practical Share Renewal for Large Amounts of Data - Arun Subbiah And (2005) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay, "Design and implementation of a secure distributed data repository," in Proceedings of the 14
Design of a Secure and Fault Tolerant Environment for.. - Arnab Paul Sameer (2004) (Correct)
No context found.
A. Iyengar, R. Cahn, J. Garay, and C. Jutla. Design and implementation of a secure distributed data repository. 1998.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123--135, 1998.
Using Byzantine Quorum Systems to Manage Confidential Data - Subbiah, Ahamad, Blough (2004) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay, "Design and implementation of a secure distributed data repository," in Proc. 14th IFIP International Information Security Conference, pp. 123--135, 1998.
Separating Agreement from Execution for - Zantine Fault Tolerant (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123-135, 1998.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
A. Iyengar, R. Cahn, C. Jutla, and J. Garay. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pages 123--135, 1998.
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003) (3 citations) (Correct)
No context found.
A. Iyengar, R. Cahn, et al. Design and Implementation of a Secure Distributed Data Repository. In Proc. of the 14th IFIP Internat. Information Security Conf., pp. 123--135. 1998.
Survivable Information Storage Systems - Wylie, Bigrigg, Strunk, Ganger.. (2000) (27 citations) (Correct)
No context found.
A. Iyengar et al., "Design and Implementation of a Secure Distributed Data Repository," Proc. 14th IFIP Int'l Information Security Conf. (SEC 98), ACM Press, New York, 1998.
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