Ideal homogeneous access structures constructed from graphs

MaRDI QIDQ4929335zbMATH OpenFDO

Authors

Publication date 22 September 2010

Full work available at URL http://www.jucs.org/jucs_15_14/ideal_homogeneous_access_structures

zbMATH Keywords

cryptographygraph connectivityideal secret sharing

Mathematics Subject Classification ID

Connectivity (05C40) Applications of graph theory (05C90) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Secret sharing schemes on sparse homogeneous access structures with rank three
• Secret sharing schemes for very dense graphs
• An efficient construction of perfect secret sharing schemes for graph-based structures
• Secret-sharing schemes for very dense graphs

Cited in

(2)

• Ideal secret sharing schemes on graph-based 3-homogeneous access structures
• Access structures determined by uniform polymatroids

This page was built for publication: Ideal homogeneous access structures constructed from graphs

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