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

Oliver Kosut

doi:10.1109/ISIT.2013.6620356

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

Oliver Kosut

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

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 language	English (US)
Title of host publication	2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages	897-901
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620356
State	Published - Dec 19 2013
Event	2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Other

Other	2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/Territory	Turkey
City	Istanbul
Period	7/7/13 → 7/12/13

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2013.6620356

Cite this

Kosut, O 2013, Polytope codes for distributed storage in the presence of an active omniscient adversary. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620356, IEEE International Symposium on Information Theory - Proceedings, 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

@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",

month = dec,

day = "19",

doi = "10.1109/ISIT.2013.6620356",

language = "English (US)",

isbn = "9781479904464",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "897--901",

booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",

}

TY - GEN

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

AU - Kosut, Oliver

PY - 2013/12/19

Y1 - 2013/12/19

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

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 897

EP - 901

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this