Pages that link to "Item:Q1882568"
From MaRDI portal
The following pages link to Adaptive versus non-adaptive security of multi-party protocols (Q1882568):
Displayed 13 items.
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5918515) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time (Q6061361) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Completeness theorems for adaptively secure broadcast (Q6186585) (← links)
- Perfect MPC over layered graphs (Q6186597) (← links)