The following pages link to (Q4279564):
Displaying 8 items.
- Highly resilient correctors for polynomials (Q1199875) (← links)
- On the power of two-local random reductions (Q1209364) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
