Bounds on the Threshold Gap in Secret Sharing and its Applications
From MaRDI portal
Publication:5346377
DOI10.1109/TIT.2013.2264504zbMATH Open1364.94575OpenAlexW1968182724MaRDI QIDQ5346377FDOQ5346377
Authors: Ignacio Cascudo, Ronald Cramer, Chaoping Xing 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2013.2264504
Cited In (18)
- Probabilistic secret sharing
- Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
- Title not available (Why is that?)
- Threshold Secret Sharing Requires a Linear Size Alphabet
- On the information ratio of non-perfect secret sharing schemes
- Cryptography from planted graphs: security with logarithmic-size messages
- Recent advances in non-perfect secret sharing schemes
- Title not available (Why is that?)
- Construction of arithmetic secret sharing schemes by using torsion limits
- Threshold secret sharing requires a linear-size alphabet
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
- Evolving ramp secret sharing with a small gap
- Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
- How to Share a Secret, Infinitely
- Natural Generalizations of Threshold Secret Sharing
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- Approximate Degree, Secret Sharing, and Concentration Phenomena
- Secret Sharing Schemes with Algebraic Properties and Applications
This page was built for publication: Bounds on the Threshold Gap in Secret Sharing and its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346377)
