Improved polynomial secret-sharing schemes
From MaRDI portal
Publication:6582181
DOI10.1007/978-3-031-48618-0_13zbMath1544.94278MaRDI QIDQ6582181
Or Lasri, Amos Beimel, Oriol Farràs
Publication date: 2 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intersection theorems with geometric consequences
- Multiple assignment scheme for sharing secret
- The size of a share must be large
- Protecting data privacy in private information retrieval schemes
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Towards breaking the exponential barrier for general secret sharing
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Linear secret-sharing schemes for forbidden graph access structures
- Optimal linear multiparty conditional disclosure of secrets protocols
- Superpolynomial lower bounds for monotone span programs
- The share size of secret-sharing schemes for almost all access structures and graphs
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
- Quadratic secret sharing and conditional disclosure of secrets
- Secret-sharing schemes for general and uniform access structures
- General constructions for information-theoretic private information retrieval
- A minimal model for secure computation (extended abstract)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract)
- 2-Server PIR with Sub-Polynomial Communication
- Secret-Sharing Schemes: A Survey
- How to share a secret
- On the least prime in an arithmetic progression and estimates for the zeros of Dirichlet L-functions
- Matching Vector Codes
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Constructing Finite Sets With Given Intersections
- Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
- 3-Query Locally Decodable Codes of Subexponential Length
- Better secret sharing via robust conditional disclosure of secrets
- 3-query locally decodable codes of subexponential length
- Breaking the circuit-size barrier in secret sharing
- Lifting Nullstellensatz to monotone span programs over any field
- On the Cryptographic Complexity of the Worst Functions
- Proofs from THE BOOK
- The communication complexity of private simultaneous messages, revisited
- Improved polynomial secret-sharing schemes
Related Items (1)
This page was built for publication: Improved polynomial secret-sharing schemes
