{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:36:17Z","timestamp":1779935777893,"version":"3.53.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T00:00:00Z","timestamp":1474848000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T00:00:00Z","timestamp":1474848000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320994"],"award-info":[{"award-number":["CCF-1320994"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0313160"],"award-info":[{"award-number":["CCR-0313160"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["644058"],"award-info":[{"award-number":["644058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00446-016-0284-9","type":"journal-article","created":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T08:22:46Z","timestamp":1474878166000},"page":"193-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Secure multi-party computation in large networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Varsha","family":"Dani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahnush","family":"Movahedi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahdi","family":"Zamani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,26]]},"reference":[{"key":"284_CR1","volume-title":"Handbook of mathematical functions, with formulas, graphs, and mathematical tables","author":"M Abramowitz","year":"1974","unstructured":"Abramowitz, M.: Handbook of mathematical functions, with formulas, graphs, and mathematical tables. Dover, New York (1974)"},{"key":"284_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks and multi-processor coordination. In: Proceedings of STOC\u201991, pp. 348\u2013358. ACM (1991)","DOI":"10.1145\/103418.103421"},{"key":"284_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An $$0(n\\log {n})$$ sorting network. In: Proceedings of STOC\u201983, pp. 1\u20139. ACM, New York, NY, USA (1983)","DOI":"10.1145\/800061.808726"},{"key":"284_CR4","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive, Report 2011\/136 (2011)"},{"key":"284_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations and advanced topics, 2nd edn. Wiley, London (2004)","edition":"2"},{"key":"284_CR6","doi-asserted-by":"publisher","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) Financial Cryptography and Data Security. 13th International Conference, FC 2009, Accra Beach, Barbados, 23\u201326 Feb 2009. Revised Selected Papers, pp. 325\u2013343. Springer, Berlin, Heidelberg (2009). doi:\n                    10.1007\/978-3-642-03549-4_20","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing. STOC \u201993, pp. 52\u201361. NY, USA, ACM, New York (1993)","DOI":"10.1145\/167088.167109"},{"key":"284_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Advances in Cryptology\u2014CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2015, Proceedings, Part II, chapter Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs, pp. 742\u2013762. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-48000-7_36"},{"issue":"4","key":"284_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","volume":"16","author":"M Ben-Or","year":"2003","unstructured":"Ben-Or, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16(4), 249\u2013262 (2003)","journal-title":"Distrib. Comput."},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Advances in Cryptology\u2014CRYPTO \u201991, volume 576 of Lecture Notes in Computer Science, pp. 420\u2013432. Springer, Berlin (1991)","DOI":"10.1007\/3-540-46766-1_34"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Braud-Santoni, N., Guerraoui, R., Huc, F.: Fast byzantine agreement. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. PODC \u201913, NY, USA, pp. 57\u201364. ACM, New York (2013)","DOI":"10.1145\/2484239.2484243"},{"key":"284_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation: how to run sublinear algorithms in a distributed setting. In: Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography. TCC\u201913, pp. 356\u2013376. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36594-2_21"},{"key":"284_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS \u201912, pp. 309\u2013325. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proceedings of the Twentieth ACM Symposium on the Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"284_CR15","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing. STOC \u201990, pp. 503\u2013513. ACM, New York, NY, USA (1990)","DOI":"10.1145\/100216.100287"},{"key":"284_CR16","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Proceedings of the Advances in Crypotology 13th International Conference on Theory and Application of Cryptology and Information Security. ASIACRYPT\u201907, pp. 376\u2013392. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76900-2_23"},{"key":"284_CR17","unstructured":"Berlekamp, E., Welch, L.: Error correction for algebraic block codes. US Patent 4,633,470, December (1986)"},{"issue":"1","key":"284_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"284_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS \u201901, pp. 136\u2013145 (Oct 2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"284_CR20","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC), pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"284_CR21","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: Optimally resilient and adaptively secure multi-party computation with low communication locality. Cryptology ePrint Archive, Report 2014\/615 (2014)"},{"key":"284_CR22","first-page":"443","volume":"5","author":"B Chor","year":"1989","unstructured":"Chor, B., Dwork, C.: Randomization in byzantine agreement. Adv. Comput. Res. 5, 443\u2013498 (1989)","journal-title":"Adv. Comput. Res."},{"key":"284_CR23","doi-asserted-by":"crossref","unstructured":"Chaum, D., Damg\u00e5rd, I., van de Graaf, J.: Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. CRYPTO \u201987, pp. 87\u2013119. Springer, London (1988)","DOI":"10.1007\/3-540-48184-2_7"},{"key":"284_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Friege, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. Technical report, Cambridge, MA, USA (1996)","DOI":"10.1145\/237814.238015"},{"key":"284_CR25","first-page":"388","volume-title":"Distributed computing. Lecture notes in computer science","author":"A Choudhury","year":"2013","unstructured":"Choudhury, A., Hirt, M., Patra, A.: Asynchronous multiparty computation with linear communication complexity. In: Afek, Y. (ed.) Distributed computing. Lecture notes in computer science, vol. 8205, pp. 388\u2013402. Springer, Berlin (2013)"},{"key":"284_CR26","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01299739","volume":"15","author":"J Cooper","year":"1995","unstructured":"Cooper, J., Linial, N.: Fast perfect-information leader-election protocol with linear immunity. Combinatorica 15, 319\u2013332 (1995)","journal-title":"Combinatorica"},{"key":"284_CR27","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC \u201909. Irvine, pp. 160\u2013179. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"284_CR28","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Advances in Cryptology\u2014CRYPTO, pp. 501\u2013520 (2006)","DOI":"10.1007\/11818175_30"},{"key":"284_CR29","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Advances in Cryptology\u2013CRYPTO \u201908, pp. 241\u2013261 (2008)","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"284_CR30","doi-asserted-by":"crossref","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Brief announcement: breaking the $$o(nm)$$ bit barrier, secure multiparty computation with a static adversary. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. PODC \u201912, pp. 227\u2013228. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2332432.2332473"},{"key":"284_CR31","doi-asserted-by":"publisher","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Quorums quicken queries: efficient asynchronous secure multiparty computation. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) Distributed Computing and Networking. Proceedings of the 15th International Conference, ICDCN 2014, Coimbatore, India, 4\u20137 Jan 2014, pp. 242\u2013256. Springer, Berlin, Heidelberg (2014). doi:\n                    10.1007\/978-3-642-45249-9_16","DOI":"10.1007\/978-3-642-45249-9_16"},{"key":"284_CR32","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Proceedings of the 27th Annual International Cryptology Conference on Advances in Cryptology, pp. 572\u2013590. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"284_CR33","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. STOC \u201986, pp. 370\u2013379. ACM, New York, NY, USA (1986)","DOI":"10.1145\/12130.12169"},{"key":"284_CR34","series-title":"Statistics: a series of textbooks and monographs","volume-title":"Linear least squares computations","author":"RW Farebrother","year":"1988","unstructured":"Farebrother, R.W.: Linear least squares computations. Statistics: a series of textbooks and monographs. Taylor & Francis, London (1988)"},{"key":"284_CR35","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS, pp. 142\u2013153 (1999)"},{"key":"284_CR36","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC \u201909, pp. 169\u2013178. ACM, New York, NY, USA (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"284_CR37","doi-asserted-by":"crossref","unstructured":"Galil, Z., Haber, S., Yung, M.: Cryptographic computation: secure faut-tolerant protocols and the public-key model. In: A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. CRYPTO \u201987, pp. 135\u2013155. Springer, London, UK (1988)","DOI":"10.1007\/3-540-48184-2_10"},{"key":"284_CR38","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. In: Advances in Cryptology\u2014CRYPTO 2013. Volume 8043 of Lecture Notes in Computer Science, pp. 536\u2013553. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"284_CR39","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing. STOC \u201987, pp. 218\u2013229. ACM, New York, NY, USA (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"284_CR40","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"284_CR41","volume-title":"Foundations of cryptography: basic tools","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O.: Foundations of cryptography: basic tools. Cambridge University Press, New York (2000)"},{"key":"284_CR42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: volume 2, basic applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of cryptography: volume 2, basic applications. Cambridge University Press, New York (2004)"},{"key":"284_CR43","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing. PODC \u201998, pp. 101\u2013111. ACM, New York, NY, USA (1998)","DOI":"10.1145\/277697.277716"},{"key":"284_CR44","doi-asserted-by":"crossref","unstructured":"Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Information Security and Cryptology\u2014ICISC 2012. Volume 7839 of Lecture Notes in Computer Science, pp. 202\u2013216. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-37682-5_15"},{"issue":"5","key":"284_CR45","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090\u20132112 (2010)","journal-title":"SIAM J. Comput."},{"key":"284_CR46","doi-asserted-by":"crossref","unstructured":"King, V., Lonargan, S., Saia, J., Trehan, A.: Load balanced scalable byzantine agreement through quorum building with full information. In: Distributed Computing and Networking. Volume 6522 of Lecture Notes in Computer Science, pp. 203\u2013214. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-17679-1_18"},{"key":"284_CR47","unstructured":"Klugerman, M.R.: Small-depth counting networks and related topics. PhD thesis, Cambridge, MA, USA. Not available from Univ. Microfilms Int (1995)"},{"key":"284_CR48","doi-asserted-by":"crossref","unstructured":"Klugerman, M., Plaxton, C.G.: Small-depth counting networks. In: Proceedings of STOC\u201992, pp. 417\u2013428 (1992)","DOI":"10.1145\/129712.129752"},{"key":"284_CR49","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. SODA \u201906, pp. 990\u2013999. Philadelphia, PA, USA (2006)","DOI":"10.1145\/1109557.1109667"},{"key":"284_CR50","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. FOCS \u201906, pp. 87\u201398. IEEE Computer Society, Washington, DC, USA (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"284_CR51","doi-asserted-by":"crossref","unstructured":"Movahedi, M., Saia, J., Zamani, M.: Scalable multi-party shuffling. In: International Colloquium on Structural Information and Communication Complexity (SIROCCO: Lecture Notes in Computer Science. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-25258-2_32"},{"key":"284_CR52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: randomized algorithms and probabilistic analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, New York (2005)"},{"key":"284_CR53","doi-asserted-by":"crossref","unstructured":"Prabhu, B., Srinathan, K., Rangan, C.P.: Asynchronous unconditionally secure computation: an efficiency improvement. In: INDOCRYPT 2002, Lecture Notes in Computer Science, vol. 2551, pp. 93\u2013107. Springer (2002)","DOI":"10.1007\/3-540-36231-2_9"},{"issue":"2","key":"284_CR54","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"Reed, I., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Indus. Appl. Math. (SIAM) 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Indus. Appl. Math. (SIAM)"},{"issue":"11","key":"284_CR55","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":"284_CR56","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Efficient asynchronous secure multiparty distributed computation. In: INDOCRYPT 2000, Lecture Notes in Computer Science, Volume 1977, pp. 117\u2013129. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44495-5_11"},{"key":"284_CR57","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. SFCS \u201982, pp. 160\u2013164. IEEE Computer Society, Washington, DC, USA (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0284-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T14:57:54Z","timestamp":1589641074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0284-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,26]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0284-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,26]]},"assertion":[{"value":"18 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}