scientific article; zbMATH DE number 503242
From MaRDI portal
Publication:4279564
Cited in
(14)- Highly resilient correctors for polynomials
- On the power of two-local random reductions
- The power of adaptiveness and additional queries in random-self- reductions
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
- Hardness of learning problems over Burnside groups of exponent 3
- On the communication required for unconditionally secure multiplication
- Sublinear-communication secure multiparty computation does not require FHE
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Sublinear secure computation from new assumptions
- 10-party sublinear secure computation from standard assumptions
- Improved trade-offs between amortization and download bandwidth for linear HSS
- A characterization of optimal-rate linear homomorphic secret sharing schemes, and applications
- A note on low-communication secure multiparty computation via circuit depth-reduction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279564)
