Lower bounds on FSS from dynamic data structures
From MaRDI portal
Cites work
- Breaking the circuit size barrier for secure computation under DDH
- Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Function secret sharing
- Function secret sharing for mixed-mode and fixed-point secure computation
- Homomorphic secret sharing from lattices without FHE
- How to share a secret
- scientific article; zbMATH DE number 5485435 (Why is no real title available?)
- Logarithmic Lower Bounds in the Cell-Probe Model
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- Notions of black-box reductions, revisited
- On range searching in the group model and combinatorial discrepancy
- Private information retrieval
- Secret-Sharing Schemes: A Survey
- Secure computation with preprocessing via function secret sharing
- Should Tables Be Sorted?
- Spooky Encryption and Its Applications
- The cell probe complexity of dynamic range counting
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Theory of Cryptography
This page was built for publication: Lower bounds on FSS from dynamic data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445597)