paper-conference

Eiffel: Extending Formal Verification of Distributed Algorithms to Utility Analysis
This paper explores the use of TLA+ to verify game theoretic properties like Nash equilibria.
PDF Cite Project DOI
An Extensible Framework for Implementing and Validating Byzantine Fault-Tolerant Protocols
HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. …
PDF Cite Code Project Project DOI
SoK: Scalability Techniques for BFT Consensus.
With the advancement of blockchain systems, many recent research works have proposed distributed ledger technology (DLT) that employs …
PDF Cite Project DOI
SoK: Scalability Techniques for BFT Consensus.
Rebop: Reputation-Based Incentives in Committee-Based Blockchains
Blockchains based on proof-of-work suffer from serious draw- backs, such as high computational overhead, long confirmation time, and …
PDF Cite Project Project DOI
Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks
Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. …
PDF Cite Project Project DOI