{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:01:15Z","timestamp":1790499675356,"version":"4.1.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T00:00:00Z","timestamp":1275004800000},"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-9068-8","type":"journal-article","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T22:50:09Z","timestamp":1274914209000},"page":"594-671","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Long-Term Security and Universal Composability"],"prefix":"10.1007","volume":"23","author":[{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,28]]},"reference":[{"key":"9068_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1103576.1103579","volume-title":"Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering","author":"M. Backes","year":"2005","unstructured":"M. Backes, D. Hofheinz, J. M\u00fcller-Quade, D. Unruh, On fairness in simulatability-based cryptographic systems, in Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering (ACM, New York, 2005), pp. 13\u201322. Full version online available at \n                    http:\/\/eprint.iacr.org\/2005\/294\n                    \n                  . The definition of nontrivial protocols is only contained in the full version"},{"key":"9068_CR2","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, The reactive simulatability (RSIM) framework for asynchronous systems. Inform. Comput. (2007). Preliminary version available at \n                    http:\/\/eprint.iacr.org\/2004\/082"},{"key":"9068_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/FOCS.2004.71","volume-title":"45th Symposium on Foundations of Computer Science","author":"B. Barak","year":"2004","unstructured":"B. Barak, R. Canetti, J.B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in 45th Symposium on Foundations of Computer Science. Proceedings of FOCS 2004, Rome, Italy, 17\u201319 October 2004 (IEEE Computer Society, Los Alamitos, 2004), pp. 186\u2013195"},{"issue":"2","key":"9068_CR4","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"D. Boneh, Twenty years of attacks on the RSA cryptosystem. Not. Am. Math. Soc. (AMS)\n                           46(2), 203\u2013213 (1999). Online available at \n                    http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/RSAattack-survey.html","journal-title":"Not. Am. Math. Soc. (AMS)"},{"key":"9068_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\n                           37, 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9068_CR6","unstructured":"G. Brassard, C. Cr\u00e9peau, D. Mayers, L. Salvail, Defeating classical bit commitments with a quantum computer. Los Alamos preprint \n                    arXiv:quant-ph\/9806031\n                    \n                  , May 1999"},{"key":"9068_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology","author":"C. Cachin","year":"1997","unstructured":"C. Cachin, U. Maurer, Unconditional security against memory-bounded adversaries, in Advances in Cryptology, ed. by B.S. Kaliski Jr. Proceedings of CRYPTO \u201997. LNCS, vol. 1294 (Springer, Berlin, 1997), pp. 292\u2013306"},{"key":"9068_CR8","first-page":"493","volume-title":"34th Annual ACM Symposium on Theory of Computing","author":"C. Cachin","year":"2002","unstructured":"C. Cachin, C. Cr\u00e9peau, J. Marcil, Oblivious transfer with a memory-bounded receiver, in 34th Annual ACM Symposium on Theory of Computing. Proceedings of STOC 2002 (ACM, New York, 2002), pp. 493\u2013502"},{"key":"9068_CR9","series-title":"LNCS","first-page":"268","volume-title":"Proc. 3rd International Conference on Security in Communication Networks (SCN)","author":"J. Camenisch","year":"2002","unstructured":"J. Camenisch, A. Lysyanskaya, A signature scheme with efficient protocols, in Proc. 3rd International Conference on Security in Communication Networks (SCN). LNCS, vol. 2576 (Springer, Berlin, 2002), pp. 268\u2013289"},{"issue":"1","key":"9068_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.\u00a0Cryptol.\n                           13(1), 143\u2013202 (2000)","journal-title":"J.\u00a0Cryptol."},{"key":"9068_CR11","first-page":"136","volume-title":"42th Annual Symposium on Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42th Annual Symposium on Foundations of Computer Science. Proceedings of FOCS 2001 (IEEE Computer Society, Los Alamitos, 2001), pp. 136\u2013145. Full and revised version is online available at \n                    http:\/\/eprint.iacr.org\/2000\/067"},{"key":"9068_CR12","series-title":"LNCS","first-page":"19","volume-title":"Advances in Cryptology","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Advances in Cryptology, ed. by J. Kilian. Proceedings of CRYPTO \u201901. LNCS, vol. 2139 (Springer, Berlin, 2001), pp. 19\u201340. Full version online available at \n                    http:\/\/eprint.iacr.org\/2001\/055"},{"key":"9068_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, H. Krawczyk, Analysis of key-exchange protocols and their use for building secure channels, in Advances in Cryptology\u2014EUROCRYPT 2001, ed. by B. Pfitzmann. LNCS, vol. 2045 (Springer, Berlin, 2001), pp. 453\u2013474"},{"key":"9068_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology: CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, T. Rabin, Universal composition with joint state, in Advances in Cryptology: CRYPTO 2003. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 265\u2013281"},{"key":"9068_CR15","first-page":"494","volume-title":"34th Annual ACM Symposium on Theory of Computing","author":"R. Canetti","year":"2002","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in 34th Annual ACM Symposium on Theory of Computing. Proceedings of STOC 2002 (ACM, New York, 2002), pp. 494\u2013503. Extended abstract, full version online available at \n                    http:\/\/eprint.iacr.org\/2002\/140"},{"key":"9068_CR16","series-title":"LNCS","first-page":"68","volume-title":"Advances in Cryptology","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions, in Advances in Cryptology, ed. by E. Biham. Proceedings of EUROCRYPT \u201903. LNCS, vol. 2656 (Springer, Berlin, 2003), pp. 68\u201386. Full version online available at \n                    http:\/\/eprint.iacr.org\/2004\/116"},{"key":"9068_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with global setup, in Theory of Cryptography. Proceedings of TCC 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 61\u201385"},{"key":"9068_CR18","series-title":"LNCS","first-page":"581","volume-title":"Advances in Cryptology","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in Advances in Cryptology, ed. by Y. Moti. Proceedings of CRYPTO \u201902. LNCS, vol. 2442 (Springer, Berlin, 2002), pp. 581\u2013596. Full version online available at \n                    http:\/\/eprint.iacr.org\/2001\/091"},{"key":"9068_CR19","unstructured":"I.B. Damg\u00e5rd, S. Fehr, L. Salvail, C. Schaffner, Cryptography in the bounded quantum-storage model, in Proceedings of FOCS 2005 (2005), pp.\u00a0449\u2013458. A full version is available at \n                    http:\/\/arxiv.org\/abs\/quant-ph\/0508222"},{"issue":"2","key":"9068_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00124891","volume":"2","author":"W. Diffie","year":"1992","unstructured":"W. Diffie, P.C. van Oorschot, M.J. Wiener, Authentication and authenticated key exchanges. Des. Codes Cryptogr.\n                           2(2), 107\u2013125 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"9068_CR21","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1145\/103418.103474","volume-title":"Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing","author":"D. Dolev","year":"1991","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography (extended abstract), in Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing (ACM, New York, 1991), pp. 542\u2013552"},{"key":"9068_CR22","series-title":"LNCS","first-page":"126","volume-title":"Advances in Cryptology","author":"S. Dziembowski","year":"2004","unstructured":"S. Dziembowski, U. Maurer, On generating the initial key in the bounded-storage model, in Advances in Cryptology, ed. by C. Cachin, J. Camenisch. Proceedings of EUROCRYPT \u201904. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 126\u2013137"},{"key":"9068_CR23","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/100216.100272","volume-title":"Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing","author":"U. Feige","year":"1990","unstructured":"U. Feige, A. Shamir, Witness indistinguishable and witness hiding protocols, in Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (ACM, New York, 1990), pp. 416\u2013426"},{"issue":"1","key":"9068_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple non-interactive zero knowledge proofs under general assumptions. SIAM J.\u00a0Comput.\n                           29(1), 1\u201328 (1999)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9068_CR25","unstructured":"Gesetz \u00fcber Rahmenbedingungen f\u00fcr elektronische Signaturen. Bundesgesetzblatt I 2001, 876, May 2001. Online available at \n                    http:\/\/bundesrecht.juris.de\/sigg_2001\/index.html"},{"key":"9068_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography\u2014Volume 2 (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography\u2014Volume 2 (Basic Applications) (Cambridge University Press, Cambridge, 2004). Preliminary version online available at \n                    http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html"},{"issue":"1","key":"9068_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput.\n                           25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9068_CR28","first-page":"792","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J.\u00a0ACM\n                           33(4), 792\u2013807 (1986)","journal-title":"J.\u00a0ACM"},{"key":"9068_CR29","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Nineteenth Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game\u2014a completeness theorem for protocols with honest majority, in Nineteenth Annual ACM Symposium on Theory of Computing. Proceedings of STOC 1987 (ACM, New York, 1987), pp. 218\u2013229. Extended abstract"},{"issue":"3","key":"9068_CR30","first-page":"690","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J.\u00a0ACM\n                           38(3), 690\u2013728 (1991). Online available at \n                    http:\/\/www.wisdom.weizmann.ac.il\/~oded\/X\/gmw1j.pdf","journal-title":"J.\u00a0ACM"},{"issue":"2","key":"9068_CR31","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J.\u00a0Comput.\n                           17(2), 281\u2013308 (1988). Online available at \n                    http:\/\/theory.lcs.mit.edu\/~rivest\/GoldwasserMicaliRivest-ADigitalSignatureSchemeSecureAgainstAdaptiveChosenMessageAttacks.ps","journal-title":"SIAM J.\u00a0Comput."},{"key":"9068_CR32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-46885-4_5","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201989","author":"C. G\u00fcnther","year":"1990","unstructured":"C. G\u00fcnther, An identity-based key-exchange protocol, in Advances in Cryptology\u2014EUROCRYPT \u201989, ed. by J.-J. Quisquater, J. Vandewalle. vol. 434 (Springer, Berlin, 1990), pp. 29\u201337"},{"key":"9068_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1250790.1250792","volume-title":"STOC \u201907: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing","author":"I. Haitner","year":"2007","unstructured":"I. Haitner, O. Reingold, Statistically-hiding commitment from any one-way function, in STOC \u201907: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (ACM, New York, 2007), pp. 1\u201310"},{"key":"9068_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-24638-1_4","volume-title":"Theory of Cryptography","author":"D. Hofheinz","year":"2004","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, Universally composable commitments using random oracles, in Theory of Cryptography, ed. by M. Naor. Proceedings of TCC 2004. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 58\u201376"},{"key":"9068_CR35","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/CSFW.2005.22","volume-title":"18th IEEE Computer Security Foundations Workshop","author":"D. Hofheinz","year":"2005","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, D. Unruh, Polynomial runtime in simulatability definitions, in 18th IEEE Computer Security Foundations Workshop. Proceedings of CSFW 2005 (IEEE Computer Society, Los Alamitos, 2005), pp. 156\u2013169. Online available at \n                    http:\/\/iaks-www.ira.uka.de\/home\/unruh\/publications\/hofheinz05polynomial.html"},{"key":"9068_CR36","first-page":"83","volume":"33","author":"D. Hofheinz","year":"2006","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, R. Steinwandt, On modeling IND-CCA security in cryptographic protocols. Tatra Mt. Math. Publ.\n                           33, 83\u201397 (2006). Full version available at \n                    http:\/\/eprint.iacr.org\/2003\/024","journal-title":"Tatra Mt. Math. Publ."},{"key":"9068_CR37","series-title":"LNCS","first-page":"504","volume-title":"Advances in Cryptology","author":"D. Hofheinz","year":"2006","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, D. Unruh, On the (im)possibility of extending coin toss, in Advances in Cryptology, ed. by S. Vaudenay. Proceedings of EUROCRYPT \u201906. LNCS, vol. 4004 (Springer, Berlin, 2006), pp. 504\u2013521. Full version available at \n                    http:\/\/eprint.iacr.org\/2006\/177"},{"key":"9068_CR38","first-page":"93","volume":"37","author":"D. Hofheinz","year":"2007","unstructured":"D. Hofheinz, D. Unruh, J. M\u00fcller-Quade, Universally composable zero-knowledge arguments and commitments from signature cards. Tatra Mt. Math. Publ.\n                           37, 93\u2013103 (2007)","journal-title":"Tatra Mt. Math. Publ."},{"key":"9068_CR39","first-page":"394","volume-title":"44th Annual Symposium on Foundations of Computer Science","author":"Y. Lindell","year":"2003","unstructured":"Y. Lindell, General composition and universal composability in secure multi-party computation, in 44th Annual Symposium on Foundations of Computer Science. Proceedings of FOCS 2003 (IEEE Computer Society, Los Alamitos, 2003), pp. 394\u2013403. Online available at \n                    http:\/\/eprint.iacr.org\/2003\/141"},{"key":"9068_CR40","series-title":"LNCS","first-page":"130","volume-title":"Proceedings of Crypto\u201907","author":"U.M. Maurer","year":"2007","unstructured":"U.M. Maurer, K. Pietrzak, R. Renner, Indistinguishability amplification, in Proceedings of Crypto\u201907, ed. by A. Menezes. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 130\u2013149"},{"key":"9068_CR41","unstructured":"J. M\u00fcller-Quade, Temporary assumptions\u2014quantum and classical, in The 2005 IEEE Information Theory Workshop On Theory and Practice in Information-Theoretic Security (2005). Abstract"},{"key":"9068_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-70936-7_3","volume-title":"Theory of Cryptography, Proceedings of TCC 2007","author":"J. M\u00fcller-Quade","year":"2007","unstructured":"J. M\u00fcller-Quade, D. Unruh, Long-term security and universal composability, in Theory of Cryptography, Proceedings of TCC 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 41\u201360"},{"issue":"2","key":"9068_CR43","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, M. Yung, Perfect zero-knowledge arguments for NP using any one-way permutation. J.\u00a0Cryptol.\n                           11(2), 87\u2013108 (1998)","journal-title":"J.\u00a0Cryptol."},{"key":"9068_CR44","unstructured":"M.O. Rabin, Hyper-encryption by virtual satellite. Science Center Research Lecture Series, December 2003. Online available at \n                    http:\/\/athome.harvard.edu\/programs\/hvs\/"},{"key":"9068_CR45","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/100216.100269","volume-title":"Twenty-Second Annual ACM Symposium on Theory of Computing","author":"J. Rompel","year":"1990","unstructured":"J. Rompel, One-way functions are necessary and sufficient for secure signatures, in Twenty-Second Annual ACM Symposium on Theory of Computing. Proceedings of STOC 1990 (ACM, New York, 1990), pp. 387\u2013394"},{"key":"9068_CR46","series-title":"LNCS","first-page":"604","volume-title":"ICALP 2008, Track C","author":"S. Wehner","year":"2008","unstructured":"S. Wehner, J. Wullschleger, Composable security in the bounded-quantum-storage model, in ICALP 2008, Track C. LNCS (Springer, Berlin, 2008), pp. 604\u2013615. Full available at \n                    http:\/\/arxiv.org\/abs\/0709.0492v1"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9068-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9068-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9068-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9068-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:45:06Z","timestamp":1586335506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9068-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,28]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9068"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9068-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,28]]},"assertion":[{"value":"8 December 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2010","order":2,"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"}]}}