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

DOI10.1007/S10623-012-9792-1zbMATH Open1321.94109OpenAlexW2040114126MaRDI QIDQ2510652FDOQ2510652

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

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

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)

Cites Work

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

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)