{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:16:41Z","timestamp":1781259401670,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s00145-010-9056-z","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T19:31:18Z","timestamp":1265311878000},"page":"580-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["On d-Multiplicative Secret Sharing"],"prefix":"10.1007","volume":"23","author":[{"given":"Omer","family":"Barkol","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"issue":"2","key":"9056_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B. Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Computationally private randomizing polynomials and their applications. Comput. Complex.\n                           15(2), 115\u2013162 (2006). Earlier version in Proc. CCC \u201905","journal-title":"Comput. Complex."},{"issue":"1","key":"9056_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/S0097539700375944","volume":"33","author":"L. Babai","year":"2003","unstructured":"L. Babai, A. G\u00e1l, P.G. Kimmel, S.V. Lokam, Communication complexity of simultaneous messages. SIAM J. Comput.\n                           33(1), 137\u2013166 (2003). Earlier version in Proc. STACS \u201995","journal-title":"SIAM J. Comput."},{"key":"9056_CR3","unstructured":"O. Barkol, Y. Ishai, Secure computation of constant-depth circuits with applications to database search problems, in Proc. CRYPTO \u201905 (2005), pp.\u00a0395\u2013411"},{"key":"9056_CR4","unstructured":"O. Barkol, Y. Ishai, E. Weinreb, Communication in the presence of replication, in Proc. 40th STOC (2008), pp.\u00a0661\u2013670"},{"key":"9056_CR5","unstructured":"D. Beaver, A. Wool, Quorum-based secure multi-party computation, in Proc. EUROCRYPT \u201998 (1998), pp.\u00a0375\u2013390"},{"key":"9056_CR6","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proc. 20th STOC (1988), pp.\u00a01\u201310"},{"key":"9056_CR7","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, in Proc. of the American Federation of Information Processing Societies (AFIPS), vol.\u00a048 (1979), pp.\u00a0313\u2013317"},{"issue":"1","key":"9056_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J.\u00a0Cryptol.\n                           13(1), 143\u2013202 (2000)","journal-title":"J.\u00a0Cryptol."},{"key":"9056_CR9","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols, in Proc. 20th STOC (1988), pp.\u00a011\u201319"},{"key":"9056_CR10","unstructured":"H. Chen, R. Cramer, Algebraic geometric secret sharing schemes and secure multi-party computations over small fields, in CRYPTO (2006), pp.\u00a0521\u2013536"},{"key":"9056_CR11","unstructured":"H. Chen, R. Cramer, S. Goldwasser, R. de Haan, V. Vaikuntanathan, Secure computation from random error correcting codes, in EUROCRYPT (2007), pp.\u00a0291\u2013310"},{"issue":"1","key":"9056_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"B. Chor, E. Kushilevitz, A zero-one law for boolean privacy. SIAM J. Discrete Math.\n                           4(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9056_CR13","unstructured":"R. Cramer, I. Damg\u00e5rd, U. Maurer, General secure multi-party computation from any linear secret-sharing scheme, in Proc. EUROCRYPT \u201900 (2000), pp.\u00a0316\u2013335"},{"key":"9056_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Vol.\u00a02, Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography: Vol.\u00a02, Basic Applications (Cambridge University Press, New York, 2004)"},{"key":"9056_CR15","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in Proc. 19th STOC (1987), pp.\u00a0218\u2013229"},{"key":"9056_CR16","unstructured":"D. Harnik, Y. Ishai, E. Kushilevitz, J.B. Nielsen, Ot-combiners via secure computation, in TCC (2008), pp.\u00a0393\u2013411"},{"issue":"1","key":"9056_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"M. Hirt, U. Maurer, Player simulation and general adversary structures in perfect multiparty computation. J.\u00a0Cryptol.\n                           13(1), 31\u201360 (2000). Earlier version in Proc. PODC \u201997","journal-title":"J.\u00a0Cryptol."},{"key":"9056_CR18","unstructured":"Y. Ishai, E. Kushilevitz, Randomizing polynomials: A\u00a0new representation with applications to round-efficient secure computation, in Proc. 41st FOCS (2000), pp.\u00a0294\u2013304"},{"key":"9056_CR19","unstructured":"Y. Ishai, E. Kushilevitz, Perfect constant-round secure computation via perfect randomizing polynomials, in Proc. 29th ICALP (2002), pp.\u00a0244\u2013256"},{"key":"9056_CR20","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in STOC (2007), pp.\u00a021\u201330"},{"key":"9056_CR21","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer\u2014efficiently, in CRYPTO (2008), pp.\u00a0572\u2013591"},{"issue":"1","key":"9056_CR22","first-page":"99","volume":"6","author":"M. Ito","year":"1987","unstructured":"M. Ito, A. Saito, T. Nishizeki, Secret sharing schemes realizing general access structure, in Proc. of the IEEE Global Telecommunication Conf., Globecom 87 (1987), pp.\u00a099\u2013102. Journal version: Multiple assignment scheme for sharing secret. J.\u00a0Cryptol.\n                           6(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"issue":"2","key":"9056_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"E. Kushilevitz, Privacy and communication complexity. SIAM J. Discrete Math.\n                           5(2), 273\u2013284 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9056_CR24","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U.M. Maurer","year":"2006","unstructured":"U.M. Maurer, Secure multi-party computation made simple. Discrete Appl. Math.\n                           154(2), 370\u2013381 (2006). Earlier version in Proc. SCN \u201902","journal-title":"Discrete Appl. Math."},{"key":"9056_CR25","unstructured":"I.C. Pueyo, H. Chen, R. Cramer, C. Xing, Asymptotically good ideal linear secret sharing with strong multiplication over ny fixed finite field, in CRYPTO (2009), pp.\u00a0466\u2013486"},{"issue":"4","key":"9056_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"A. Razborov","year":"1987","unstructured":"A. Razborov, Lower bounds for the size of circuits of bounded depth with basis (AND, XOR). Math. Notes Acad. Sci. USSR\n                           41(4), 333\u2013338 (1987)","journal-title":"Math. Notes Acad. Sci. USSR"},{"issue":"11","key":"9056_CR27","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM\n                           22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9056_CR28","unstructured":"R. Smolensky, Algebraic methods in the theory of lower bounds for boolean circuit complexity, in STOC (1987), pp.\u00a077\u201382"},{"issue":"4","key":"9056_CR29","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1137\/06065773X","volume":"37","author":"D.P. Woodruff","year":"2007","unstructured":"D.P. Woodruff, S. Yekhanin, A geometric approach to information-theoretic private information retrieval. SIAM J. Comput.\n                           37(4), 1046\u20131056 (2007). Earlier version in Proc. CCC \u201905","journal-title":"SIAM J. Comput."},{"key":"9056_CR30","unstructured":"Z. Zhang, M. Liu, Y.M. Chee, S. Ling, H. Wang, Strongly multiplicative and 3-multiplicative linear secret sharing schemes, in ASIACRYPT (2008), pp.\u00a019\u201336"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9056-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9056-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9056-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9056-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:44:33Z","timestamp":1586335473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9056-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9056"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9056-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]},"assertion":[{"value":"22 October 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2009","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}