The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures

DOI10.1007/S10623-012-9792-1MaRDI QIDQ2510652zbMATH OpenOpenAlexFDO

Authors Hui-Chuan Lu, Hung-Lin Fu

Publication date 1 August 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-012-9792-1

zbMATH Keywords

treeentropysecret-sharing schemestar coveringaverage information ratiograph-based access structure

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Some improved bounds on the information rate of perfect secret sharing schemes
• An impossibility result on graph secret sharing
• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
• Secret sharing schemes on graphs
• scientific article; zbMATH DE number 1775121

Cites work

• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• On the classification of ideal secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Secret-Sharing Schemes: A Survey
• The size of a share must be large

Cited in

(1)

• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs

This page was built for publication: The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures

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