{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:52:41Z","timestamp":1778064761370,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:00:00Z","timestamp":1673308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100009105","name":"ministry of internal affairs and communications","doi-asserted-by":"crossref","award":["182103105"],"award-info":[{"award-number":["182103105"]}],"id":[{"id":"10.13039\/501100009105","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003382","name":"core research for evolutional science and technology","doi-asserted-by":"publisher","award":["JPMJCR14D6"],"award-info":[{"award-number":["JPMJCR14D6"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"core research for evolutional science and technology","doi-asserted-by":"publisher","award":["JPMJCR19F6"],"award-info":[{"award-number":["JPMJCR19F6"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP19K22838"],"award-info":[{"award-number":["JP19K22838"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP20J20797"],"award-info":[{"award-number":["JP20J20797"]}],"id":[{"id":"10.13039\/501100001691","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]]},"DOI":"10.1007\/s10623-022-01177-2","type":"journal-article","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T13:05:26Z","timestamp":1673355926000},"page":"1751-1778","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0019-6934","authenticated-orcid":false,"given":"Reo","family":"Eriguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noboru","family":"Kunihiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Nuida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,10]]},"reference":[{"issue":"4","key":"1177_CR1","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00145-010-9056-z","volume":"23","author":"O Barkol","year":"2010","unstructured":"Barkol O., Ishai Y., Weinreb E.: On d-multiplicative secret sharing. J. Cryptol. 23(4), 580\u2013593 (2010).","journal-title":"J. Cryptol."},{"key":"1177_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"key":"1177_CR3","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"2","key":"1177_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello S., Padr\u00f3 C., S\u00e1ez G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptogr. 25(2), 175\u2013188 (2002).","journal-title":"Des. Codes Cryptogr."},{"key":"1177_CR5","doi-asserted-by":"crossref","unstructured":"Cascudo I., Cramer R., Xing C.: The arithmetic codex. In: 2012 IEEE Information Theory Workshop, pp. 75\u201379 (2012).","DOI":"10.1109\/ITW.2012.6404767"},{"key":"1177_CR6","doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e9peau C., Damgard I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, pp. 11\u201319 (1988).","DOI":"10.1145\/62212.62214"},{"key":"1177_CR7","doi-asserted-by":"crossref","unstructured":"Chen H., Cramer R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Advances in Cryptology\u2014CRYPTO 2006, pp. 521\u2013536 (2006).","DOI":"10.1007\/11818175_31"},{"key":"1177_CR8","doi-asserted-by":"crossref","unstructured":"Chen H., Cramer R., de\u00a0Haan R., Pueyo I.C.: Strongly multiplicative ramp schemes from high degree rational points on curves. In: Advances in Cryptology\u2014EUROCRYPT 2008, pp. 451\u2013470 (2008).","DOI":"10.1007\/978-3-540-78967-3_26"},{"key":"1177_CR9","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\u2014EUROCRYPT 2000, pp. 316\u2013334 (2000).","DOI":"10.1007\/3-540-45539-6_22"},{"issue":"7","key":"1177_CR10","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11425-013-4654-5","volume":"56","author":"R Cramer","year":"2013","unstructured":"Cramer R., Fehr S., Padr\u00f3 C.: Algebraic manipulation detection codes. Sci. China Math. 56(7), 1349\u20131358 (2013).","journal-title":"Sci. China Math."},{"key":"1177_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Nielsen J.B.: Scalable and unconditionally secure multiparty computation. In: Advances in Cryptology\u2014CRYPTO 2007, pp. 572\u2013590 (2007).","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"1177_CR12","unstructured":"Eriguchi R., Kunihiro N.: d-Multiplicative secret sharing for multipartite adversary structures. In: 1st Conference on Information-Theoretic Cryptography (ITC 2020), vol. 163, pp. 2:1\u20132:16 (2020)."},{"issue":"3","key":"1177_CR13","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."},{"key":"1177_CR14","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s O., Padr\u00f3 C.: Ideal secret sharing schemes for useful multipartite access structures. In: Coding and Cryptology, pp. 99\u2013108 (2011).","DOI":"10.1007\/978-3-642-20901-7_6"},{"issue":"2","key":"1177_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia A., Stichtenoth H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Number Theory 61(2), 248\u2013273 (1996).","journal-title":"J. Number Theory"},{"key":"1177_CR16","doi-asserted-by":"crossref","unstructured":"Hirt M., Maurer U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201997, pp. 25\u201334 (1997).","DOI":"10.1145\/259380.259412"},{"key":"1177_CR17","doi-asserted-by":"crossref","unstructured":"Hirt M., Tschudi D.: Efficient general-adversary multi-party computation. In: Advances in Cryptology\u2014ASIACRYPT 2013, Part II, pp. 181\u2013200 (2013).","DOI":"10.1007\/978-3-642-42045-0_10"},{"issue":"9","key":"1177_CR18","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito M., Saito A., Nishizeki T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. 72(9), 56\u201364 (1989).","journal-title":"Electron. Commun. Jpn."},{"key":"1177_CR19","volume-title":"Basic Algebra I","author":"N Jacobson","year":"2012","unstructured":"Jacobson N.: Basic Algebra I. Courier Corporation, Chelmsford (2012)."},{"key":"1177_CR20","doi-asserted-by":"crossref","unstructured":"K\u00e4sper E., Nikov V., Nikova S.: Strongly multiplicative hierarchical threshold secret sharing. In: International Conference on Information Theoretic Security, pp. 148\u2013168 (2007).","DOI":"10.1007\/978-3-642-10230-1_13"},{"issue":"11","key":"1177_CR21","doi-asserted-by":"publisher","first-page":"3973","DOI":"10.1109\/TIT.2007.907505","volume":"53","author":"M Liu","year":"2007","unstructured":"Liu M., Xiao L., Zhang Z.: Multiplicative linear secret sharing schemes based on connectivity of graphs. IEEE Trans. Inf. Theory 53(11), 3973\u20133978 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1177_CR22","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U Maurer","year":"2006","unstructured":"Maurer U.: Secure multi-party computation made simple. Discret. Appl. Math. 154(2), 370\u2013381 (2006).","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"1177_CR23","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(11), 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"1177_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes. Springer-Verlag, Berlin (2009)."},{"issue":"5","key":"1177_CR25","doi-asserted-by":"publisher","first-page":"3233","DOI":"10.1109\/TIT.2018.2886262","volume":"65","author":"M Yoshida","year":"2019","unstructured":"Yoshida M., Obana S.: Verifiably multiplicative secret sharing. IEEE Trans. Inf. Theory 65(5), 3233\u20133245 (2019).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01177-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01177-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01177-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:08:14Z","timestamp":1682021294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01177-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,10]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1177"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01177-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,10]]},"assertion":[{"value":"21 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}