|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits | | Theodoros K. Dikaliotis
; Alexandros G. Dimakis
; Tracey Ho
; | | Date: |
4 May 2010 | | Abstract: | 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
floor$ 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. | | Source: | arXiv, 1005.0426 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER