Secret sharing based on Cartesian product of graphs

zbMATH Open1307.05190MaRDI QIDQ5176262FDOQ5176262

Authors: H. R. Maimani, Zynolabedin Norozi 

Publication date: 3 March 2015

Full work available at URL: http://www.ijmsi.ir/browse.php?slc_lang=en&sid=1&a_id=502

Recommendations

• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Graph decompositions and secret sharing schemes
• Exact information ratios for secret sharing on small graphs with girth at least 5
• On the information ratio of graphs without high-degree neighbors
• Secret sharing on infinite graphs

zbMATH Keywords

secret sharingCartesian graph productprism graph

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)

Cited In (3)

• Secret sharing schemes based on graphical codes
• Graph information ratio
• SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING

This page was built for publication: Secret sharing based on Cartesian product of graphs

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