.png){kind=icon}
返回
Responsive security for stored data
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2003.1233705.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 trade offs 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 alone.
Keyword:
security
Byzantine fault tolerance
replication
secret sharing
availability
confidentiality
data integrity
distributed storage service
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
THE BRETTANOMYCES. II. TAXONOMIC SIGNIFICANCE OF SLOW FERMENTATIONS AND DESCRIPTION OF A NEW SPECIESOAAI
OAAI分享收藏
查看更多内容