.png){kind=icon}
返回
Three-Server Swapping for Access Confidentiality
.png){kind=icon}
OA
AI
DOI：10.1109/TCC.2015.2449993.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an approach to protect confidentiality of data and accesses to them when data are stored and managed by external providers, and hence not under direct control of their owner. Our approach is based on the use of distributed data allocation among three independent servers and on a dynamic re-allocation of data at every access. Dynamic re-allocation is enforced by swapping data involved in an access across the servers in such a way that accessing a given node implies re-allocating it to a different server, then destroying the ability of servers to build knowledge by observing accesses. The use of three servers provides uncertainty, to the eyes of the servers, of the result of the swapping operation, even in presence of collusion among them.
Keyword:
Shuffle index
content confidentiality
access confidentiality
pattern confidentiality
distributed swapping
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.8K
被引数:
4.3K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容