{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T17:20:40Z","timestamp":1776273640191,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,4,29]],"date-time":"2009-04-29T00:00:00Z","timestamp":1240963200000},"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":[[2011,1]]},"DOI":"10.1007\/s00145-009-9043-4","type":"journal-article","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T15:47:20Z","timestamp":1240933640000},"page":"203-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Non-Malleable Commitment Schemes"],"prefix":"10.1007","volume":"24","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]},{"given":"Roger","family":"Fischlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,29]]},"reference":[{"key":"9043_CR1","volume-title":"Proceedings of 43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Barak","year":"2002","unstructured":"B. Barak, Constant-round coin-tossing with a man in the middle or realizing the shared random string model, in Proceedings of 43rd IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 2002)"},{"key":"9043_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology\u2014Proceedings Crypto\u201992","author":"M. Bellare","year":"1993","unstructured":"M. Bellare, O. Goldreich, On defining proofs of knowledge, in Advances in Cryptology\u2014Proceedings Crypto\u201992. Lecture Notes in Computer Science, vol.\u00a0740 (Springer, New York, 1993), pp.\u00a0390\u2013420"},{"key":"9043_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"First ACM Conference on Computer and Communication Security","author":"M. Bellare","year":"1993","unstructured":"M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in First ACM Conference on Computer and Communication Security (ACM Press, New York, 1993), pp.\u00a062\u201373"},{"key":"9043_CR4","series-title":"Lecture Notes in Computer Science","first-page":"92","volume-title":"Advances in Cryptology\u2014Proceedings Eurocrypt\u00a0\u201994","author":"M. Bellare","year":"1993","unstructured":"M. Bellare, P. Rogaway, Optimal asymmetric encryption, in Advances in Cryptology\u2014Proceedings Eurocrypt\u00a0\u201994. Lecture Notes in Computer Science, vol.\u00a0950 (Springer, New York, 1993), pp.\u00a092\u2013111"},{"key":"9043_CR5","volume-title":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC)","author":"D. Boneh","year":"2000","unstructured":"D. Boneh, Finding smooth integers using CRT decoding, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 2000)"},{"issue":"2","key":"9043_CR6","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.\u00a0Comput. Syst. Sci.\n                           37(2), 156\u2013189 (1988)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9043_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology\u2014Proceedings Crypto 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Advances in Cryptology\u2014Proceedings Crypto 2001. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, New York, 2001), pp.\u00a019\u201340"},{"key":"9043_CR8","first-page":"209","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"1998","unstructured":"R. Canetti, O. Goldreich, S. Halevi, The random oracle methodology, revisited, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 1998), pp.\u00a0209\u2013218"},{"key":"9043_CR9","volume-title":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, S. Micali, Resettable zero-knowledge, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 2000)"},{"key":"9043_CR10","first-page":"459","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"2002","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 2002), pp.\u00a0459\u2013503"},{"issue":"3","key":"9043_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R. Cramer","year":"2000","unstructured":"R. Cramer, V. Shoup, Signature schemes based on the strong RSA assumption. ACM Trans. Inf. Syst. Secur. (ACM TISSEC)\n                           3(3), 161\u2013185 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur. (ACM TISSEC)"},{"key":"9043_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"R. Cramer, V. Shoup, Design and analysis of practical public key cryptosystem provable secure against adaptive chosen ciphertext attack. SIAM J. Comput.\n                           33, 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"9043_CR13","first-page":"426","volume-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC)","author":"I. Damg\u00e5rd","year":"2003","unstructured":"I. Damg\u00e5rd, J. Groth, Non-interactive and reusable non-malleable commitment schemes, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 2003), pp.\u00a0426\u2013437"},{"key":"9043_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology\u2014Crypto 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, J. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in Advances in Cryptology\u2014Crypto 2002. Lecture Notes in Computer Science, vol.\u00a02442 (Springer, New York, 2002), pp.\u00a0581\u2013596"},{"key":"9043_CR15","series-title":"Lecture Notes in Computer Science","first-page":"250","volume-title":"Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201993","author":"I. Damg\u00e5rd","year":"1993","unstructured":"I. Damg\u00e5rd, T. Pedersen, B. Pfitzmann, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, in Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201993. Lecture Notes in Computer Science, vol.\u00a0773 (Springer, New York, 1993), pp.\u00a0250\u2013265"},{"key":"9043_CR16","first-page":"141","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC)","author":"G. Crescenzo Di","year":"1998","unstructured":"G. Di Crescenzo, Y. Ishai, R. Ostrovsky, Non-interactive and non-malleable commitment, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC) (ACM Press, New York, 1998), pp.\u00a0141\u2013150"},{"key":"9043_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology\u2014Proceedings Eurocrypt 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"G. Di Crescenzo, J. Katz, R. Ostrovsky, A. Smith, Efficient and non-interactive non-malleable commitment, in Advances in Cryptology\u2014Proceedings Eurocrypt 2001. Lecture Notes in Computer Science, vol.\u00a02045 (Springer, New York, 2001), pp.\u00a040\u201359"},{"issue":"2","key":"9043_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography. SIAM J. Comput.\n                           30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"9043_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology\u2014Proceedings of Crypto\u00a0\u201989","author":"U. Feige","year":"1990","unstructured":"U. Feige, A. Shamir, Zero-knowledge proofs in two rounds, in Advances in Cryptology\u2014Proceedings of Crypto\u00a0\u201989. Lecture Notes in Computer Science, vol.\u00a0435 (Springer, New York, 1990), pp.\u00a0526\u2013544"},{"issue":"2","key":"9043_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, A. Shamir, Zero-knowledge proofs of identity. J.\u00a0Cryptol.\n                           1(2), 77\u201394 (1988)","journal-title":"J.\u00a0Cryptol."},{"key":"9043_CR21","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201986","author":"A. Fiat","year":"1986","unstructured":"A. Fiat, A. Shamir, How to prove yourself: practical solutions to identification and signature schemes, in Advances in Cryptology\u2014Crypto\u00a0\u201986. Lecture Notes in Computer Science, vol.\u00a0263 (Springer, New York, 1986), pp.\u00a0186\u2013194"},{"key":"9043_CR22","first-page":"416","volume-title":"Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC)","author":"A. Fiat","year":"1990","unstructured":"A. Fiat, A. Shamir, Witness indistinguishable and witness hiding protocols, in Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC) (ACM Press, New York, 1990), pp.\u00a0416\u2013426"},{"key":"9043_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/11523468_63","volume-title":"ICALP 2005","author":"M. Fischlin","year":"2005","unstructured":"M. Fischlin, Completely non-malleable schemes, in ICALP 2005. Lecture Notes in Computer Science, vol.\u00a03580 (Springer, New York, 2005), pp.\u00a0779\u2013790"},{"key":"9043_CR24","series-title":"Lecture Notes in Computer Science","first-page":"414","volume-title":"Advances in Cryptology\u2014Crypto 2000","author":"M. Fischlin","year":"2000","unstructured":"M. Fischlin, R. Fischlin, Efficient non-malleable commitment schemes, in Advances in Cryptology\u2014Crypto 2000. Lecture Notes in Computer Science, vol.\u00a01880 (Springer, New York, 2000), pp.\u00a0414\u2013432"},{"key":"9043_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45760-7_8","volume-title":"RSA Cryptographer\u2019s Track 2002","author":"M. Fischlin","year":"2002","unstructured":"M. Fischlin, R. Fischlin, The representation problem based on factoring, in RSA Cryptographer\u2019s Track 2002. Lecture Notes in Computer Science, vol.\u00a02271 (Springer, New York, 2002), pp.\u00a096\u2013113"},{"key":"9043_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-28628-8_14","volume-title":"Advances in Cryptology\u2014Proceedings Crypto 2004","author":"R. Gennaro","year":"2004","unstructured":"R. Gennaro, Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks, in Advances in Cryptology\u2014Proceedings Crypto 2004. Lecture Notes in Computer Science, vol.\u00a03152 (Springer, New York, 2004), pp.\u00a0220\u2013236"},{"key":"9043_CR27","unstructured":"O. Goldreich, Foundations of cryptography, Fragments of a Book, Version\u00a02.03 (1998)"},{"key":"9043_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-44647-8_24","volume-title":"Advances in Cryptology\u2014Proceedings Crypto 2001","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Y. Lindell, Session-key generation using human passwords only, in Advances in Cryptology\u2014Proceedings Crypto 2001. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, New York, 2001), pp.\u00a0408\u2013432"},{"key":"9043_CR29","volume-title":"Proceedings of 41st IEEE Symposium on Foundations of Computer Science (FOCS)","author":"V. Guruswami","year":"2000","unstructured":"V. Guruswami, A. Sahai, M. Sudhan, \u201cSoft-decision\u201d decoding of Chinese remainder theorem, in Proceedings of 41st IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 2000)"},{"key":"9043_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201996","author":"S. Halevi","year":"1996","unstructured":"S. Halevi, S. Micali, Practical and provably-secure commitment schemes from collision-free hashing, in Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201996. Lecture Notes in Computer Science, vol. 1109 (Springer, New York, 1996), pp.\u00a0201\u2013215"},{"issue":"4","key":"9043_CR31","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput.\n                           28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9043_CR32","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/SFCS.1989.63483","volume-title":"Proceedings of 30th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"R. Impagliazzo","year":"1989","unstructured":"R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in Proceedings of 30th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 1989), pp.\u00a0230\u2013235"},{"key":"9043_CR33","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1998","unstructured":"D.E. Knuth, Seminumerical Algorithms, 3rd\u00a0edn. The Art of Computer Programming, vol.\u00a02 (Addison-Wesley, Reading, 1998)","edition":"3"},{"key":"9043_CR34","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A. Lenstra","year":"2001","unstructured":"A. Lenstra, E. Verheul, Selecting cryptographic key sizes. J. Cryptol.\n                           14, 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"key":"9043_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45682-1_23","volume-title":"Advances in Cryptology\u2014Asiacrypt 2001","author":"M. Liskov","year":"2001","unstructured":"M. Liskov, A. Lysyanskaya, S. Micali, L. Reyzin, A. Smith, Mutually independent commitments, in Advances in Cryptology\u2014Asiacrypt 2001. Lecture Notes in Computer Science, vol.\u00a02248 (Springer, New York, 2001), pp.\u00a0385\u2013401"},{"key":"9043_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology\u2014Proceedings Eurocrypt 2004","author":"P. MacKenzie","year":"2004","unstructured":"P. MacKenzie, K. Yang, On simulation-sound trapdoor commitments, in Advances in Cryptology\u2014Proceedings Eurocrypt 2004. Lecture Notes in Computer Science, vol.\u00a03027 (Springer, New York, 2004), pp.\u00a0382\u2013400"},{"key":"9043_CR37","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"U. Maurer","year":"1995","unstructured":"U. Maurer, Fast generation of prime numbers and secure public-key cryptographic parameters. J.\u00a0Cryptol.\n                           8, 123\u2013155 (1995)","journal-title":"J.\u00a0Cryptol."},{"key":"9043_CR38","first-page":"120","volume-title":"Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Micali","year":"1999","unstructured":"S. Micali, M. Rabin, S. Vadhan, Verifiable random functions, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 1999), pp.\u00a0120\u2013130"},{"key":"9043_CR39","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"M. Naor, Bit commitment using pseudo-randomness. J. Cryptol.\n                           4, 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"9043_CR40","unstructured":"M. Naor, M. Yung, Universal one-way hash functions and their cryptographic applications, in Proceedings of the 21st Annual ACM Symposium on the Theory of Computing (STOC) (1989), pp.\u00a033\u201343"},{"key":"9043_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201992","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto, Provable secure and practical identification schemes and corresponding signature schemes, in Advances in Cryptology\u2014Proceedings Crypto\u00a0\u201992. Lecture Notes in Computer Science, vol.\u00a0740 (Springer, New York, 1993), pp.\u00a031\u201353"},{"key":"9043_CR42","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/SFCS.2005.27","volume-title":"Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"R. Pass","year":"2005","unstructured":"R. Pass, A. Rosen, Concurrent non-malleable commitments, in Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, 2005), pp.\u00a0563\u2013572"},{"key":"9043_CR43","series-title":"Lecture Notes in Computer Science","first-page":"129","volume-title":"Crypto\u00a0\u201991","author":"T.P. Pedersen","year":"1991","unstructured":"T.P. Pedersen, Non-interactive and information-theoretical secure verifiable secret sharing, in Crypto\u00a0\u201991. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, New York, 1991), pp.\u00a0129\u2013140"},{"key":"9043_CR44","unstructured":"M. Prabhakaran, A. Sahai, New notions of security: achieving universal composability without trusted setup, in Proceedings of the Annual ACM Symposium on the Theory of Computing (STOC) (2004), pp.\u00a0242\u2013251"},{"key":"9043_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-45624-4_4","volume-title":"Proceedings of the 14th Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting (AAECC-14)","author":"M. Sudan","year":"2001","unstructured":"M. Sudan, Ideal error-correcting codes: unifying algebraic and number-theoretic algorithms, in Proceedings of the 14th Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting (AAECC-14). Lecture Notes in Computer Science, vol.\u00a02227 (Springer, New York, 2001), pp.\u00a036\u201345"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9043-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-009-9043-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9043-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-009-9043-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:45:40Z","timestamp":1586335540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-009-9043-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,29]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9043"],"URL":"https:\/\/doi.org\/10.1007\/s00145-009-9043-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,29]]},"assertion":[{"value":"16 March 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2008","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2009","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"}]}}