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 Scopus citations
Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Pages310-311
Number of pages2
DOIs
Publication statusPublished - 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

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