Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions-Reference-Cited by-同舟云学术

Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions

Published: Issue: Volume: Page:7-19
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Aiyer Amitanand S.,Alvisi Lorenzo,Bazzi Rida A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75142-7_4.pdf

Reference11 articles.

1. Aiyer, A., Alvisi, L., Bazzi, R.A.: Bounded Wait-free Implementation of Optimally Resilient Byzantine Storage without (Unproven) Cryptographic Assumptions. Technical Report TR-07-32, University of Texas at Austin, Department of Computer Sciences (July 2007)

2. Lecture Notes in Computer Science;R.A. Bazzi,2004

3. Lecture Notes in Computer Science;R.A. Bazzi,2006

4. Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN, Washington, DC, USA, pp. 115–124. IEEE Computer Society Press, Los Alamitos (2006)

5. Lecture Notes in Computer Science;R. Fan,2003

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Byzantine Auditable Atomic Register with Optimal Resilience;2022 41st International Symposium on Reliable Distributed Systems (SRDS);2022-09

2. Simulating a Shared Register in an Asynchronous System that Never Stops Changing;Lecture Notes in Computer Science;2015

3. Separating Data and Control: Asynchronous BFT Storage with 2t + 1 Data Replicas;Lecture Notes in Computer Science;2014

4. An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn;Lecture Notes in Computer Science;2011

5. A simple Byzantine-fault-tolerant algorithm for a multi-writer regular register;International Journal of Parallel, Emergent and Distributed Systems;2010-10