Pages that link to "Item:Q2119013"
From MaRDI portal
The following pages link to Succinct non-interactive secure computation (Q2119013):
Displaying 7 items.
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Reusable non-interactive secure computation (Q2304929) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)