Article

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

Authors:

Amitanand Aiyer,

Lorenzo Alvisi,

Rida A. BazziAuthors Info & Claims

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Pages 310 - 311

https://doi.org/10.1145/1281100.1281147

Published: 12 August 2007 Publication History

Get Access

Abstract

No abstract available.

References

[1]

Amitan and S. Aiyer, Lorenzo Alvisi, and Rida A. Bazzi. Lightweight writeback for byzantine storage systems. Technical Report TR-07-13, University of Texas at Austin, Department of Computer Sciences, March 2007.

Google Scholar

[2]

Rida A. Bazzi and Yin Ding. Non-skipping time stamps for byzantine data storage systems. In DISC'04, pages 405--419. Springer-Verlag, 2004.

Google Scholar

[3]

Rida A. Bazzi and Yin Ding. Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients. In DISC'06, pages 299--313. Springer-Verlag, 2006.

Digital Library

Google Scholar

[4]

Christian Cachin and Stefano Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. In DSN, pages 115--124, Washington, DC, USA, 2006. IEEE Computer Society.

Digital Library

Google Scholar

[5]

R. Fan and N. Lynch. Efficient replication of large data objects. In DISC'03, volume 2848 of LNCS, pages 75--91, October 2003.

Google Scholar

[6]

Rachid Guerraoui and Marko Vukolic. Re?ned Quorum Systems. Technical Report LPD-REPORT-2007-001, EPFL, 2007.

Google Scholar

[7]

Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124--149, January 1991.

Digital Library

Google Scholar

[8]

Leslie Lamport. On interprocess communication. parti: Basic formalism. Distributed Computing, 1(2):77--101, 1986.

Crossref

Google Scholar

[9]

Barbara Liskov and Rodrigo Rodrigues. Byzantine clients rendered harmless. In DISC2005, pages 311--325. Springer-Verlag, 2005.

Digital Library

Google Scholar

[10]

Jean-Philippe Martin, Lorenzo Alvisi, and Michael Dahlin. Minimal byzantine storage. In DISC'02, pages 311--325. Springer-Verlag, 2002.

Digital Library

Google Scholar

Cited By

View all

Attiya HChung HEllen FKumar SWelch J(2019)Emulating a Shared Register in a System That Never Stops ChangingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286747930:3(544-559)Online publication date: 1-Mar-2019
https://doi.org/10.1109/TPDS.2018.2867479
Mostéfaoui APetrolia MRaynal MJard C(2017)Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing SystemsTheory of Computing Systems10.1007/s00224-016-9699-860:4(677-694)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00224-016-9699-8
Bonomi SPotop-Butucaru MTixeuil S(2015)Stabilizing Byzantine-Fault Tolerant StorageProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.89(894-903)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.89
Show More Cited By

Index Terms

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
1. Software and its engineering
  1. Software organization and properties
    1. Extra-functional properties
      1. Software fault tolerance
    2. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
DISC'07: Proceedings of the 21st international conference on Distributed Computing

We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine servers, without the use of unproven cryptographic primitives or requiring ...
Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients
DISC'06: Proceedings of the 20th international conference on Distributed Computing

We present the first direct bounded wait-free implementation of a replicated register with atomic semantics in a system with an unbounded number of clients and in which up to f servers are subject to Byzantine failures. In a system with n ≥4f+i+1 ...
Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems
PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Comments

Information & Contributors

Information

Published In

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

August 2007

424 pages

ISBN:9781595936165

DOI:10.1145/1281100

General Chair:
Indranil Gupta
UIUC, USA
,
Program Chair:
Rogert Wattenhofer
ETH Zurich, Switzerland

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC07

Sponsor:

PODC07: ACM Symposium on Principles of Distributed Computing 2007

August 12 - 15, 2007

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
169
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Attiya HChung HEllen FKumar SWelch J(2019)Emulating a Shared Register in a System That Never Stops ChangingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.286747930:3(544-559)Online publication date: 1-Mar-2019
https://doi.org/10.1109/TPDS.2018.2867479
Mostéfaoui APetrolia MRaynal MJard C(2017)Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing SystemsTheory of Computing Systems10.1007/s00224-016-9699-860:4(677-694)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00224-016-9699-8
Bonomi SPotop-Butucaru MTixeuil S(2015)Stabilizing Byzantine-Fault Tolerant StorageProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.89(894-903)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.89
Attiya HChung HEllen FKumar SWelch J(2015)Simulating a Shared Register in an Asynchronous System that Never Stops ChangingProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_6(75-91)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_6
Baldoni RBonomi SNezhad A(2013)A protocol for implementing byzantine storage in churn-prone distributed systemsTheoretical Computer Science10.1016/j.tcs.2013.04.005512(28-40)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.04.005
Vukolić M(2012)Quorum Systems: With Applications to Storage and ConsensusSynthesis Lectures on Distributed Computing Theory10.2200/S00402ED1V01Y201202DCT0093:1(1-146)Online publication date: 15-Feb-2012
https://doi.org/10.2200/S00402ED1V01Y201202DCT009
Guerraoui RVukolić M(2010)Refined quorum systemsDistributed Computing10.1007/s00446-010-0103-723:1(1-42)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1007/s00446-010-0103-7
Aiyer AAlvisi LBazzi R(2007)Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic AssumptionsDistributed Computing10.1007/978-3-540-75142-7_4(7-19)Online publication date: 2007
https://doi.org/10.1007/978-3-540-75142-7_4

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations