Pages that link to "Item:Q1675726"
From MaRDI portal
The following pages link to Secure arithmetic computation with constant computational overhead (Q1675726):
Displaying 13 items.
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE (Q2056777) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- The price of active security in cryptographic protocols (Q6595846) (← links)
- Lossy cryptography from code-based assumptions (Q6652889) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
