Secure distributed storage and retrieval

DOI10.1016/S0304-3975(98)00263-1zbMATH Open0944.68055MaRDI QIDQ1575652FDOQ1575652

Authors Juan Garay, Rosario Gennaro, C. S. Jutla, Tal Rabin

Publication date 21 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

information securitydistributed storagethreshold cryptographyinformation dispersal

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
• General information dispersal algorithms
• Publication:4206385
• Scalable secure storage when half the system is faulty

Cites work

• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 176567 (Why is no real title available?)
• scientific article; zbMATH DE number 1256769 (Why is no real title available?)
• scientific article; zbMATH DE number 1302840 (Why is no real title available?)
• scientific article; zbMATH DE number 1024051 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• scientific article; zbMATH DE number 1088252 (Why is no real title available?)
• scientific article; zbMATH DE number 1406798 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Distributed fingerprints and secure information dispersal
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• How to share a function securely
• How to share a secret
• How to withstand mobile virus attacks (extended abstract)
• Probabilistic encryption
• Robust and efficient sharing of RSA functions
• Robust threshold DSS signatures
• Secure distributed storage and retrieval
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

Cited in

(17)

• Building secure file systems out of Byzantine storage
• scientific article; zbMATH DE number 1670854 (Why is no real title available?)
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
• Towards a theory of data entanglement
• Encrypt-to-Self: Securely Outsourcing Storage
• On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications
• An Efficient Dispersal and Encryption Scheme for Secure Distributed Information Storage
• Scalable secure storage when half the system is faulty
• Online data storage using implicit security
• STeP-Archival: Storage Integrity and Tamper Resistance Using Data Entanglement
• A method of protected distribution of data among unreliable and untrusted nodes
• Computational Science - ICCS 2004
• On information-theoretic secure multiparty computation with local repairability
• Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
• Secure distributed storage and retrieval
• Composable and robust outsourced storage

This page was built for publication: Secure distributed storage and retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575652)