The following pages link to Secure Protocol Transformations (Q2829224):
Displayed 12 items.
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)