Average complexities of access structures on five participants

DOI10.3934/AMC.2013.7.311MaRDI QIDQ2391417zbMATH OpenOpenAlexFDO

Authors Motahhareh Gharahi, Massoud Hadian Dehkordi

Publication date 31 July 2013

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/amc.2013.7.311

zbMATH Keywords

average complexityentropy methodperfect secret sharing scheme

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The complexity of the graph access structures on six participants
• Perfect secret sharing schemes for graph access structures on six participants
• The complexity of the connected graph access structure on seven participants
• Complexity of universal access structures
• Secret sharing on regular bipartite access structures

Cited in

(3)

• Improving the linear programming technique in the search for lower bounds in secret sharing
• The complexity of the graph access structures on six participants
• The complexity of the connected graph access structure on seven participants

This page was built for publication: Average complexities of access structures on five participants

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