Pages that link to "Item:Q6111541"
From MaRDI portal
The following pages link to Authenticated garbling from simple correlations (Q6111541):
Displaying 7 items.
- Optimizing authenticated garbling for faster secure two-party computation (Q775980) (← links)
- Garbling of signals and outcome equivalence (Q2436305) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Streaming and unbalanced PSI from function secret sharing (Q6134846) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)