The complexity of the connected graph access structure on seven participants

In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, applying decomposition tech...

Full description

Bibliographic Details
Main Authors:	Hadian Dehkordi Massoud, Safi Ali
Format:	Article
Language:	English
Published:	De Gruyter 2017-03-01
Series:	Journal of Mathematical Cryptology
Subjects:	access structure complexity secret sharing scheme connected graph induced subgraph 68r10 94a62
Online Access:	https://doi.org/10.1515/jmc-2016-0017

id	doaj-161b52b9458b4584a7ba8a12ad687768
record_format	Article
spelling	doaj-161b52b9458b4584a7ba8a12ad6877682021-09-06T19:40:44ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842017-03-01111253510.1515/jmc-2016-0017The complexity of the connected graph access structure on seven participantsHadian Dehkordi Massoud0Safi Ali1School of Mathematics, Iran University of Science and Technology, Tehran, IranSchool of Mathematics, Iran University of Science and Technology, Tehran, IranIn this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, 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 for the six graph access structures with seven participants.https://doi.org/10.1515/jmc-2016-0017access structurecomplexitysecret sharing schemeconnected graphinduced subgraph68r10 94a62
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Hadian Dehkordi Massoud Safi Ali
spellingShingle	Hadian Dehkordi Massoud Safi Ali The complexity of the connected graph access structure on seven participants Journal of Mathematical Cryptology access structure complexity secret sharing scheme connected graph induced subgraph 68r10 94a62
author_facet	Hadian Dehkordi Massoud Safi Ali
author_sort	Hadian Dehkordi Massoud
title	The complexity of the connected graph access structure on seven participants
title_short	The complexity of the connected graph access structure on seven participants
title_full	The complexity of the connected graph access structure on seven participants
title_fullStr	The complexity of the connected graph access structure on seven participants
title_full_unstemmed	The complexity of the connected graph access structure on seven participants
title_sort	complexity of the connected graph access structure on seven participants
publisher	De Gruyter
series	Journal of Mathematical Cryptology
issn	1862-2976 1862-2984
publishDate	2017-03-01
description	In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, 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 for the six graph access structures with seven participants.
topic	access structure complexity secret sharing scheme connected graph induced subgraph 68r10 94a62
url	https://doi.org/10.1515/jmc-2016-0017
work_keys_str_mv	AT hadiandehkordimassoud thecomplexityoftheconnectedgraphaccessstructureonsevenparticipants AT safiali thecomplexityoftheconnectedgraphaccessstructureonsevenparticipants AT hadiandehkordimassoud complexityoftheconnectedgraphaccessstructureonsevenparticipants AT safiali complexityoftheconnectedgraphaccessstructureonsevenparticipants
_version_	1717767870108139520

The complexity of the connected graph access structure on seven participants

Similar Items