The complexity of the connected graph access structure on seven participants

DOI10.1515/JMC-2016-0017zbMATH Open1405.68247OpenAlexW2590030703MaRDI QIDQ515397FDOQ515397

Ali Safi, Massoud Hadian Dehkordi

Publication date: 16 March 2017

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2016-0017

zbMATH Keywords

complexityconnected graphinduced subgraphaccess structuresecret-sharing scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Perfect secret sharing schemes on five participants
• An impossibility result on graph secret sharing
• Graph decompositions and secret sharing schemes
• Weighted decomposition construction for perfect secret sharing schemes
• The complexity of the graph access structures on six participants
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
• Title not available (Why is that?)

Cited In (2)

• Exact information ratios for secret sharing on small graphs with girth at least 5
• The quantum secret sharing schemes based on hyperstar access structures

This page was built for publication: The complexity of the connected graph access structure on seven participants

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