The following pages link to (Q2707411):
Displaying 21 items.
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience (Q4931669) (← links)
- Bit-Slice Auction Circuit (Q5030176) (← links)
- Counting Method for Multi-party Computation over Non-abelian Groups (Q5502759) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- On fully-secure honest majority MPC without \(n^2\) round overhead (Q6619922) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
