Secret sharing schemes on graphs

DOI10.1556/SSCMATH.2007.1021MaRDI QIDQ3531289zbMATH OpenOpenAlexFDO

Authors László Csirmaz

Publication date 22 October 2008

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/sscmath.2007.1021

zbMATH Keywords

information theorypolymatroidsecret sharing scheme

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• On the information rate of perfect secret sharing schemes
• An impossibility result on graph secret sharing
• scientific article; zbMATH DE number 708803
• Some improved bounds on the information rate of perfect secret sharing schemes
• Graph decompositions and secret sharing schemes

Cited in

(19)

• Secret sharing schemes for graph-based prohibited structures
• A general theory of sharing graphs
• On the information rate of perfect secret sharing schemes
• Exact information ratios for secret sharing on small graphs with girth at least 5
• Secret sharing schemes based on graphical codes
• Secret sharing on the \(d\)-dimensional cube
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
• Percolation in the secrecy graph
• The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
• Secret sharing on large girth graphs
• Secret sharing schemes for dense forbidden graphs
• Secret-sharing schemes for very dense graphs
• Perfect secret sharing scheme based on vertex domination set
• scientific article; zbMATH DE number 1788241 (Why is no real title available?)
• On weak odd domination and graph-based quantum secret sharing
• SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING
• Succinct computational secret sharing
• A comprehensive review of graph theory applications in secret sharing schemes

This page was built for publication: Secret sharing schemes on graphs

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