Threshold Secret Sharing Requires a Linear Size Alphabet
From MaRDI portal
Recommendations
- Threshold secret sharing requires a linear-size alphabet
- Linear threshold multisecret sharing schemes
- Linear threshold multisecret sharing schemes
- scientific article; zbMATH DE number 1950334
- Linear Threshold Secret-Sharing with Binary Reconstruction
- A new threshold secret sharing scheme
- Practical Threshold Signatures with Linear Secret Sharing Schemes
- A scheme for threshold multi-secret sharing
- Threshold cryptography based on Asmuth-Bloom secret sharing
- A linear construction of secret sharing schemes
Cites work
- A characterization of span program size and improved lower bounds for monotone span programs
- A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- An application of ramp schemes to broadcast encryption
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
- Bounded indistinguishability and the complexity of recovering secrets
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- How to share a secret
- How to Share a Secret, Infinitely
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- Lower bounds for monotone span programs
- Multiple assignment scheme for sharing secret
- On the size of shares for secret sharing schemes
- Optimal non-perfect uniform secret sharing schemes
- Secret Sharing and Non-Shannon Information Inequalities
- Secret Sharing, Rank Inequalities, and Information Inequalities
- Secret-Sharing Schemes: A Survey
- Secure multiparty computation and secret sharing
- Security of Ramp Schemes
- Superpolynomial lower bounds for monotone span programs
- The size of a share must be large
- Universally ideal secret-sharing schemes
- Weakly-Private Secret Sharing Schemes
Cited in
(19)- On the information ratio of non-perfect secret sharing schemes
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Evolving ramp secret sharing with a small gap
- Lower bounds for leakage-resilient secret sharing
- Set theoretical secret sharing scheme in relocation cipher
- How to Share a Secret, Infinitely
- Weakly-Private Secret Sharing Schemes
- Probabilistic secret sharing
- Secret sharing with binary shares
- Threshold secret sharing requires a linear-size alphabet
- Optimum general threshold secret sharing
- Revisiting the Karnin, Greene and Hellman Bounds
- Full threshold change range of threshold changeable secret sharing
- scientific article; zbMATH DE number 7706042 (Why is no real title available?)
- Linear Threshold Secret-Sharing with Binary Reconstruction
- Csirmaz's duality conjecture and threshold secret sharing
- Secret-sharing schemes for high slices
- A construction of evolving k-threshold secret sharing scheme over a polynomial ring
This page was built for publication: Threshold Secret Sharing Requires a Linear Size Alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181037)
