Fides proposes a TEE-assisted asynchronous DAG BFT consensus with n=2f+1 and low commit latency, but its liveness proof relies on an unsupported set-intersection claim.
Practical Byzantine Fault Tolerance
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted Components
Fides proposes a TEE-assisted asynchronous DAG BFT consensus with n=2f+1 and low commit latency, but its liveness proof relies on an unsupported set-intersection claim.