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

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

6 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 languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages897-901
Number of pages5
DOIs
StatePublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

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

Other

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

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Polytope codes for distributed storage in the presence of an active omniscient adversary'. Together they form a unique fingerprint.

  • 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 (pp. 897-901). [6620356] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620356