Pages that link to "Item:Q2119090"
From MaRDI portal
The following pages link to On the complexity of arithmetic secret sharing (Q2119090):
Displaying 6 items.
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) (Q2170012) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- A note on ramp secret sharing schemes from error-correcting codes (Q2450506) (← links)
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications (Q2986259) (← links)
- Secure Computation from Random Error Correcting Codes (Q5429397) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
