New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

DOI10.1016/J.INS.2013.03.047MaRDI QIDQ497216zbMATH OpenOpenAlexFDO

Authors Hui-Chuan Lu, Hung-Lin Fu

Publication date 23 September 2015

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.03.047

zbMATH Keywords

access structuresecret-sharing schemecomplete multipartite coveringoptimal average information rateoptimal information rateweighted threshold access structure

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Weighted threshold secret sharing schemes
• scientific article; zbMATH DE number 708803
• On the information rate of secret sharing schemes
• Graph decompositions and secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes

Cites work

• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• An explication of secret sharing schemes
• An ideal multi-secret sharing scheme based on MSP
• An impossibility result on graph secret sharing
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• New bounds on the information rate of secret sharing schemes
• New efficient and practical verifiable multi-secret sharing schemes
• On the classification of ideal secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Perfect secret sharing schemes on five participants
• Probabilistic visual secret sharing schemes for grey-scale images and color images
• Secret sharing schemes with bipartite access structure
• Secret-Sharing Schemes: A Survey
• Some improved bounds on the information rate of perfect secret sharing schemes
• Strong \((n, t, n)\) verifiable secret sharing scheme
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Tight bounds on the information rate of secret sharing schemes
• Visual multiple secret sharing based upon turning and flipping
• Weighted threshold secret sharing schemes

Cited in

(6)

• The lower bound and exact value of the information rate of some developed graph access structures
• Exact information ratios for secret sharing on small graphs with girth at least 5
• Realizing secret sharing with general access structure
• Weighted threshold secret sharing schemes
• Weighted secret sharing from wiretap channels
• Memory leakage-resilient secret sharing schemes

This page was built for publication: New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497216)