Pages that link to "Item:Q5738974"
From MaRDI portal
The following pages link to On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974):
Displayed 4 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)