FnF-BFT: A BFT Protocol with Provable Performance Under Attack-Reference-Cited by-同舟云学术

FnF-BFT: A BFT Protocol with Provable Performance Under Attack

Published:2023 Issue: Volume: Page:165-198
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Avarikioti Zeta,Heimbach Lioba,Schmid Roland,Vanbever Laurent,Wattenhofer Roger,Wintermeyer Patrick

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-32733-9_9

Reference39 articles.

1. The swirdls hashgraph consensus algorithm: fair, fast, byzantine fault tolerance. https://www.swirlds.com/downloads/SWIRLDS-TR-2016-01.pdf. Accessed 30 Jan 2023

2. Abraham, I., Gueta, G., Malkhi, D., Alvisi, L., Kotla, R., Martin, J.P.: Revisiting fast practical byzantine fault tolerance (2017)

3. Amir, Y., Dolev, D., Kramer, S., Malki, D.: Transis: a communication subsystem for high availability. In: 1992 Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing, pp. 76–84 (1992). https://doi.org/10.1109/FTCS.1992.243613

4. Amir, Y., Coan, B., Kirsch, J., Lane, J.: Prime: byzantine replication under attack. IEEE Trans. Dependable Secure Comput. 8(4), 564–577 (2010)

5. Amir, Y., et al.: Steward: scaling byzantine fault-tolerant replication to wide area networks. IEEE Trans. Dependable Secure Comput. 7(1), 80–93 (2008)

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

1. Distributed Transaction Processing in Untrusted Environments;Companion of the 2024 International Conference on Management of Data;2024-06-09