Pages that link to "Item:Q775980"
From MaRDI portal
The following pages link to Optimizing authenticated garbling for faster secure two-party computation (Q775980):
Displaying 10 items.
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits (Q2912796) (← links)
- The Security and Performance of “GCM” when Short Multiplications Are Used Instead (Q4922047) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Authenticated garbling from simple correlations (Q6111541) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
