{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:47Z","timestamp":1740122507946,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["\u00daNKP-21-4 New National Excellence Programs of the Ministry for Innovation and Technology","\u00daNKP-20-3 New National Excellence Program of the Ministry for Innovation and Technology"],"award-info":[{"award-number":["\u00daNKP-21-4 New National Excellence Programs of the Ministry for Innovation and Technology","\u00daNKP-20-3 New National Excellence Program of the Ministry for Innovation and Technology"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Bipartite secret sharing schemes realize access structures in which the participants are divided into two parts, and all the participants in the same part play an equivalent role. Such a bipartite structure can be described by the collection of its minimal points. The complexity of a scheme is the ratio between the maximum share size given to the participants and the secret size, and the Shannon complexity of a structure is the best lower bound provided by the entropy method. Within this work, we compute the Shannon complexity of regular bipartite structures and provide optimal constructions for some bipartite structures defined by 2 and 3 points.<\/jats:p>","DOI":"10.1007\/s10623-023-01187-8","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T06:34:54Z","timestamp":1676615694000},"page":"1951-1971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secret sharing on regular bipartite access structures"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4122-9181","authenticated-orcid":false,"given":"M\u00e1t\u00e9","family":"Gyarmati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: Proceedings of the Third International Conference on Coding and Cryptology (IWCC\u201911), pp. 11\u201346. Springer, Berlin (2011).","key":"1187_CR1","DOI":"10.1007\/978-3-642-20901-7_2"},{"unstructured":"Bellare M., Neven G.: Identity-based multi-signatures from RSA. In: Topics in Cryptology-CT-RSA. Lecture Notes in Computer Science, vol. 4377. Springer, Berlin.","key":"1187_CR2"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computations. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1\u201310 (1988).","key":"1187_CR3","DOI":"10.1145\/62212.62213"},{"key":"1187_CR4","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. Proc. Nat. Comput. Conf. 48, 313\u2013317 (1979).","journal-title":"Proc. Nat. Comput. Conf."},{"key":"1187_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00204801","volume":"8","author":"C Blundo","year":"1995","unstructured":"Blundo C., De Santis A., Stinson D.R., Vaccaro U.: Graph decomposition and secret sharing schemes. J. Cryptol. 8, 39\u201364 (1995).","journal-title":"J. Cryptol."},{"unstructured":"Bonawitz K.A., Ivanov V., Kreuter B., Marcedone A., McMahan H.B., Patel S., Ramage D., Segal A., Seth K.: Practical Secure Aggregation for Federated Learning on User-Held Data, NIPS Workshop on Private Multi-Party Machine Learning (2016).","key":"1187_CR6"},{"key":"1187_CR7","first-page":"105","volume":"9","author":"EF Brickell","year":"1989","unstructured":"Brickell E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105\u2013113 (1989).","journal-title":"J. Comb. Math. Comb. Comput."},{"doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e9peau C., Damg\u00e5ard I.: Multiparty unconditionally secure protocols. In: 20th ACM Symposium on the Theory of Computing, pp. 11\u201319 (1988).","key":"1187_CR8","DOI":"10.1145\/62212.62214"},{"doi-asserted-by":"crossref","unstructured":"Cramer R., Damg\u00e5rd I., Maurer U.: General secure multi-party computation from any linear secret-sharing scheme. In: Advances in Cryptology-EUROCRYPT, vol. 18 (2000).","key":"1187_CR9","DOI":"10.1007\/3-540-45539-6_22"},{"key":"1187_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"Csirmaz L.: The size of a share must be large. J. Cryptol. 10, 223\u2013231 (1997).","journal-title":"J. Cryptol."},{"key":"1187_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10623-009-9304-0","volume":"53","author":"L Csirmaz","year":"2009","unstructured":"Csirmaz L.: An impossibility result on graph secret sharing. Des. Codes Cryptogr. 53, 195\u2013209 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"1187_CR12","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10623-013-9888-2","volume":"74","author":"L Csirmaz","year":"2015","unstructured":"Csirmaz L.: Secret sharing on the d-dimensional cube. Des. Codes Cryptogr. 74, 719\u2013729 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1187_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1515\/jmc-2019-0045","volume":"15","author":"L Csirmaz","year":"2021","unstructured":"Csirmaz L.: Secret sharing and duality. J. Math. Cryptol. 15(1), 157\u2013173 (2021).","journal-title":"J. Math. Cryptol."},{"key":"1187_CR14","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1109\/TIT.2012.2236958","volume":"59","author":"L Csirmaz","year":"2013","unstructured":"Csirmaz L., Tardos G.: Optimal information rate of secret sharing schemes on trees. IEEE Trans. Inf. Theory 59, 2527\u20132630 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Csirmaz L., Matus F., Padr\u00f3 C.: Bipartite secret sharing and staircases. arxiv:2103.04904.","key":"1187_CR15"},{"key":"1187_CR16","volume-title":"Information Theory. Coding Theorems for Discrete Memoryless Systems","author":"I Csisz\u00e1r","year":"1981","unstructured":"Csisz\u00e1r I., K\u00f6rner J.: Information Theory. Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981)."},{"issue":"3","key":"1187_CR17","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-011-9101-6","volume":"25","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Mart\u00ed-Farr\u00e9 J., Padr\u00f3 C.: Ideal multipartite secret sharing schemes. J. Cryptol. 25(3), 434\u2013463 (2012).","journal-title":"J. Cryptol."},{"issue":"2","key":"1187_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10623-011-9552-7","volume":"63","author":"O Farr\u00e0s","year":"2012","unstructured":"Farr\u00e0s O., Metcalf-Burton J.R., Padr\u00f3 C., V\u00e0zquez L.: On the optimization of bipartite secret sharing schemes. Des. Codes Cryptogr. 63(2), 255\u2013271 (2012).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"1187_CR19","doi-asserted-by":"publisher","first-page":"7088","DOI":"10.1109\/TIT.2020.3005706","volume":"66","author":"O Farr\u00e0s","year":"2020","unstructured":"Farr\u00e0s O., Kaced T., Martin S., Padr\u00f3 C.: Improving the linear programming technique in the search for lower bounds in secret sharing. IEEE Trans. Inf. Theory 66(11), 7088\u20137100 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1187_CR20","first-page":"143","volume":"7","author":"M Gharahi","year":"2013","unstructured":"Gharahi M., Dehkordi M.H.: Perfect secret sharing schemes for graph access structures on six participants. J. Math. Cryptol. 7, 143\u2013146 (2013).","journal-title":"J. Math. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Goyal V., Pandey O., Sahai A., Waters B.: Attribute-based encryption for fine-grained access control of encrypted data. In: 13th ACM Conference on Computer and Communications Security, pp. 89\u201398 (2006).","key":"1187_CR21","DOI":"10.1145\/1180405.1180418"},{"issue":"7","key":"1187_CR22","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1109\/TIT.2020.2965102","volume":"66","author":"M Gyarmati","year":"2020","unstructured":"Gyarmati M., Ligeti P.: Smallest graph achieving the Stinston bound. IEEE Trans. Inf. Theory 66(7), 4609\u20134612 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"15","key":"1187_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.dam.2021.07.011","volume":"304","author":"M Gyarmati","year":"2021","unstructured":"Gyarmati M., Ligeti P.: On the information ratio of graphs without high-degree neighbors. Discret. Appl. Math. 304(15), 55\u201362 (2021).","journal-title":"Discret. Appl. Math."},{"key":"1187_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01388562","volume":"4","author":"W Jackson","year":"1994","unstructured":"Jackson W., Martin K.M.: Geometric secret sharing schemes and their duals. Des. Codes Cryptogr. 4, 83\u201395 (1994).","journal-title":"Des. Codes Cryptogr."},{"key":"1187_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00129769","volume":"9","author":"W Jackson","year":"1996","unstructured":"Jackson W., Martin K.M.: Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9, 233\u2013250 (1996).","journal-title":"Des. Codes Cryptogr."},{"key":"1187_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1049\/ip-com:20050073","volume":"153","author":"S-L Ng","year":"2006","unstructured":"Ng S.-L.: Ideal secret sharing schemes with multipartite access structures. IEEE Proc. Commun. 153, 165\u2013168 (2006).","journal-title":"IEEE Proc. Commun."},{"issue":"7","key":"1187_CR27","doi-asserted-by":"publisher","first-page":"2596","DOI":"10.1109\/18.887867","volume":"46","author":"C Padr\u00f3","year":"2000","unstructured":"Padr\u00f3 C., S\u00e1ez G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7), 2596\u20132604 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Rado R.: Note on independence functions. Proc. Lond. Math. Soc. 7 (1957).","key":"1187_CR28","DOI":"10.1112\/plms\/s3-7.1.300"},{"key":"1187_CR29","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"1187_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01398012","volume":"6","author":"M van Dijk","year":"1995","unstructured":"van Dijk M.: On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6, 143\u2013160 (1995).","journal-title":"Des. Codes Cryptogr."},{"doi-asserted-by":"crossref","unstructured":"Simmons G.J.: How to (really) share a secret. In: Advances in Cryptology-CRYPTO\u201988. Lecture Notes in Computer Science, vol. 403, pp. 390\u2013448 (1990).","key":"1187_CR31","DOI":"10.1007\/0-387-34799-2_30"},{"key":"1187_CR32","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0898-1221(01)00328-5","volume":"43","author":"HL Sun","year":"2002","unstructured":"Sun H.L., Chen B.L.: Weighted decomposition construction for perfect secret sharing schemes. Comput. Math. Appl. 43, 877\u2013887 (2002).","journal-title":"Comput. Math. Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01187-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:09:11Z","timestamp":1682021351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01187-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,14]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1187"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01187-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,2,14]]},"assertion":[{"value":"26 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}