New bounds on the information rate of secret sharing schemes

DOI10.1109/18.370169zbMath0827.94022OpenAlexW2089599983MaRDI QIDQ4838690

A. Giorgio Gaggia, Carlo Blundo, Alfredo De Santis, 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

entropycryptographydata securitysecret sharing schemeinformtion rate

Mathematics Subject Classification ID

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

Related Items

On secret sharing schemes, Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs, Sharing one secret vs. sharing many secrets., On Linear Secret Sharing for Connectivity in Directed Graphs, New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures, On the information rate of secret sharing schemes, Optimal assignment schemes for general access structures based on linear programming, Sharing multiple secrets: Models, schemes and analysis