Bounds on the Threshold Gap in Secret Sharing and its Applications

DOI10.1109/TIT.2013.2264504MaRDI QIDQ5346377zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cited in

(18)

• A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
• Recent advances in non-perfect secret sharing schemes
• Construction of arithmetic secret sharing schemes by using torsion limits
• Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes
• Evolving ramp secret sharing with a small gap
• Cryptography from planted graphs: security with logarithmic-size messages
• Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
• Natural Generalizations of Threshold Secret Sharing
• Probabilistic secret sharing
• Algebraic geometric secret sharing schemes over large fields are asymptotically threshold
• scientific article; zbMATH DE number 7559096 (Why is no real title available?)
• Threshold secret sharing requires a linear-size alphabet
• Secret Sharing Schemes with Algebraic Properties and Applications
• How to Share a Secret, Infinitely
• scientific article; zbMATH DE number 7746350 (Why is no real title available?)
• On the information ratio of non-perfect secret sharing schemes
• Approximate Degree, Secret Sharing, and Concentration Phenomena
• Threshold Secret Sharing Requires a Linear Size Alphabet

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)