Improved polynomial secret-sharing schemes
From MaRDI portal
Publication:6582181
Recommendations
Cites work
- scientific article; zbMATH DE number 1024000 (Why is no real title available?)
- scientific article; zbMATH DE number 1101416 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 7559047 (Why is no real title available?)
- scientific article; zbMATH DE number 7759464 (Why is no real title available?)
- 3-query locally decodable codes of subexponential length
- 3-query locally decodable codes of subexponential length
- A minimal model for secure computation (extended abstract)
- Better secret sharing via robust conditional disclosure of secrets
- Breaking the circuit-size barrier in secret sharing
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- Conditional disclosure of secrets via non-linear reconstruction
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Constructing Finite Sets With Given Intersections
- Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
- General constructions for information-theoretic private information retrieval
- How to share a secret
- Improved polynomial secret-sharing schemes
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- Intersection theorems with geometric consequences
- Lifting Nullstellensatz to monotone span programs over any field
- Linear secret-sharing schemes for forbidden graph access structures
- Matching vector codes
- Multiple assignment scheme for sharing secret
- On the Cryptographic Complexity of the Worst Functions
- On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions
- Optimal linear multiparty conditional disclosure of secrets protocols
- Proofs from THE BOOK
- Protecting data privacy in private information retrieval schemes
- Quadratic secret sharing and conditional disclosure of secrets
- Secret-Sharing Schemes: A Survey
- Secret-sharing schemes for general and uniform access structures
- Superpolynomial lower bounds for monotone span programs
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- The communication complexity of private simultaneous messages, revisited
- The share size of secret-sharing schemes for almost all access structures and graphs
- The size of a share must be large
- Towards breaking the exponential barrier for general secret sharing
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
This page was built for publication: Improved polynomial secret-sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582181)
