Paper 2016/928

The complexity of the connected graph access structure on seven participants

Massoud Hadian Dehkordi and Ali Safi

Abstract

In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we used induced subgraph complexity of the graph G with access structure, Gama, to obtain a lower bound on the complexity of the graph G. Secondly, by applying decomposition techniques we obtain an upper bound on the complexity of the graph G. We determine the exact values of the complexity for each of the ten graph access structures on seven participants. Also, we improve the value bound of the complexity of the six graph access structures with seven participants.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Access structureComplexitySecret sharing schemeConnected graphInduced subgraph
Contact author(s)
alisafi @ iust ac ir
History
2016-09-28: revised
2016-09-27: received
See all versions
Short URL
https://ia.cr/2016/928
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/928,
      author = {Massoud Hadian Dehkordi and Ali Safi},
      title = {The complexity of the connected graph access structure on seven participants},
      howpublished = {Cryptology ePrint Archive, Paper 2016/928},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/928}},
      url = {https://eprint.iacr.org/2016/928}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.