{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:44:11Z","timestamp":1761709451632,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T00:00:00Z","timestamp":1522022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10623-017-0424-7","type":"journal-article","created":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T00:55:08Z","timestamp":1522025708000},"page":"1793-1805","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the (in)efficiency of non-interactive secure multiparty computation"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-0058","authenticated-orcid":false,"given":"Maki","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Obana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,26]]},"reference":[{"issue":"4","key":"424_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":"424_CR2","doi-asserted-by":"crossref","unstructured":"Beimel A., Gabizon A., Ishai Y., Kushilevitz E., Meldgaard S., Paskin-Cherniavsky A.: Non-interactive secure multiparty computation. In: Advances in Cryptology\u2013 -CRYPTO2014. Lecture Notes in Computer Science, vol. 8617, p. 387\u2013404 (2014).","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"424_CR3","doi-asserted-by":"crossref","unstructured":"Beimel A., Gabizon A., Ishai Y., Kushilevitz E., Meldgaard S., Paskin-Cherniavsky A.: Non-interactive Secure Multiparty Computation. Cryptology ePrint Archive: Report 2014\/960 (2014).","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"424_CR4","doi-asserted-by":"crossref","unstructured":"Benhamouda F., Krawczyk H., Rabin T.: Robust non-interactive multiparty computation against constant-size collusion. In: Advances in Cryptology\u2014CRYPTO2017. Lecture Notes in Computer Science, vol. 10401, pp. 391\u2013419.","DOI":"10.1007\/978-3-319-63688-7_13"},{"key":"424_CR5","doi-asserted-by":"crossref","unstructured":"Benhamouda F., Krawczyk H., Rabin T.: Robust Non-interactive Multiparty Computation Against Constant-Size Collusion. Cryptology ePrint Archive: Report 2017\/555.","DOI":"10.1007\/978-3-319-63688-7_13"},{"key":"424_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: The 20th Annual ACM Symposium on Theory of Computing (STOC \u201988), pp. 1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"key":"424_CR7","doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e8peau C., Damg\u00e5rd I.: Multiparty unconditionally secure protocols. In: The 20th Annual ACM Symposium on Theory of Computing (STOC \u201988), pp. 11\u201319 (1988).","DOI":"10.1145\/62212.62214"},{"key":"424_CR8","doi-asserted-by":"crossref","unstructured":"Cramer R., Damag\u00e5rd I., Maurer U.: General secure multi-party computation from any linear secret sharing scheme. In: Advances in Cryptology\u2014EUROCRYPT2000. Lecture Notes in Computer Science, vol. 1807, pp. 316\u2013335 (2000).","DOI":"10.1007\/3-540-45539-6_22"},{"key":"424_CR9","doi-asserted-by":"crossref","unstructured":"Data D., Prabhakaran M., Prabhakaran V.: On the communication complexity of secure computation. In: Advances in Cryptology\u2014CRYPTO2014. Lecture Notes in Computer Science, vol. 861, pp. 199\u2013216 (2014).","DOI":"10.1007\/978-3-662-44381-1_12"},{"key":"424_CR10","unstructured":"Goldwasser S., Micali S., Wigderson A.: How to play any mental game, or a completeness theorem for protocols with an honest majority. In: The 19th Annual ACM Symposium on Theory of Computing (STOC \u201987), pp. 218\u2013229 (1987)."},{"issue":"1","key":"424_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt M., Maurer U.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000).","journal-title":"J. Cryptol."},{"key":"424_CR12","doi-asserted-by":"crossref","unstructured":"Hirt M., Tschudi D.: Efficient general-adversary multi-party computation. In: Advances in Cryptology\u2014ASIACRYPT 2013. Part II: Lectures Notes in Computer Science, vol. 8270, pp. 181\u2013200 (2013).","DOI":"10.1007\/978-3-642-42045-0_10"},{"key":"424_CR13","doi-asserted-by":"crossref","unstructured":"Maurer U.: Secure multi-party computation made simple. In: Security in Communication Networks, Third International Conference, SCN 2002. Lecture Notes in Computer Science, vol. 2576, pp. 14\u201328 (2003).","DOI":"10.1007\/3-540-36413-7_2"},{"key":"424_CR14","doi-asserted-by":"crossref","unstructured":"Rabin T., Ben-Or M.: Verifiable secret sharing and multiparty protocols with honest majority. In: The 21st Annual ACM Symposium on Theory of Computing (STOC \u201989), pp. 73\u201385 (1989).","DOI":"10.1145\/73007.73014"},{"key":"424_CR15","doi-asserted-by":"crossref","unstructured":"Yao A.C.: Protocols for secure computations. In: The 23rd Annual Symposium on Foundations of Computer Science (FOCS \u201982), pp. 160\u2013164 (1982).","DOI":"10.1109\/SFCS.1982.38"},{"key":"424_CR16","unstructured":"Yoshida M., Obana S.: On the (in)efficiency of non-interactive secure multiparty computation. In: The 18th Annual International Conference on Information Security and Cryptology, ICISC2015. Lecture Notes in Computer Science, vol. 9558, pp. 185\u2013193 (2016)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0424-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0424-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0424-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,13]],"date-time":"2019-10-13T08:15:54Z","timestamp":1570954554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0424-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,26]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0424-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,3,26]]},"assertion":[{"value":"13 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}