arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1005.0426cs.CRcs.ITmath.IT
收藏

分布式存储系统中基于对数位通信的安全性

Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits

Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho

摘要:

我们调查的问题,维护编码的分布式存储系统时,一些节点包含对抗性错误。使用纠错功能,内置到现有的冗余系统,我们提出了一个简单的线性哈希方案来检测存储节点中的错误。我们的主要结果是,对于存储一个数据对象的总大小$\size$使用的$(n,k)$ MDS代码在有限域$\F_q$,高达$t_1=\lfloor(n-k)/2\rfloor$错误可以被检测到,与故障概率小于$1/ \size$,通过通信只有$O(n(n-k)\log \size)$位到一个可信的验证。我们的结果构造了数据的小投影,以高概率保留错误,并建立在欺骗线性函数的伪随机发生器上。我们的方案所达到的传输速率是渐近等于源和任何接收器之间的最小切割容量。

英文摘要:

We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a simple linear hashing scheme to detect errors in the storage nodes. Our main result is that for storing a data object of total size $\size$ using an $(n,k)$ MDS code over a finite field $\F_q$, up to $t_1=\lfloor(n-k)/2\rfloor$ errors can be detected, with probability of failure smaller than $1/ \size$, by communicating only $O(n(n-k)\log \size)$ bits to a trusted verifier. Our result constructs small projections of the data that preserve the errors with high probability and builds on a pseudorandom generator that fools linear functions. The transmission rate achieved by our scheme is asymptotically equal to the min-cut capacity between the source and any receiver.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑