Brief announcement: Coded state machine - Scaling state machine execution under byzantine faults

Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath

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

Abstract

We introduce Coded State Machine (CSM), an information-theoretic framework to securely and efficiently execute multiple state machines on Byzantine nodes. The standard method of solving this problem is using State Machine Replication, which achieves high security at the cost of low efficiency. CSM simultaneously achieves the optimal linear scaling in storage, throughput, and security with increasing network size. The storage is scaled via the design of Lagrange coded states and coded input commands that require the same storage size as their origins. The computational efficiency is scaled using a novel delegation algorithm, called INTERMIX, which is an information-theoretically verifiable matrix-vector multiplication algorithm of independent interest.

Original languageEnglish (US)
Title of host publicationPODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages150-152
Number of pages3
ISBN (Electronic)9781450362177
DOIs
StatePublished - Jul 16 2019
Event38th ACM Symposium on Principles of Distributed Computing, PODC 2019 - Toronto, Canada
Duration: Jul 29 2019Aug 2 2019

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference38th ACM Symposium on Principles of Distributed Computing, PODC 2019
CountryCanada
CityToronto
Period7/29/198/2/19

Keywords

  • Byzantine faults
  • Computational efficiency
  • Information theory
  • Security
  • State machine execution
  • Verifiable computing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Brief announcement: Coded state machine - Scaling state machine execution under byzantine faults'. Together they form a unique fingerprint.

  • Cite this

    Li, S., Sahraei, S., Yu, M., Avestimehr, S., Kannan, S., & Viswanath, P. (2019). Brief announcement: Coded state machine - Scaling state machine execution under byzantine faults. In PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (pp. 150-152). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/3293611.3331573