{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:31:01Z","timestamp":1764981061058,"version":"3.46.0"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this article, all multipartite access structures obtained from uniform integer polymatroids were investigated using the method developed by Farr\u00e0s, Mart\u00ed-Farr\u00e9, and Padr\u00f3. They are matroid ports, i.e., they satisfy the necessary condition to be ideal. Moreover, each uniform integer polymatroid defines some ideal access structures. Some objects in this family can be useful for the applications of secret sharing. The method presented in this article is universal and can be continued with other classes of polymatroids in further similar studies. Here, we are especially interested in hierarchy of participants determined by the access structure, and we distinguish two main classes: they are compartmented and hierarchical access structures. The main results obtained for access structures determined by uniform integer polymatroids and a monotone increasing family\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2022-0017_eq_001.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"normal\">\u0394<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>\\Delta<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    can be summarized as follows. If the increment sequence of the polymatroid is non-constant, then the access structure is connected. If\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2022-0017_eq_002.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"normal\">\u0394<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>\\Delta<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    does not contain any singletons or the height of the polymatroid is maximal and its increment sequence is not constant starting from the second element, then the access structure is compartmented. If\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2022-0017_eq_003.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"normal\">\u0394<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>\\Delta<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is generated by a singleton or the increment sequence of the polymatroid is constant starting from the second element, then the obtained access structures are hierarchical. They are proven to be ideal, and their hierarchical orders are completely determined. Moreover, if the increment sequence of the polymatroid is constant and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2022-0017_eq_004.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mo>\u2223<\/m:mo>\n                          <m:mi mathvariant=\"normal\">\u0394<\/m:mi>\n                          <m:mo>\u2223<\/m:mo>\n                          <m:mo>&gt;<\/m:mo>\n                          <m:mn>1<\/m:mn>\n                        <\/m:math>\n                        <jats:tex-math>| \\Delta | \\gt 1<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , then the hierarchical order is not antisymmetric, i.e., some different blocks are equivalent. The hierarchical order of access structures obtained from uniform integer polymatroids is always flat, that is, every hierarchy chain has at most two elements.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2022-0017","type":"journal-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:14:21Z","timestamp":1695647661000},"source":"Crossref","is-referenced-by-count":0,"title":["Access structures determined by uniform polymatroids"],"prefix":"10.1515","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3224-7476","authenticated-orcid":false,"given":"Renata","family":"Kawa","sequence":"first","affiliation":[{"name":"Faculty of Science and Technology, Jan D\u0142ugosz University , Cz\u0229stochowa , Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5743-3809","authenticated-orcid":false,"given":"Mieczys\u0142aw","family":"Kula","sequence":"additional","affiliation":[{"name":"Institute of Mathematics, University of Silesia , Katowice , Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2023,9,25]]},"reference":[{"key":"2025120600280438424_j_jmc-2022-0017_ref_001","doi-asserted-by":"crossref","unstructured":"Blakley GR. Safeguarding cryptographic keys. The National Computer Conference 1979. AFIPS. Vol. 48; 1979. p. 313\u20137.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_002","doi-asserted-by":"crossref","unstructured":"Shamir A. How to share a secret. Commun. ACM. 1979;22:612\u20133.","DOI":"10.1145\/359168.359176"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_003","doi-asserted-by":"crossref","unstructured":"Beimel A. Secret-sharing schemes: a survey. In: Third International Workshop. IWCC 2011. Lecture Notes in Computer Science. vol. 6639; 2011. p. 11\u201346.","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_004","unstructured":"Padr\u00f3 C. Lecture notes in secret sharing. IACR Cryptol. ePrint Arch. 2012;2012:674."},{"key":"2025120600280438424_j_jmc-2022-0017_ref_005","unstructured":"Ito M, Saito A, Nishizeki T. Secret sharing schemes realizing general access structure. In: Proceedings on the IEEE GLOBECOM\u201987. 1987. p. 99\u2013102."},{"key":"2025120600280438424_j_jmc-2022-0017_ref_006","doi-asserted-by":"crossref","unstructured":"Benaloh J, Leichter J. Generalized secret sharing and monotone functions. In: Advances in Cryptology. CRYPTO\u201988. Lecture Notes in Computer Science. vol. 403; 1990. p. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_007","doi-asserted-by":"crossref","unstructured":"Kothari S.C. Generalized linear threshold scheme. Advances in Cryptology - CRYPTOa84. Lecture Notes in Computer Science. Vol. 196; 1985. p. 231\u201341.","DOI":"10.1007\/3-540-39568-7_19"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_008","doi-asserted-by":"crossref","unstructured":"Simmons GJ. How to (really) share a secret. Advances in Cryptology - CRYPTO88. Lecture Notes in Computer Science. Vol. 403; 1990. p. 390\u2013448.","DOI":"10.1007\/0-387-34799-2_30"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_009","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O, Metcalf-Burton JR, Padr\u00f3 C, V\u00e1zquez L. On the optimization of bipartite secret sharing schemes. Des. Codes Cryptogr. 2012;63:255\u201371.","DOI":"10.1007\/s10623-011-9552-7"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_010","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O, Mart\u00ed-Farr\u00e9 J, Padr\u00f3 C. Ideal multipartite secret sharing schemes. J Cryptol. 2012;25:434\u201363.","DOI":"10.1007\/s00145-011-9101-6"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_011","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O, Padr\u00f3 C. Ideal hierarchical secret sharing schemes. IEEE Trans Inform Theory. 2012;58:3273\u201386.","DOI":"10.1109\/TIT.2011.2182034"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_012","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O, Padr\u00f3 C, Xing C, Yang A. Natural generalizations of threshold secret sharing. IEEE Trans Inform Theory 2014;60:1652\u201364.","DOI":"10.1109\/TIT.2014.2300113"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_013","doi-asserted-by":"crossref","unstructured":"Tassa T. Hierarchical threshold secret sharing. J Cryptol. 2007;20:237\u201364.","DOI":"10.1007\/s00145-006-0334-8"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_014","unstructured":"Brickell EF. Some ideal secret sharing schemes. J Combin Math Combin Comput. 1989;6:105\u201313."},{"key":"2025120600280438424_j_jmc-2022-0017_ref_015","doi-asserted-by":"crossref","unstructured":"Brickell EF, Davenport DM. On the classification of ideal secret sharing schemes. J Cryptol. 1991;4:123\u201334.","DOI":"10.1007\/BF00196772"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_016","unstructured":"Kula M. Access structures induced by polymatroids with extreme rank function. Cryptology ePrint Archive, Paper 2023\/962 (https:\/\/eprint.iacr.org\/2023\/962)."},{"key":"2025120600280438424_j_jmc-2022-0017_ref_017","unstructured":"Csirmaz L., Mat\u00fas F, Padr\u00f3 Bipartite secret sharing and staircases. 2021. ArXiv\/2103.04904."},{"key":"2025120600280438424_j_jmc-2022-0017_ref_018","doi-asserted-by":"crossref","unstructured":"Csirmaz L. The size of a share must be large. J Cryptol. 1997;10:223\u201331.","DOI":"10.1007\/s001459900029"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_019","doi-asserted-by":"crossref","unstructured":"Seymour P.D. On secret-sharing matroids. J Combin Theory Ser B. 1992;56:69\u201373.","DOI":"10.1016\/0095-8956(92)90007-K"},{"key":"2025120600280438424_j_jmc-2022-0017_ref_020","unstructured":"Kawa R. Hierarchity of multipartite access structures. PhD Thesis. 2015. Katowice: University of Silesia; (Polish)."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2022-0017\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2022-0017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:28:21Z","timestamp":1764980901000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2022-0017\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,6,5]]},"published-print":{"date-parts":[[2023,6,5]]}},"alternative-id":["10.1515\/jmc-2022-0017"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2022-0017","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2023,1,1]]},"article-number":"20220017"}}