Responsive Security for Stored Data

We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The store uses secret sharing schemes to offer security guarantees namely availability, confidentiality and integrity. However, a pure secret sharing scheme could suffer from performance problems and high access costs. We integrate secret sharing with replication for better performance and to keep access costs low. The tradeoffs involved between availability and access cost on one hand and confidentiality and integrity on the other are analyzed. Our system differs from traditional approaches such as state machine or quorum based replication that have been developed to tolerate Byzantine failures. Unlike such systems, we augment replication with secret sharing and offer weaker consistency guarantees. We demonstrate that such a hybrid scheme offers additional flexibility that is not possible with replication al...

• Type: Conference
• Year: 2003
• Where: ICDCS
• Authors: Subramanian Lakshmanan, Mustaque Ahamad, H. Venkateswaran
• Keywords: Access Cost, Distributed And Parallel Computing, ICDCS 2003, Secret Sharing, Secret Sharing Scheme