Secret sharing on infinite graphs

MaRDI QIDQ3613099zbMATH OpenFDO

Authors László Csirmaz

Publication date 11 March 2009

Full work available at URL http://tatra.mat.savba.sk/paper.php?id_paper=961

zbMATH Keywords

latticeinformation theoryinfinite graphsecret sharing scheme

Mathematics Subject Classification ID

Applications of graph theory (05C90) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Some improved bounds on the information rate of perfect secret sharing schemes
• An impossibility result on graph secret sharing
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Graph decompositions and secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes

Cited in

(6)

• Secret sharing based on Cartesian product of graphs
• Infinite secret sharing -- examples
• Secret sharing on the \(d\)-dimensional cube
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Access structure in graphs in high dimension and application to secret sharing
• Corrigendum to: Secret sharing on infinite graphs

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

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