Polytope codes for distributed storage in the presence of an active omniscient adversary

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Distributed storage systems are studied in the presence of an active omniscient adversary. The adversary is able to control several storage nodes in the system and alter their behavior. A Polytope code is proposed to handle such an adversary, and it is used to prove a lower bound on the overall storage capacity. Polytope codes have been shown to outperform linear codes over a finite field in defeating active adversaries. In a Polytope code, linear operations are performed over the integers rather than a finite field. This allows examinations of cross-covariances as a sort of parity check, which can improve error detection and correction without sacrificing asymptotic rate.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages897-901
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Error detection
Error correction
Polytope
Linear Codes
Galois field
Error Detection
Storage Capacity
Storage System
Error Correction
Sort
Parity
Distributed Systems
Lower bound
Integer
Vertex of a graph

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Kosut, O. (2013). Polytope codes for distributed storage in the presence of an active omniscient adversary. In IEEE International Symposium on Information Theory - Proceedings (pp. 897-901). [6620356] https://doi.org/10.1109/ISIT.2013.6620356

Polytope codes for distributed storage in the presence of an active omniscient adversary. / Kosut, Oliver.

IEEE International Symposium on Information Theory - Proceedings. 2013. p. 897-901 6620356.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kosut, O 2013, Polytope codes for distributed storage in the presence of an active omniscient adversary. in IEEE International Symposium on Information Theory - Proceedings., 6620356, pp. 897-901, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620356
Kosut O. Polytope codes for distributed storage in the presence of an active omniscient adversary. In IEEE International Symposium on Information Theory - Proceedings. 2013. p. 897-901. 6620356 https://doi.org/10.1109/ISIT.2013.6620356
Kosut, Oliver. / Polytope codes for distributed storage in the presence of an active omniscient adversary. IEEE International Symposium on Information Theory - Proceedings. 2013. pp. 897-901
@inproceedings{d50a03d650414bd6b045049e0b9010e4,
title = "Polytope codes for distributed storage in the presence of an active omniscient adversary",
abstract = "Distributed storage systems are studied in the presence of an active omniscient adversary. The adversary is able to control several storage nodes in the system and alter their behavior. A Polytope code is proposed to handle such an adversary, and it is used to prove a lower bound on the overall storage capacity. Polytope codes have been shown to outperform linear codes over a finite field in defeating active adversaries. In a Polytope code, linear operations are performed over the integers rather than a finite field. This allows examinations of cross-covariances as a sort of parity check, which can improve error detection and correction without sacrificing asymptotic rate.",
author = "Oliver Kosut",
year = "2013",
doi = "10.1109/ISIT.2013.6620356",
language = "English (US)",
isbn = "9781479904464",
pages = "897--901",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Polytope codes for distributed storage in the presence of an active omniscient adversary

AU - Kosut, Oliver

PY - 2013

Y1 - 2013

N2 - Distributed storage systems are studied in the presence of an active omniscient adversary. The adversary is able to control several storage nodes in the system and alter their behavior. A Polytope code is proposed to handle such an adversary, and it is used to prove a lower bound on the overall storage capacity. Polytope codes have been shown to outperform linear codes over a finite field in defeating active adversaries. In a Polytope code, linear operations are performed over the integers rather than a finite field. This allows examinations of cross-covariances as a sort of parity check, which can improve error detection and correction without sacrificing asymptotic rate.

AB - Distributed storage systems are studied in the presence of an active omniscient adversary. The adversary is able to control several storage nodes in the system and alter their behavior. A Polytope code is proposed to handle such an adversary, and it is used to prove a lower bound on the overall storage capacity. Polytope codes have been shown to outperform linear codes over a finite field in defeating active adversaries. In a Polytope code, linear operations are performed over the integers rather than a finite field. This allows examinations of cross-covariances as a sort of parity check, which can improve error detection and correction without sacrificing asymptotic rate.

UR - http://www.scopus.com/inward/record.url?scp=84890394028&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890394028&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620356

DO - 10.1109/ISIT.2013.6620356

M3 - Conference contribution

AN - SCOPUS:84890394028

SN - 9781479904464

SP - 897

EP - 901

BT - IEEE International Symposium on Information Theory - Proceedings

ER -