Pages that link to "Item:Q2056771"
From MaRDI portal
The following pages link to Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771):
Displaying 4 items.
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)