Efficient Byzantine Fault-Tolerance
By Giuliana Santos Veronese, Miguel Pupo Correia, Alysson Neves Bessani, Lau Cheuk Lung, Paulo Jorge Esteves Veríssimo. IEEE transactions on computers, 2013
402 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/58de23767f726ee043031dcdb6297de8104cc493
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Guy Golan-Gueta
- João Sousa
- Benny Pinkas
- Alysson Neves Bessani
- Michael K. Reiter
- Dahlia Malkhi
- Ittai Abraham
- Shelly Grossman
In Computer Networks and Communications
- João Sousa
- Guy Golan-Gueta
- Dahlia Malkhi
- Ittai Abraham
- Michael K. Reiter
- Alysson Neves Bessani
- Paulo Jorge Esteves Veríssimo
- Benny Pinkas
Citations in the corpus
- Towards secure and dependable software-defined networks (2013, background): “The literature on Byzantine fault tolerance is broad, ranging from large-scale systems [19, 20] to resource-efficient solutions [19, 21, 22].”
- State Machine Replication for the Masses with BFT-SMART (2014, methodology): “, using trusted components [7] or IP multicast [2], [6]), would make our”
- SBFT: A Scalable and Decentralized Trust Infrastructure (2018, background): “Our protocol provides the same type of weak fairness guarantees as in PBFT; we leave for further work the question of adding stronger fairness properties to SBFT. A2M [29], TrInc [49] and Veronese et al. [73] use secure hardware to obtain non-equivocation.”