Pages that link to "Item:Q5177277"
From MaRDI portal
The following pages link to Optimally efficient multi-valued byzantine agreement (Q5177277):
Displaying 11 items.
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Performance study of Byzantine agreement protocol with artificial neural network (Q2384832) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- On Optimal Probabilistic Asynchronous Byzantine Agreement (Q5445740) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- Efficient adaptively-secure Byzantine agreement for long messages (Q6135408) (← links)
