On the information ratio of graphs with many leaves

DOI10.2478/TMMP-2019-0008MaRDI QIDQ5234652zbMATH OpenOpenAlexWikidataFDO

Authors Máté Gyarmati, Péter Ligeti

Publication date 30 September 2019

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/tmmp-2019-0008

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Exact information ratios for secret sharing on small graphs with girth at least 5
• On the information ratio of graphs without high-degree neighbors
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• scientific article; zbMATH DE number 503323
• An impossibility result on graph secret sharing

Cited in

(5)

• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• On the information ratio of graphs without high-degree neighbors
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Information Measures of Frequency Distributions with an Application to Labeled Graphs
• Graph information ratio

This page was built for publication: On the information ratio of graphs with many leaves

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