The following pages link to (Q4409132):
Displaying 8 items.
- On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- McCulloch-Pitts Brains and Pseudorandom Functions (Q5380437) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
