{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T08:42:21Z","timestamp":1772008941000,"version":"3.50.1"},"reference-count":16,"publisher":"Walter de Gruyter GmbH","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\n                    <jats:italic>G<\/jats:italic>\n                    with access structure \u0393 to obtain a lower bound on the complexity of the graph\n                    <jats:italic>G<\/jats:italic>\n                    . Then, applying decomposition techniques, we obtain an upper bound on the complexity of the graph\n                    <jats:italic>G<\/jats:italic>\n                    . 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.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2016-0017","type":"journal-article","created":{"date-parts":[[2017,2,23]],"date-time":"2017-02-23T05:00:51Z","timestamp":1487826051000},"page":"25-35","source":"Crossref","is-referenced-by-count":3,"title":["The complexity of the connected graph access structure on seven participants"],"prefix":"10.1515","volume":"11","author":[{"given":"Massoud","family":"Hadian Dehkordi","sequence":"first","affiliation":[{"name":"School of Mathematics, Iran University of Science and Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Safi","sequence":"additional","affiliation":[{"name":"School of Mathematics, Iran University of Science and Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2017,2,23]]},"reference":[{"key":"2025120600295334199_j_jmc-2016-0017_ref_001_w2aab3b7d793b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"Blakley G. R.,\nSafeguarding cryptographic keys,\nProceedings of the 1979 AFIPS National Computer Conference,\nAFIPS Press, Montvale (1979), 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_002_w2aab3b7d793b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"Blundo C., De Santis A., Stinson D. R. and Vaccaro U.,\nGraph decompositions and secret sharing schemes,\nJ. Cryptology 8 (1995), 39\u201364.","DOI":"10.1007\/BF00204801"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_003_w2aab3b7d793b1b6b1ab2ab3Aa","doi-asserted-by":"crossref","unstructured":"Brickell E. F. and Davenport D. M.,\nOn the classification of ideal secret sharing schemes,\nJ. Cryptology 4 (1991), 123\u2013134.","DOI":"10.1007\/BF00196772"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_004_w2aab3b7d793b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"Brickell E. F. and Stinson D. R.,\nSome improved bounds on the information rate of perfect secret sharing schemes,\nJ. Cryptology 5 (1992), 153\u2013166.","DOI":"10.1007\/BF02451112"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_005_w2aab3b7d793b1b6b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"Carles P. and V\u00e1zquez L.,\nFinding lower bounds on the complexity of secret sharing schemes by linear programming,\nLATIN 2010: Theoretical Informatics,\nSpringer, Berlin (2010), 344\u2013355.","DOI":"10.1007\/978-3-642-12200-2_31"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_006_w2aab3b7d793b1b6b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"Csirmaz L.,\nAn impossibility result on graph secret sharing,\nDes. Codes Cryptogr. 53 (2009), 195\u2013209.","DOI":"10.1007\/s10623-009-9304-0"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_007_w2aab3b7d793b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"Gharahi M. and Hadian Dehkordi M.,\nThe complexity of the graph access structures on six participants,\nDes. Codes Cryptogr. 67 (2013), 169\u2013173.","DOI":"10.1007\/s10623-011-9592-z"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_008_w2aab3b7d793b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"Li Z. H., Song Y. and Li Y. M.,\nThe optimal information rates of the graph access structures on seven participants,\nAdv. Mat. Res. 859 (2014), 596\u2013601.","DOI":"10.4028\/www.scientific.net\/AMR.859.596"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_009_w2aab3b7d793b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"Shamir A.,\nHow to share a secret,\nCommun. ACM 22 (1979), 612\u2013613.","DOI":"10.1145\/359168.359176"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_010_w2aab3b7d793b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"Song Y., Li Z., Li Y. and Xin R.,\nThe optimal information rate for graph access structures of nine participants,\nFront. Comput. Sci. 9 (2015), no. 5, 778\u2013787.","DOI":"10.1007\/s11704-015-3255-6"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_011_w2aab3b7d793b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"Song Y., Li Z. and Wang W.,\nThe information rate of secret sharing schemes on seven participants by connected graphs,\nRecent Advances in Computer Science and Information Engineering. Vol. 4,\nLect. Notes Electr. Eng. 127,\nSpringer, Berlin (2012), 637\u2013645.","DOI":"10.1007\/978-3-642-25769-8_90"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_012_w2aab3b7d793b1b6b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"Stinson D. R.,\nDecomposition constructions for secret-sharing schemes,\nIEEE Trans. Inform. Theory 40 (1994), 118\u2013125.","DOI":"10.1109\/18.272461"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_013_w2aab3b7d793b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"Sun H. M. and Chen B. L.,\nWeighted decomposition construction for perfect secret sharing schemes,\nComput. Math. Appl. 43 (2002), 877\u2013887.","DOI":"10.1016\/S0898-1221(01)00328-5"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_014_w2aab3b7d793b1b6b1ab2ac14Aa","unstructured":"Van Dijk M.,\nSecret key sharing and secret key generation,\nPh.D thesis, Eindhoven University of Technology, Eindhoven, 1997."},{"key":"2025120600295334199_j_jmc-2016-0017_ref_015_w2aab3b7d793b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"Wang W., Li Z. and Song Y.,\nThe optimal information rate of perfect secret sharing schemes,\nProceedings of the 2011 International Conference on Business Management and Electronic Information,\nIEEE Press, Piscataway (2011), 207\u2013212.","DOI":"10.1109\/ICBMEI.2011.5917883"},{"key":"2025120600295334199_j_jmc-2016-0017_ref_016_w2aab3b7d793b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"Wen-Ai J. and Martin K. M.,\nPerfect secret sharing schemes on five participants,\nDes. Codes Cryptogr. 9 (1996), no. 3, 267\u2013286.","DOI":"10.1007\/BF00129769"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jmc\/11\/1\/article-p25.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0017\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:30:15Z","timestamp":1764981015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2016-0017\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,23]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,3,1]]},"published-print":{"date-parts":[[2017,3,1]]}},"alternative-id":["10.1515\/jmc-2016-0017"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2016-0017","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"value":"1862-2984","type":"electronic"},{"value":"1862-2976","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2,23]]}}}