{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:29:53Z","timestamp":1767652193576},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T00:00:00Z","timestamp":1435017600000},"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":[[2016,10]]},"DOI":"10.1007\/s00145-015-9206-4","type":"journal-article","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T18:51:36Z","timestamp":1434999096000},"page":"657-696","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["New Second-Preimage Attacks on Hash Functions"],"prefix":"10.1007","volume":"29","author":[{"given":"Elena","family":"Andreeva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Bouillaguet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orr","family":"Dunkelman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Hoch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Kelsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Zimmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"9206_CR1","doi-asserted-by":"crossref","unstructured":"J.P. Allouche, Sur la complexit\u00e9 des suites infinies. Bull. Belg. Math. Soc.\n                           1, 133\u2013143 (1994). \n                    citeseer.ist.psu.edu\/allouche94sur.html","DOI":"10.36045\/bbms\/1103408543"},{"key":"9206_CR2","doi-asserted-by":"publisher","unstructured":"E. Andreeva, C. Bouillaguet, P. Fouque, J.J. Hoch, J. Kelsey, A. Shamir, S. Zimmer, Second preimage attacks on dithered hash functions, in ed. by N.P. Smart. Advances in Cryptology EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13\u201317, 2008. Proceedings. Lecture Notes in Computer Science, vol. 4965 (Springer, 2008), pp. 270\u2013288. doi:\n                    10.1007\/978-3-540-78967-3_16","DOI":"10.1007\/978-3-540-78967-3_16"},{"key":"9206_CR3","doi-asserted-by":"publisher","unstructured":"E. Andreeva, B. Mennink, Provable chosen-target-forced-midfix preimage resistance, in eds. by A. Miri, S. Vaudenay. Selected Areas in Cryptography\u201418th International Workshop, SAC 2011, Toronto, ON, Canada, August 11\u201312, 2011. Revised Selected Papers. Lecture Notes in Computer Science, vol. 7118 (Springer, 2011), pp. 37\u201354. doi:\n                    10.1007\/978-3-642-28496-0_3","DOI":"10.1007\/978-3-642-28496-0_3"},{"key":"9206_CR4","doi-asserted-by":"crossref","unstructured":"E. Andreeva, G. Neven, B. Preneel, T. Shrimpton, Seven-property-preserving iterated hashing: ROX, in ed. by K. Kurosawa. ASIACRYPT\u201907. Lecture Notes in Computer Science, vol. 4833 (Springer, 2007), pp. 130\u2013146","DOI":"10.1007\/978-3-540-76900-2_8"},{"key":"9206_CR5","unstructured":"J.P. Aumasson, L. Henzen, W. Meier, R.C.W. Phan, SHA-3 proposal BLAKE. Submission to NIST (2008). \n                    http:\/\/131002.net\/blake\/blake.pdf"},{"key":"9206_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare, T. Ristenpart, Multi-property-preserving hash domain extension and the EMD transform, in eds. by X. Lai, K Chen. Advances in Cryptology\u2014ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3\u20137, 2006, Proceedings. Lecture Notes in Computer Science, vol. 4284 (Springer, 2006), pp. 299\u2013314","DOI":"10.1007\/11935230_20"},{"key":"9206_CR7","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, Collision-resistant hashing: towards making UOWHFs practical, in ed. by Jr., B.S.K. CRYPTO. Lecture Notes in Computer Science, vol. 1294 (Springer, 1997), pp. 470\u2013484","DOI":"10.1007\/BFb0052256"},{"key":"9206_CR8","doi-asserted-by":"crossref","unstructured":"E. Biham, R. Chen, A. Joux, P. Carribault, C. Lemuet, W. Jalby, Collisions of SHA-0 and reduced SHA-1, in ed. by R. Cramer. Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3494 (Springer, 2005), pp. 36\u201357","DOI":"10.1007\/11426639_3"},{"key":"9206_CR9","unstructured":"E. Biham, O. Dunkelman, A framework for iterative hash functions\u2014HAIFA (2006). \n                    http:\/\/www.csrc.nist.gov\/pki\/HashWorkshop\/2006\/Papers\/DUNKELMAN_NIST3.pdf\n                    \n                  , presented at the second NIST hash workshop (August 24\u201325, 2006)"},{"key":"9206_CR10","doi-asserted-by":"crossref","unstructured":"A. Biryukov, A. Shamir, Cryptanalytic time\/memory\/data tradeoffs for stream ciphers, in ed. by T. Okamoto. ASIACRYPT. Lecture Notes in Computer Science, vol. 1976 (Springer, 2000), pp. 1\u201313","DOI":"10.1007\/3-540-44448-3_1"},{"key":"9206_CR11","doi-asserted-by":"crossref","unstructured":"C. de\u00a0Canni\u00e8re, F. Mendel, C. Rechberger, Collisions for 70-step SHA-1: on the full cost of collision search, in eds. by C.M. Adams, A. Miri, M.J. Wiener. Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 4876 (Springer, 2007), pp. 56\u201373","DOI":"10.1007\/978-3-540-77360-3_4"},{"key":"9206_CR12","doi-asserted-by":"crossref","unstructured":"C. de\u00a0Canni\u00e8re, C. Rechberger, Finding SHA-1 characteristics: general results and applications, in X. Lai, K. Chen (eds.), Advances in Cryptology\u2014ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3\u20137, 2006, Proceedings. Lecture Notes in Computer Science, vol. 4284 (Springer, 2006), pp. 1\u201320","DOI":"10.1007\/11935230_1"},{"key":"9206_CR13","doi-asserted-by":"crossref","unstructured":"C. de\u00a0Canni\u00e8re, C. Rechberger, Preimages for reduced SHA-0 and SHA-1, in ed by D. Wagner. CRYPTO. Lecture Notes in Computer Science, vol. 5157 (Springer, 2008), pp. 179\u2013202","DOI":"10.1007\/978-3-540-85174-5_11"},{"issue":"3","key":"9206_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Mathematical Systems Theory 6(3), 164\u2013192 (1972)","journal-title":"Math. Syst. Theory"},{"key":"9206_CR15","unstructured":"J.S. Coron, Y. Dodis, C. Malinaud, P. Puniya, Merkle-damg\u00e5rd revisited: How to construct a hash function, in CRYPTO\u201905 (2005), pp. 430\u2013448"},{"key":"9206_CR16","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, A design principle for hash functions, in ed. by G. Brassard. CRYPTO \u201989, Santa Barbara, California, USA, August 20\u201324, 1989, Proceedings. Lecture Notes in Computer Science, vol. 435 (Springer, 1990), pp. 416\u2013427","DOI":"10.1007\/0-387-34805-0_39"},{"key":"9206_CR17","unstructured":"R.D. Dean, Formal Aspects of Mobile Code Security. Ph.D. thesis, Princeton University (January 1999)"},{"issue":"1","key":"9206_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions. Theor. Comput. Sci. 1(1), 59\u201375 (1975).","journal-title":"Theor. Comput. Sci."},{"key":"9206_CR19","unstructured":"W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1, chap. 12. (Wiley, 1971)"},{"key":"9206_CR20","unstructured":"N. Ferguson, S. Lucks, B. Schneier, D. Whiting, M. Bellare, T. Kohno, J. Callas, J. Walker, The Skein hash function family. Submission to NIST (2008). \n                    http:\/\/www.skein-hash.info\/sites\/default\/files\/skein.pdf"},{"key":"9206_CR21","unstructured":"N. Ferguson, S. Lucks, B. Schneier, D. Whiting, M. Bellare, T. Kohno, J. Callas, J. Walker, The Skein hash function family. Submission to NIST (Round 1) (2008). \n                    http:\/\/www.skein-hash.info\/sites\/default\/files\/skein1.1.pdf"},{"key":"9206_CR22","doi-asserted-by":"crossref","unstructured":"S. Halevi, H. Krawczyk, Strengthening digital signatures via randomized hashing, in ed. by C. Dwork. CRYPTO. Lecture Notes in Computer Science, vol. 4117 (Springer, 2006), pp. 41\u201359","DOI":"10.1007\/11818175_3"},{"key":"9206_CR23","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"ME Hellman","year":"1980","unstructured":"Hellman, M.E.: A Cryptanalytic Time-Memory Trade Off. In: IEEE Transactions on Information Theory. vol. 26, pp. 401\u2013406 (1980).","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1\u20133","key":"9206_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2004.06.023","volume":"326","author":"S Janson","year":"2004","unstructured":"Janson, S., Lonardi, S., Szpankowski, W.: On average sequence complexity. Theor. Comput. Sci. 326(1\u20133), 213\u2013227 (2004).","journal-title":"Theor. Comput. Sci."},{"key":"9206_CR25","doi-asserted-by":"crossref","unstructured":"A. Joux, Multicollisions in iterated hash functions. Application to cascaded constructions, in ed. by M.K. Franklin. CRYPTO\u201904. Lecture Notes in Computer Science, vol. 3152 (Springer, 2004), pp. 306\u2013316","DOI":"10.1007\/978-3-540-28628-8_19"},{"key":"9206_CR26","doi-asserted-by":"crossref","unstructured":"A. Joux, S. Lucks, Improved generic algorithms for 3-collisions, in ed. by M. Matsui. Advances in Cryptology\u2014ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6\u201310, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5912 (Springer, 2009), pp. 347\u2013363","DOI":"10.1007\/978-3-642-10366-7_21"},{"key":"9206_CR27","doi-asserted-by":"crossref","unstructured":"A. Joux, T. Peyrin, Hash functions and the (amplified) boomerang attack, in ed. by A. Menezes. CRYPTO. Lecture Notes in Computer Science, vol. 4622. (Springer, 2007), pp. 244\u2013263","DOI":"10.1007\/978-3-540-74143-5_14"},{"key":"9206_CR28","doi-asserted-by":"crossref","unstructured":"J. Kelsey, T. Kohno, Herding hash functions and the nostradamus attack, in ed. by S. Vaudenay. EUROCRYPT. Lecture Notes in Computer Science, vol. 4004 (Springer, 2006), pp. 183\u2013200","DOI":"10.1007\/11761679_12"},{"key":"9206_CR29","doi-asserted-by":"crossref","unstructured":"J. Kelsey, B. Schneier, Second preimages on n-bit hash functions for much less than 2\n                    \n                      \n                    \n                    $$^{\\text{ n }}$$\n                    \n                      \n                        \n                          \n                          \n                            \n                            n\n                            \n                          \n                        \n                      \n                    \n                   work, in ed. by R. Cramer, Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3494 (Springer, 2005), pp. 474\u2013490","DOI":"10.1007\/11426639_28"},{"key":"9206_CR30","doi-asserted-by":"crossref","unstructured":"V. Ker\u00e4nenKer\u00e4nen, Abelian squares are avoidable on 4 letters, in ed. by W. Kuich. ICALP. Lecture Notes in Computer Science, vol. 623 (Springer, 1992), pp. 41\u201352","DOI":"10.1007\/3-540-55719-9_62"},{"key":"9206_CR31","unstructured":"V. Klima, Tunnels in hash functions: MD5 collisions within a minute. Cryptology ePrint Archive, Report 2006\/105 (2006). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9206_CR32","doi-asserted-by":"crossref","unstructured":"G. Leurent, Md4 is not one-way, in ed. by Nyberg, K. FSE. Lecture Notes in Computer Science, vol. 5086 (Springer, 2008), pp. 412\u2013428","DOI":"10.1007\/978-3-540-71039-4_26"},{"issue":"1","key":"9206_CR33","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1504\/IJACT.2008.017049","volume":"1","author":"G Leurent","year":"2008","unstructured":"Leurent, G.: Practical key-recovery attack against APOP, an MD5-based challenge-response authentication. IJACT 1(1), 32\u201346 (2008).","journal-title":"IJACT"},{"key":"9206_CR34","doi-asserted-by":"crossref","unstructured":"S. Lucks, A failure-friendly design principle for hash functions, in ed. by B.K. Roy. ASIACRYPT. Lecture Notes in Computer Science, vol. 3788 (Springer, 2005), pp. 474\u2013494","DOI":"10.1007\/11593447_26"},{"key":"9206_CR35","doi-asserted-by":"crossref","unstructured":"K. Matusiewicz, M. Naya-Plasencia, I. Nikolic, Y. Sasaki, M. Schl\u00e4ffer, Rebound attack on the full lane compression function, in ed. by M. Matsui. Advances in Cryptology\u2014ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6\u201310, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5912 (Springer, 2009), pp. 106\u2013125","DOI":"10.1007\/978-3-642-10366-7_7"},{"key":"9206_CR36","doi-asserted-by":"crossref","unstructured":"F. Mendel, T. Peyrin, C. Rechberger, M. Schl\u00e4ffer, Improved cryptanalysis of the reduced Gr\u00f8stl compression function, ECHO permutation and AES block cipher, in eds. by Jr., M.J.J., Rijmen V., Safavi-Naini R. Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 5867 (Springer, 2009), pp. 16\u201335","DOI":"10.1007\/978-3-642-05445-7_2"},{"key":"9206_CR37","doi-asserted-by":"crossref","unstructured":"F. Mendel, C. Rechberger, M. Schl\u00e4ffer, S.S. Thomsen, The rebound attack: cryptanalysis of reduced whirlpool and Gr\u00f8stl, in ed. by O. Dunkelman. FSE. Lecture Notes in Computer Science, vol. 5665 (Springer, 2009), pp. 260\u2013276","DOI":"10.1007\/978-3-642-03317-9_16"},{"key":"9206_CR38","unstructured":"A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography. \n                    citeseer.ist.psu.edu\/428600.html"},{"key":"9206_CR39","doi-asserted-by":"crossref","unstructured":"R.C. Merkle, One way hash functions and DES, in ed. by G. Brassard, CRYPTO \u201989, Santa Barbara, California, USA, August 20\u201324, 1989, Proceedings. Lecture Notes in Computer Science, vol. 435 (Springer, 1990), pp. 428\u2013446","DOI":"10.1007\/0-387-34805-0_40"},{"key":"9206_CR40","doi-asserted-by":"crossref","unstructured":"M. Naor, M. Yung, Universal one-way hash functions and their cryptographic applications. in STOC (ACM, 1989), pp. 33\u201343","DOI":"10.1145\/73007.73011"},{"key":"9206_CR41","doi-asserted-by":"crossref","unstructured":"J.J. Pansiot, Complexit\u00e9 des Facteurs des Mots Infinis Engendr\u00e9s Par Morphismes It\u00e9r\u00e9s, in ed. by J. Paredaens. 11th ICALP, Antwerpen. LNCS, vol. 172 (Springer, july 1984), pp. 380\u2013389. \n                    http:\/\/lsiit.u-strasbg.fr\/Publications\/1984\/Pan84a","DOI":"10.1007\/3-540-13345-3_34"},{"key":"9206_CR42","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"PA Pleasants","year":"1970","unstructured":"Pleasants, P.A.: Non-repetitive sequences. Mat. Proc. Camb. Phil. Soc. 68, 267\u2013274 (1970).","journal-title":"Mat. Proc. Camb. Phil. Soc."},{"key":"9206_CR43","unstructured":"R.L. Rivest, Abelian square-free dithering for iterated hash functions. Presented at ECRYPT Hash Function Workshop, June 21, 2005, Krakow, and at the Cryptographic Hash workshop, November 1, 2005, Gaithersburg, Maryland (2005)"},{"key":"9206_CR44","doi-asserted-by":"crossref","unstructured":"P. Rogaway, T. Shrimpton, Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance, in eds. by B.K., Roy, W. Meier. FSE. Lecture Notes in Computer Science, vol. 3017 (Springer, 2004), pp. 371\u2013388","DOI":"10.1007\/978-3-540-25937-4_24"},{"key":"9206_CR45","doi-asserted-by":"crossref","unstructured":"Y. Sasaki, K. Aoki, Finding preimages in full md5 faster than exhaustive search, in ed. by A. Joux. EUROCRYPT. Lecture Notes in Computer Science, vol. 5479 (Springer, 2009), pp. 134\u2013152","DOI":"10.1007\/978-3-642-01001-9_8"},{"key":"9206_CR46","doi-asserted-by":"crossref","unstructured":"V. Shoup, A composition theorem for universal one-way hash functions, in ed. by B. Preneel. EUROCRYPT\u201900. Lecture Notes in Computer Science, vol. 1807 (Springer, 2000), pp. 445\u2013452","DOI":"10.1007\/3-540-45539-6_32"},{"key":"9206_CR47","unstructured":"X. Wang, X. Lai, D., Feng, H. Chen, X. Yu, Cryptanalysis of the hash functions MD4 and RIPEMD, in ed. by R. Cramer, Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3494 (Springer, 2005), pp. 1\u201318"},{"key":"9206_CR48","unstructured":"X. Wang, Y.L. Yin, H. Yu, Finding collisions in the full SHA-1, in ed. by V. Shoup. Advances in Cryptology\u2014CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14\u201318, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3621 (Springer, 2005), pp. 17\u201336"},{"key":"9206_CR49","unstructured":"X. Wang, H. Yu, How to break MD5 and other hash functions, in ed. by R. Cramer, Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3494 (Springer, 2005), pp. 19\u201335"},{"key":"9206_CR50","unstructured":"X. Wang, H. Yu, Y.L. Yin, Efficient collision search attacks on SHA-0, in ed. by V. Shoup. Advances in Cryptology\u2014CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14\u201318, 2005, Proceedings. Lecture Notes in Computer Science, vol. 3621 (Springer, 2005), pp. 1\u201316"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9206-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9206-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9206-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9206-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:10:53Z","timestamp":1586333453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9206-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,23]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9206"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9206-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,23]]},"assertion":[{"value":"14 December 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2015","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"}]}}