Pages that link to "Item:Q3623039"
From MaRDI portal
The following pages link to Adaptively Secure Two-Party Computation with Erasures (Q3623039):
Displaying 11 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- (Q3374910) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- One-Sided Adaptively Secure Two-Party Computation (Q5746345) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)