{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:53:25Z","timestamp":1778216005483,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"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":[[2017,7]]},"DOI":"10.1007\/s00145-016-9236-6","type":"journal-article","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T20:06:24Z","timestamp":1474661184000},"page":"805-858","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["More Efficient Oblivious Transfer Extensions"],"prefix":"10.1007","volume":"30","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zohner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,23]]},"reference":[{"key":"9236_CR1","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries, in Journal of Cryptology, vol. 23(2), (Springer, 2010) pp. 281\u2013343","DOI":"10.1007\/s00145-009-9040-7"},{"key":"9236_CR2","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Schneider, M. Zohner. More efficient oblivious transfer and extensions for faster secure computation, in ACM Computer and Communications Security (CCS\u201913), pp. 535\u2013548. ACM, 2013. Code: \n                    http:\/\/encrypto.de\/code\/OTExtension","DOI":"10.1145\/2508859.2516738"},{"key":"9236_CR3","doi-asserted-by":"crossref","unstructured":"G. Asharov, Y. Lindell, T. Schneider, M. Zohner. More efficient oblivious transfer extensions with security for malicious adversaries, in Advances in Cryptology\u2014EUROCRYPT\u201915, vol. 9056 of LNCS, (Springer, 2015) pp. 673\u2013701. Full version: \n                    http:\/\/eprint.iacr.org\/2015\/061","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"9236_CR4","doi-asserted-by":"crossref","unstructured":"J. Bringer, H. Chabanne, A. Patey. SHADE: secure hamming distance computation from oblivious transfer, in Financial Cryptography and Data Security (FC\u201913), vol. 7862 of LNCS, (Springer, 2013), pp. 164\u2013176","DOI":"10.1007\/978-3-642-41320-9_11"},{"key":"9236_CR5","doi-asserted-by":"crossref","unstructured":"D. Beaver. Efficient multiparty protocols using circuit randomization, in Advances in cryptology\u2014-CRYPTO\u201991, vol. 576 of LNCS, (Springer, 1991), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9236_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver. Correlated pseudorandomness and the complexity of private computations, in Symposium on the theory of computing (STOC\u201996), (ACM, 1996), pp. 479\u2013488","DOI":"10.1145\/237814.237996"},{"key":"9236_CR7","doi-asserted-by":"crossref","unstructured":"M. Bellare, V. Hoang, S. Keelveedhi, P. Rogaway. Efficient garbling from a fixed-key blockcipher, on IEEE Symposium on Security and Privacy (S&P\u201913), (IEEE, 2013), pp. 478\u2013492","DOI":"10.1109\/SP.2013.39"},{"key":"9236_CR8","unstructured":"S. S. Burra, E. Larraia, J. B. Nielsen, P. S. Nordholt, C. Orlandi, E. Orsini, P. Scholl, and N. P. Smart. High performance multi-party computation for binary circuits based on oblivious transfer. Cryptology ePrint Archive, Report 2015\/472, 2015. Online: \n                    http:\/\/eprint.iacr.org\/2015\/472\n                    \n                  ."},{"key":"9236_CR9","doi-asserted-by":"crossref","unstructured":"A. Ben-David, N. Nisan, B. Pinkas. FairplayMP: a system for secure multi-party computation, in ACM Computer and Communications Security (CCS\u201908), (ACM, 2008) pp. 257\u2013266","DOI":"10.1145\/1455770.1455804"},{"issue":"1","key":"9236_CR10","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. Cryptology, 13(1):143\u2013202, 2000.","journal-title":"J. Cryptology"},{"key":"9236_CR11","doi-asserted-by":"crossref","unstructured":"S.G. Choi, K.-W. Hwang, J. Katz, T. Malkin, D. Rubenstein. Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces, in Cryptographers\u2019 Track at the RSA Conference (CT-RSA\u201912), vol. 7178 of LNCS, (Springer, 2012) pp. 416\u2013432","DOI":"10.1007\/978-3-642-27954-6_26"},{"key":"9236_CR12","doi-asserted-by":"crossref","unstructured":"T. Chou, C. Orlandi. The simplest protocol for oblivious transfer, in Progress in Cryptology\u2014LATINCRYPT\u201915, vol. 9230 of LNCS, (Springer, 2015), pp. 40\u201358","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"9236_CR13","doi-asserted-by":"crossref","unstructured":"C. Dong, L. Chen, Z. Wen. When private set intersection meets big data: an efficient and scalable protocol, in ACM Computer and Communications Security (CCS\u201913), (ACM, 2013), pp. 789\u2013800","DOI":"10.1145\/2508859.2516701"},{"key":"9236_CR14","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, R. Lauritsen, T. Toft. An empirical study and some improvements of the MiniMac protocol for secure computation, in Security and Cryptography for Networks (SCN\u201914), vol. 8642 of LNCS, (Springer, 2014), pp. 398\u2013415","DOI":"10.1007\/978-3-319-10879-7_23"},{"key":"9236_CR15","doi-asserted-by":"crossref","unstructured":"D. Demmler, T. Schneider, M. Zohner. ABY\u2014a framework for efficient mixed-protocol secure two-party computation, in Network and Distributed System Security (NDSS\u201915). The Internet Society, 2015","DOI":"10.14722\/ndss.2015.23113"},{"key":"9236_CR16","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, S. Zakarias. Constant-overhead secure computation of Boolean circuits using preprocessing, in Theory of cryptography conference (TCC\u201913), vol. 7785 of LNCS, (Springer, 2013), pp. 621\u2013641","DOI":"10.1007\/978-3-642-36594-2_35"},{"key":"9236_CR17","doi-asserted-by":"crossref","unstructured":"Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, T. Toft. Privacy-preserving face recognition, in Privacy Enhancing Technologies Symposium (PETS\u201909), vol. 5672 of LNCS, (Springer, 2009), pp. 235\u2013253","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"9236_CR18","unstructured":"Y. Ejgenberg, M. Farbstein, M. Levy, Y. Lindell. SCAPI: the secure computation application programming interface. Cryptology ePrint Archive, Report 2012\/629, 2012. Online: \n                    http:\/\/eprint.iacr.org\/2012\/629"},{"key":"9236_CR19","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, A. Lempel. A randomized protocol for signing contracts, in Communications of the ACM, vol. 28(6), (ACM, 1985), pp. 637\u2013647","DOI":"10.1145\/3812.3818"},{"key":"9236_CR20","doi-asserted-by":"crossref","unstructured":"J.O. Eklundh. A fast computer method for matrix transposing, in IEEE Transactions on Computers, vol. C-21(7), (IEEE, 1972), pp. 801\u2013803","DOI":"10.1109\/T-C.1972.223584"},{"key":"9236_CR21","doi-asserted-by":"crossref","unstructured":"K. Frikken, M. Atallah, C. Zhang. Privacy-preserving credit checking, in Electronic Commerce (EC\u201905), (ACM, 2005), pp. 147\u2013154","DOI":"10.1145\/1064009.1064025"},{"key":"9236_CR22","doi-asserted-by":"crossref","unstructured":"T.K. Frederiksen, M. Keller, E. Orsini, P. Scholl. A unified approach to MPC with preprocessing using OT, in Advances in Cryptology\u2014ASIACRYPT\u201915, vol. 9452 of LNCS, (Springer, 2015), pp. 711\u2013735","DOI":"10.1007\/978-3-662-48797-6_29"},{"key":"9236_CR23","doi-asserted-by":"crossref","unstructured":"T. K. Frederiksen, J. B. Nielsen. Fast and maliciously secure two-party computation using the GPU, in Applied Cryptography and Network Security (ACNS\u201913), vol. 7954 of LNCS, (Springer, 2013), pp. 339\u2013356","DOI":"10.1007\/978-3-642-38980-1_21"},{"key":"9236_CR24","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, J. Katz, V. Kolesnikov, F. Krell, T. Malkin, M. Raykova, Y. Vahlis. Secure two-party computation in sublinear (amortized) time, in ACM Computer and Communications Security (CCS\u201912), (ACM, 2012), pp. 513\u2013524","DOI":"10.1145\/2382196.2382251"},{"key":"9236_CR25","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority, in Symposium on Theory of Computing (STOC\u201987), (ACM, 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9236_CR26","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, 2004","DOI":"10.1017\/CBO9780511721656"},{"key":"9236_CR27","unstructured":"Y. Huang, P. Chapman, D. Evans. Privacy-preserving applications on smartphones, in Hot topics in security (HotSec\u201911). USENIX, 2011"},{"key":"9236_CR28","unstructured":"Y. Huang, D. Evans, J. Katz. Private set intersection: Are garbled circuits better than custom protocols? in Network and Distributed System Security (NDSS\u201912). The Internet Society, 2012"},{"key":"9236_CR29","unstructured":"Y. Huang, D. Evans, J. Katz, L. Malka. Faster secure two-party computation using garbled circuits, in USENIX Security\u201911, (USENIX, 2011), pp. 539\u2013554"},{"key":"9236_CR30","doi-asserted-by":"crossref","unstructured":"A. Holzer, M. Franz, S. Katzenbeisser, H. Veith. Secure two-party computations in ANSI C, in ACM Computer and Communications Security (CCS\u201912), (ACM, 2012) pp. 772\u2013783","DOI":"10.1145\/2382196.2382278"},{"key":"9236_CR31","doi-asserted-by":"crossref","unstructured":"D. Harnik, Y. Ishai, E. Kushilevitz, J. Buus Nielsen. OT-combiners via secure computation, in Theory of Cryptography Conference (TCC\u201908), vol. 4948 of LNCS, (Springer, 2008), pp. 393\u2013411","DOI":"10.1007\/978-3-540-78524-8_22"},{"key":"9236_CR32","doi-asserted-by":"crossref","unstructured":"W. Henecka, S. K\u00f6gl, A.-R. Sadeghi, T. Schneider, I. Wehrenberg. TASTY: Tool for Automating Secure Two-partY computations, in ACM Computer and Communications Security (CCS\u201910), (ACM, 2010), pp. 451\u2013462","DOI":"10.1145\/1866307.1866358"},{"key":"9236_CR33","unstructured":"Y. Huang, L. Malka, D. Evans, J. Katz. Efficient privacy-preserving biometric identification, in Network and Distributed Security Symposium (NDSS\u201911). The Internet Society, 2011"},{"key":"9236_CR34","doi-asserted-by":"crossref","unstructured":"W. Henecka, T. Schneider. Faster secure two-party computation with less memory, in ACM Symposium on Information, Computer and Communications Security (ASIACCS\u201913), (ACM, 2013), pp. 437\u2013446","DOI":"10.1145\/2484313.2484369"},{"key":"9236_CR35","doi-asserted-by":"crossref","unstructured":"Y. Ishai, J. Kilian, K. Nissim, E. Petrank. Extending oblivious transfers efficiently, in Advances in Cryptology\u2014CRYPTO\u201903, vol. 2729 of LNCS, (Springer, 2003), pp. 145\u2013161","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"9236_CR36","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai. Cryptography with constant computational overhead, in ACM Symposium on Theory of Computing (STOC\u201908), (ACM, 2008), pp. 433\u2013442","DOI":"10.1145\/1374376.1374438"},{"key":"9236_CR37","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, and A. Sahai. Founding cryptography on oblivious transfer - efficiently, in Advances in Cryptology\u2014CRYPTO\u201908, vol. 5157 of LNCS, (Springer, 2008), pp. 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9236_CR38","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, S. Rudich. Limits on the provable consequences of one-way permutations, in Advances in Cryptology\u2014CRYPTO\u201988, vol. 403 of LNCS, (Springer, 1988), pp. 8\u201326","DOI":"10.1007\/0-387-34799-2_2"},{"key":"9236_CR39","doi-asserted-by":"crossref","unstructured":"F. Kerschbaum. Automatically optimizing secure computation, in ACM Computer and Communications Security (CCS\u201911), (ACM, 2011), pp. 703\u2013714","DOI":"10.1145\/2046707.2046786"},{"key":"9236_CR40","doi-asserted-by":"crossref","unstructured":"V. Kolesnikov, R. Kumaresan. Improved OT extension for transferring short secrets, in Advances in Cryptology\u2014CRYPTO\u201913, vol. 8043 of LNCS, (Springer, 2013) pp. 54\u201370","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"9236_CR41","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, P. Scholl. Actively secure OT extension with optimal overhead, in Advances in Cryptology\u2014CRYPTO\u201915, vol. 9215 of LNCS, (Springer, 2015), pp. 724\u2013741","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"9236_CR42","doi-asserted-by":"crossref","unstructured":"V. Kolesnikov, T. Schneider. Improved garbled circuit: free XOR gates and applications, in International Colloquium on Automata, Languages and Programming (ICALP\u201908), vol. 5126 of LNCS, (Springer, 2008), pp. 486\u2013498","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"9236_CR43","unstructured":"B. Kreuter, A. Shelat, C. Shen. Billion-gate secure computation with malicious adversaries, in USENIX Security\u201912, (USENIX, 2012), pp. 285\u2013300"},{"key":"9236_CR44","doi-asserted-by":"crossref","unstructured":"M. Keller, P. Scholl, N.P. Smart. An architecture for practical actively secure MPC with dishonest majority, in ACM Computer and Communications Security (CCS\u201913), (ACM, 2013), pp. 549\u2013560","DOI":"10.1145\/2508859.2516744"},{"key":"9236_CR45","doi-asserted-by":"crossref","unstructured":"E. Larraia. Extending oblivious transfer efficiently, or - how to get active security with constant cryptographic overhead, in Progress in Cryptology\u2013 LATINCRYPT\u201914, vol. 8895 of LNCS, (Springer, 2014), pp. 368\u2013386","DOI":"10.1007\/978-3-319-16295-9_20"},{"key":"9236_CR46","doi-asserted-by":"crossref","unstructured":"E. Larraia, E. Orsini, N.P. Smart. Dishonest majority multi-party computation for binary circuits, in Advances in Cryptology\u2014CRYPTO\u201914, vol. 8617 of LNCS, (Springer, 2014), pp. 495\u2013512","DOI":"10.1007\/978-3-662-44381-1_28"},{"key":"9236_CR47","unstructured":"L. Lov\u00e1sz, M.D. Plummer. Matching Theory. Akad\u00e9miai Kiad\u00f3, Budapest, 1986. Also published as vol. 121 of the North-Holland Mathematics Studies, North-Holland Publishing, Amsterdam"},{"key":"9236_CR48","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Pinkas. Secure two-party computation via cut-and-choose oblivious transfer, in Theory of Cryptography Conference (TCC\u201911), vol. 6597 of LNCS, (Springer, 2011), pp. 329\u2013346","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"9236_CR49","doi-asserted-by":"crossref","unstructured":"Y. Lindell, B. Riva. Blazing fast 2pc in the offline\/online setting with security for malicious adversaries, in ACM Computer and Communications Security (CCS\u201915), (ACM, 2015), pp. 579\u2013590","DOI":"10.1145\/2810103.2813666"},{"key":"9236_CR50","doi-asserted-by":"crossref","unstructured":"Y. Lindell, H. Zarosim. On the feasibility of extending oblivious transfer, in Theory of Cryptography Conference (TCC\u201913), vol. 7785 of LNCS, (Springer, 2013), pp. 519\u2013538","DOI":"10.1007\/978-3-642-36594-2_29"},{"key":"9236_CR51","doi-asserted-by":"crossref","unstructured":"L. Malka. VMCrypt\u2014modular software architecture for scalable secure computation, in ACM Computer and Communications Security (CCS\u201911), (ACM, 2011), pp. 715\u2013724","DOI":"10.1145\/2046707.2046787"},{"key":"9236_CR52","unstructured":"D. Malkhi, N. Nisan, B. Pinkas, Y. Sella. Fairplay\u2014a secure two-party computation system, in USENIX Security\u201904, (USENIX, 2004), pp. 287\u2013302"},{"key":"9236_CR53","doi-asserted-by":"crossref","unstructured":"P. MacKenzie, A. Oprea, M.K. Reiter. Automatic generation of two-party computations, in ACM Computer and Communications Security (CCS\u201903), (ACM, 2003), pp. 210\u2013219","DOI":"10.1145\/948109.948139"},{"key":"9236_CR54","unstructured":"J.B. Nielsen. Extending oblivious transfers efficiently\u2014how to get robustness almost for free. Cryptology ePrint Archive, Report 2007\/215, 2007. Online: \n                    http:\/\/eprint.iacr.org\/2007\/215"},{"key":"9236_CR55","unstructured":"NIST. NIST Special Publication 800-57, Recommendation for Key Management Part 1: General (Rev. 3). Technical report, NIST, 2012"},{"key":"9236_CR56","doi-asserted-by":"crossref","unstructured":"J. B. Nielsen, P.S. Nordholt, C. Orlandi, S.S. Burra. A new approach to practical active-secure two-party computation. In Advances in Cryptology \u2013 CRYPTO\u201912, vol. 7417 of LNCS, (Springer, 2012), pp. 681\u2013700","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"9236_CR57","unstructured":"M. Naor, B. Pinkas. Efficient oblivious transfer protocols, in Symposium on Discrete Algorithms (SODA\u201901), (ACM\/SIAM, 2001), pp. 448\u2013457"},{"key":"9236_CR58","doi-asserted-by":"crossref","unstructured":"V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, N. Taft. Privacy-preserving ridge regression on hundreds of millions of records, in IEEE Symposium on Security and Privacy (S&P\u201913), (IEEE, 2013), pp. 334\u2013348","DOI":"10.1109\/SP.2013.30"},{"key":"9236_CR59","unstructured":"B. Pinkas, T. Schneider, G. Segev, M. Zohner. Phasing: Private set intersection using permutation-based hashing, in USENIX Security\u201915, (USENIX, 2015), pp. 515\u2013530"},{"key":"9236_CR60","unstructured":"B. Pinkas, T. Schneider, M. Zohner. Faster private set intersection based on ot extension, in USENIX Security\u201914, (USENIX, 2014), pp. 797\u2013812"},{"key":"9236_CR61","doi-asserted-by":"crossref","unstructured":"C. Peikert, V. Vaikuntanathan, B. Waters. A framework for efficient and composable oblivious transfer, in Advances in Cryptology\u2014CRYPTO\u201908, vol. 5157 of LNCS, (Springer, 2008) pp. 554\u2013571","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"9236_CR62","unstructured":"M.O. Rabin. How to exchange secrets with oblivious transfer, TR-81 edition, 1981. Aiken Computation Lab, Harvard University."},{"key":"9236_CR63","doi-asserted-by":"crossref","unstructured":"A. Schr\u00f6pfer, F. Kerschbaum. Demo: secure computation in JavaScript, in ACM Computer and Communications Security (CCS\u201911), (ACM, 2011), pp. 849\u2013852","DOI":"10.1145\/2046707.2093509"},{"key":"9236_CR64","doi-asserted-by":"crossref","unstructured":"T. Schneider, M. Zohner. GMW vs. Yao? Efficient secure two-party computation with low depth circuits, in Financial Cryptography and Data Security (FC\u201913), vol. 7859 of LNCS, (Springer, 2013), pp. 275\u2013292","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"9236_CR65","doi-asserted-by":"crossref","unstructured":"A.C. Yao. How to generate and exchange secrets, in Foundations of Computer Science (FOCS\u201986), (IEEE, 1986), pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-016-9236-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9236-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9236-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:17:55Z","timestamp":1586333875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-016-9236-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,23]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9236"],"URL":"https:\/\/doi.org\/10.1007\/s00145-016-9236-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,23]]},"assertion":[{"value":"19 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2016","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"}]}}