Limitations to computing quadratic functions on Reed-Solomon encoded data
From MaRDI portal
Cites work
- An improvement upon the bounds for the local leakage resilience of Shamir's secret sharing scheme
- Breaking the circuit size barrier for secure computation under DDH
- Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing
- Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
- Communication Efficient Secret Sharing
- Constructing locally leakage-resilient linear secret-sharing schemes
- Explicit low-bandwidth evaluation schemes for weighted sums of Reed-Solomon-coded symbols
- Foundations of homomorphic secret sharing
- How to share a secret
- scientific article; zbMATH DE number 7829303 (Why is no real title available?)
- Network Coding for Distributed Storage Systems
- Nonlinear Repair of Reed-Solomon Codes
- On Secret Reconstruction in Secret Sharing Schemes
- On the local leakage resilience of linear secret sharing schemes
- Optimal repair of Reed-Solomon codes: achieving the cut-set bound
- Polynomial Codes Over Certain Finite Fields
- Primitive elements and polynomials with arbitrary trace
- Repairing Reed-solomon codes
- Repairing Reed-Solomon Codes
- Repairing Reed-Solomon Codes via Subspace Polynomials
- Speeding Up Distributed Machine Learning Using Codes
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
- Threshold changeable secret sharing schemes revisited
- “Short-Dot”: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products
This page was built for publication: Limitations to computing quadratic functions on Reed-Solomon encoded data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445532)