Author:
Correia Miguel,Neves Nuno Ferreira,Veríssimo Paulo
Publisher
Oxford University Press (OUP)
Reference44 articles.
1. Pease, M., Shostak, R. and Lamport, L. (1980) Reaching agreement in the presence of faults. J. ACM, 27, 228–234.
2. Lamport, L., Shostak, R. and Pease, M. (1982) The Byzantine generals problem. ACM Trans. Progr. Lang. Syst., 4, 382–401.
3. Rabin, M. O. (1983) Randomized Byzantine generals. In Proc. 24th Annual IEEE Symp. Foundations of Computer Science, Tucson, AZ, November 7–9, pp. 403–409. IEEE Computer Society Press, Los Alamitos, USA.
4. Ben-Or, M. (1983) Another advantage of free choice: completely asynchronous agreement protocols. In Proc. 2nd ACM Symp. Principles of Distributed Computing, Montreal, Canada, August 17–19, pp. 27–30. ACM Press, New York, USA.
5. Veríssimo, P., Neves, N. F. and Correia, M. (2003) Intrusion-tolerant architectures: concepts and design. In Lemos, R., Gacek, C. and Romanovsky, A. (eds), Architecting Dependable Systems, LNCS, 2677, pp. 3–36. Springer-Verlag, London, UK.
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributed Transaction Processing in Untrusted Environments;Companion of the 2024 International Conference on Management of Data;2024-06-09
2. Rashnu: Data-Dependent Order-Fairness;Proceedings of the VLDB Endowment;2024-05
3. Self-stabilizing Byzantine Multivalued Consensus: (extended abstract);Proceedings of the 25th International Conference on Distributed Computing and Networking;2024-01-04
4. FIN: Practical Signature-Free Asynchronous Common Subset in Constant Time;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
5. ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15