New bounds on the information rate of secret sharing schemes

DOI10.1109/18.370169MaRDI QIDQ4838690zbMATH OpenOpenAlexFDO

Authors Carlo Blundo, Alfredo De Santis, A. Giorgio Gaggia, Ugo Vaccaro

Publication date 17 December 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/dbfd34304b655ee0fdf518f8f800ba35615990c8

zbMATH Keywords

cryptographydata securityentropyinformtion ratesecret sharing scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 708804
• Tight bounds on the information rate of secret sharing schemes
• On the information rate of secret sharing schemes
• scientific article; zbMATH DE number 708803
• Some improved bounds on the information rate of perfect secret sharing schemes
• On the information rate of perfect secret sharing schemes
• On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
• Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
• Secret Sharing and Non-Shannon Information Inequalities
• Secret Sharing and Non-Shannon Information Inequalities

Cited in

(16)

• Tight bounds on the information rate of secret sharing schemes
• Sharing one secret vs. sharing many secrets.
• On the information ratio of non-perfect secret sharing schemes
• Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
• Optimal assignment schemes for general access structures based on linear programming
• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
• Local bounds for the optimal information ratio of secret sharing schemes
• Sharing multiple secrets: Models, schemes and analysis
• On secret sharing schemes
• On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes
• On Linear Secret Sharing for Connectivity in Directed Graphs
• scientific article; zbMATH DE number 553905 (Why is no real title available?)
• New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
• Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
• On the information rate of secret sharing schemes

This page was built for publication: New bounds on the information rate of secret sharing schemes

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