Pages that link to "Item:Q1629408"
From MaRDI portal
The following pages link to Two-round adaptively secure multiparty computation from standard assumptions (Q1629408):
Displaying 16 items.
- Two-round multiparty secure computation from minimal assumptions (Q1648848) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- (Q4228521) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation (Q5261693) (← links)
- One-Sided Adaptively Secure Two-Party Computation (Q5746345) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Reverse firewalls for adaptively secure MPC without setup (Q6157521) (← links)
