Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI 1999, pp. 173–186. USENIX Association, Berkeley (1999)
2. Chun, B.-G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: Making adversaries stick to their word. In: Proceedings of the 21st Symposium on Operating Systems Principles (2007)
3. Correia, M., Neves, N.F., Veríssimo, P.: How to tolerate half less one Byzantine nodes in practical distributed systems. In: Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems, pp. 174–183 (October 2004)
4. Cristian, F., Fetzer, C.: The timed asynchronous distributed system model. IEEE Transactions on Parallel and Distributed Systems 10, 642–657 (1999)
5. Distler, T., Kapitza, R.: Increasing performance in Byzantine fault-tolerant systems with on-demand replica consistency. In: Proceedings of the EuroSys 2011 Conference (EuroSys 2011), pp. 91–105 (2011)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Practical Byzantine Fault Tolerance Algorithms Based on Randomized Mean Clustering, Trust and Credibility;Communications in Computer and Information Science;2024
2. Reducing the agreement cost of BFT replication;Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015;2015-09-11
3. Parallel Byzantine Fault Tolerance;Advances in Intelligent Systems and Computing;2015
4. Cost-Aware Request Batching for Byzantine Fault-Tolerant Replication;Advances in Intelligent Systems and Computing;2015