The following pages link to The Hidden Graph Model (Q2989026):
Displaying 15 items.
- Must the communication graph of MPC protocols be an expander? (Q775967) (← links)
- The more the merrier: reducing the cost of large scale MPC (Q2056763) (← links)
- Is information-theoretic topology-hiding computation possible? (Q2175925) (← links)
- The Heard-Of model: computing in distributed systems with benign faults (Q2377130) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- Topology-Hiding Computation Beyond Logarithmic Diameter (Q5270378) (← links)
- Topology-hiding computation on all graphs (Q5919491) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Formalizing delayed adaptive corruptions and the security of flooding networks (Q6104341) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- Practical provably secure flooding for blockchains (Q6135421) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Asymptotically optimal message dissemination with applications to blockchains (Q6637325) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
