The following pages link to How to Garble Arithmetic Circuits (Q5494942):
Displaying 6 items.
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine (Q3297645) (← links)
- (Q4638056) (← links)
- Computing primitive idempotents in finite commutative rings and applications (Q6149152) (← links)
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE (Q6595673) (← links)
