Brief announcement

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

Amitanand S. Aiyer, Lorenzo Alvisi, Rida Bazzi

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

1 Citation (Scopus)
Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Pages310-311
Number of pages2
DOIs
StatePublished - 2007
EventPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, United States
Duration: Aug 12 2007Aug 15 2007

Other

OtherPODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing
CountryUnited States
CityPortland, OR
Period8/12/078/15/07

Fingerprint

Fault tolerance

Keywords

  • Atomic
  • Bounded
  • Byzantine
  • Fault tolerance
  • Information-theoretic
  • Replication
  • Wait-free

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Aiyer, A. S., Alvisi, L., & Bazzi, R. (2007). Brief announcement: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 310-311) https://doi.org/10.1145/1281100.1281147

Brief announcement : Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. / Aiyer, Amitanand S.; Alvisi, Lorenzo; Bazzi, Rida.

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2007. p. 310-311.

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

Aiyer, AS, Alvisi, L & Bazzi, R 2007, Brief announcement: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. pp. 310-311, PODC'07: 26th Annual ACM Symposium on Principles of Distributed Computing, Portland, OR, United States, 8/12/07. https://doi.org/10.1145/1281100.1281147
Aiyer, Amitanand S. ; Alvisi, Lorenzo ; Bazzi, Rida. / Brief announcement : Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. 2007. pp. 310-311
@inproceedings{ad72418c71524fa5ba4ea547882d3a47,
title = "Brief announcement: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions",
keywords = "Atomic, Bounded, Byzantine, Fault tolerance, Information-theoretic, Replication, Wait-free",
author = "Aiyer, {Amitanand S.} and Lorenzo Alvisi and Rida Bazzi",
year = "2007",
doi = "10.1145/1281100.1281147",
language = "English (US)",
isbn = "1595936165",
pages = "310--311",
booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

TY - GEN

T1 - Brief announcement

T2 - Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

AU - Aiyer, Amitanand S.

AU - Alvisi, Lorenzo

AU - Bazzi, Rida

PY - 2007

Y1 - 2007

KW - Atomic

KW - Bounded

KW - Byzantine

KW - Fault tolerance

KW - Information-theoretic

KW - Replication

KW - Wait-free

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

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

U2 - 10.1145/1281100.1281147

DO - 10.1145/1281100.1281147

M3 - Conference contribution

SN - 1595936165

SN - 9781595936165

SP - 310

EP - 311

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

ER -