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 5 items.
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Sublinear-communication secure multiparty computation does not require FHE (Q6061356) (← links)
- On homomorphic secret sharing from polynomial-modulus LWE (Q6067348) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN (Q6186715) (← links)