Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
How to share a secret with cheaters
Journal of Cryptology
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
How to Make Replicated Data Secure
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Byzantine Quorum Systems
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Secure and Scalable Replication in Phalanx
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Tolerating Malicious Gossip
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Wait-free regular storage from Byzantine components
Information Processing Letters
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Space efficient secret sharing for implicit data security
Information Sciences: an International Journal
DSO: dependable signing overlay
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
We present the design of a distributed store that offersvarious levels of security guarantees while tolerating a limitednumber of nodes that are compromised by an adversary.The store uses secret sharing schemes to offer securityguarantees namely availability, confidentiality and integrity.However, a pure secret sharing scheme could sufferfrom performance problems and high access costs. Weintegrate secret sharing with replication for better performanceand to keep access costs low. The tradeoffs involvedbetween availability and access cost on one hand and confidentialityand integrity on the other are analyzed. Our systemdiffers from traditional approaches such as state machineor quorum based replication that have been developedto tolerate Byzantine failures. Unlike such systems, weaugment replication with secret sharing and demonstratethat such a hybrid scheme offers additional flexibility that isnot possible with replication alone.