{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:20:12Z","timestamp":1780053612167,"version":"3.54.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319636870","type":"print"},{"value":"9783319636887","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63688-7_19","type":"book-chapter","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T01:19:44Z","timestamp":1501204784000},"page":"570-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":204,"title":["The First Collision for Full SHA-1"],"prefix":"10.1007","author":[{"given":"Marc","family":"Stevens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elie","family":"Bursztein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Karpman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ange","family":"Albertini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yarik","family":"Markov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,29]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-13051-4_1","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"A Albertini","year":"2014","unstructured":"Albertini, A., Aumasson, J.-P., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Malicious hashing: Eve\u2019s variant of SHA-1. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 1\u201319. Springer, Cham (2014). doi:\n                      10.1007\/978-3-319-13051-4_1"},{"key":"19_CR2","unstructured":"Albertini, A., et al.: Exploiting identical-prefix hash function collisions. Draft (2017)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-28628-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"E Biham","year":"2004","unstructured":"Biham, E., Chen, R.: Near-collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 290\u2013305. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-28628-8_18"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and reduced SHA-1. In: Cramer [6], pp. 36\u201357 (2005)","DOI":"10.1007\/11426639_3"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/BFb0055720","volume-title":"Advances in Cryptology\u2014CRYPTO 1998","author":"F Chabaud","year":"1998","unstructured":"Chabaud, F., Joux, A.: Differential collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 56\u201371. Springer, Heidelberg (1998). doi:\n                      10.1007\/BFb0055720"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT","year":"2005","unstructured":"Cramer, R. (ed.): EUROCRYPT. LNCS, vol. 3494. Springer, Cham (2005)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-77360-3_4","volume-title":"Selected Areas in Cryptography","author":"C Canni\u00e8re","year":"2007","unstructured":"Canni\u00e8re, C., Mendel, F., Rechberger, C.: Collisions for 70-step SHA-1: on the full cost of collision search. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 56\u201373. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-77360-3_4"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11935230_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"C De Canni\u00e8re","year":"2006","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Finding SHA-1 characteristics: general results and applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 1\u201320. Springer, Heidelberg (2006). doi:\n                      10.1007\/11935230_1"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-46766-1_14","volume-title":"Advances in Cryptology\u2014CRYPTO 1991","author":"B Boer","year":"1992","unstructured":"Boer, B., Bosselaers, A.: An attack on the last two rounds of MD4. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 194\u2013203. Springer, Heidelberg (1992). doi:\n                      10.1007\/3-540-46766-1_14"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-48285-7_26","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1993","author":"B Boer","year":"1994","unstructured":"Boer, B., Bosselaers, A.: Collisions for the compression function of MD5. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 293\u2013304. Springer, Heidelberg (1994). doi:\n                      10.1007\/3-540-48285-7_26"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-60865-6_43","volume-title":"Fast Software Encryption","author":"H Dobbertin","year":"1996","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 53\u201369. Springer, Heidelberg (1996). doi:\n                      10.1007\/3-540-60865-6_43"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-662-48800-3_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"M Fillinger","year":"2015","unstructured":"Fillinger, M., Stevens, M.: Reverse-engineering of the cryptanalytic attack used in the flame super-malware. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 586\u2013611. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-48800-3_24"},{"key":"19_CR13","unstructured":"Cab Forum: Ballot 152 - Issuance of SHA-1 certificates through 2016. Cabforum mailing List (2015). \n                      https:\/\/cabforum.org\/pipermail\/public\/2015-October\/006081.html"},{"key":"19_CR14","unstructured":"Gebhardt, M., Illies, G., Schindler, W.: A note on practical value of single hash collisions for special file formats. In: NIST First Cryptographic Hash Workshop, October 2005"},{"key":"19_CR15","unstructured":"Grechnikov, E.: Collisions for 72-step and 73-step SHA-1: improvements in the method of characteristics. Cryptology ePrint Archive, Report 2010\/413 (2010)"},{"key":"19_CR16","unstructured":"Grechnikov, E., Adinetz, A.: Collision for 75-step SHA-1: intensive parallelization with GPU. Cryptology ePrint Archive, Report 2011\/641 (2011)"},{"key":"19_CR17","unstructured":"Hashclash project webpage. \n                      https:\/\/marc-stevens.nl\/p\/hashclash\/\n                      \n                    . Accessed May 2017"},{"key":"19_CR18","unstructured":"InfoWorld: Oracle to Java devs: stop signing jar files with MD5, January 2017"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-74143-5_14","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"A Joux","year":"2007","unstructured":"Joux, A., Peyrin, T.: Hash functions and the (amplified) boomerang attack. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 244\u2013263. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-74143-5_14"},{"key":"19_CR20","unstructured":"Jutla, C.S., Patthak, A.C.: A matching lower bound on the minimum weight of SHA-1 expansion code. IACR Cryptology ePrint Archive 2005, 266 (2005)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-662-47989-6_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Karpman","year":"2015","unstructured":"Karpman, P., Peyrin, T., Stevens, M.: Practical free-start collision attacks on 76-step SHA-1. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 623\u2013642. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-662-47989-6_30"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Kleinjung","year":"2010","unstructured":"Kleinjung, T., et al.: Factorization of a 768-bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010). doi:\n                      10.1007\/978-3-642-14623-7_18"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-56620-7_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"T Kleinjung","year":"2017","unstructured":"Kleinjung, T., Diem, C., Lenstra, A.K., Priplata, C., Stahlke, C.: Computation of a 768-bit prime field discrete logarithm. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 185\u2013201. Springer, Cham (2017). doi:\n                      10.1007\/978-3-319-56620-7_7"},{"key":"19_CR24","unstructured":"CrySyS Lab: sKyWiper (a.k.a. flame a.k.a. flamer): a complex malware for targeted attacks. Laboratory of Cryptography and System Security, Budapest University of Technology and Economics, 31 May 2012"},{"key":"19_CR25","unstructured":"Kaspersky Lab: The flame: questions and answers. Securelist blog, 28 May 2012"},{"issue":"1\u20133","key":"19_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10623-010-9458-9","volume":"59","author":"S Manuel","year":"2011","unstructured":"Manuel, S.: Classification and generation of disturbance vectors for collision attacks against SHA-1. Des. Codes Cryptogr. 59(1\u20133), 247\u2013263 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-71039-4_2","volume-title":"Fast Software Encryption","author":"S Manuel","year":"2008","unstructured":"Manuel, S., Peyrin, T.: Collisions on SHA-0 in one hour. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 16\u201335. Springer, Heidelberg (2008). doi:\n                      10.1007\/978-3-540-71039-4_2"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/11799313_18","volume-title":"Fast Software Encryption","author":"F Mendel","year":"2006","unstructured":"Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: The impact of carries on the complexity of collision attacks on SHA-1. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 278\u2013292. Springer, Heidelberg (2006). doi:\n                      10.1007\/11799313_18"},{"key":"19_CR29","unstructured":"Third author\u2019s mum, T.: SHA-1 is still being used. Personnal communication"},{"key":"19_CR30","unstructured":"National Institute of Standards and Technology: FIPS 180: Secure Hash Standard, May 1993"},{"key":"19_CR31","unstructured":"National Institute of Standards and Technology: FIPS 180-1: Secure Hash Standard, April 1995"},{"key":"19_CR32","unstructured":"Nossum, V.: SAT-based preimage attacks on SHA-1. Master\u2019s thesis, University of Oslo (2012)"},{"issue":"1","key":"19_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"19_CR34","unstructured":"Post, T.W.: US, Israel developed flame computer virus to slow Iranian nuclear efforts, officials say, June 2012"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11586821_7","volume-title":"Cryptography and Coding","author":"N Pramstaller","year":"2005","unstructured":"Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting coding theory for collision attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 78\u201395. Springer, Heidelberg (2005). doi:\n                      10.1007\/11586821_7"},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-38424-3_22","volume-title":"Advances in Cryptology-CRYPTO 1990","author":"RL Rivest","year":"1991","unstructured":"Rivest, R.L.: The MD4 message digest algorithm. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 303\u2013311. Springer, Heidelberg (1991). doi:\n                      10.1007\/3-540-38424-3_22"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: RFC 1321: The MD5 Message-Digest Algorithm, April 1992","DOI":"10.17487\/rfc1321"},{"key":"19_CR38","unstructured":"Schneier, B.: When will we see collisions for SHA-1? Blog (2012)"},{"key":"19_CR39","unstructured":"Amazon Web Services: Amazon EC2 - Virtual Server Hosting. \n                      aws.amazon.com\n                      \n                    . Accessed Jan 2016"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","volume-title":"CRYPTO","year":"2005","unstructured":"Shoup, V. (ed.): CRYPTO. LNCS, vol. 3621. Springer, Heidelberg (2005)"},{"key":"19_CR41","unstructured":"Stevens, M.: Attacks on hash functions and applications. Ph.D. thesis, Leiden University, June 2012"},{"key":"19_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40041-4_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"M Stevens","year":"2013","unstructured":"Stevens, M.: Counter-cryptanalysis. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 129\u2013146. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-40041-4_8"},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-38348-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Stevens","year":"2013","unstructured":"Stevens, M.: New collision attacks on SHA-1 based on optimal joint local-collision analysis. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 245\u2013261. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-38348-9_15"},{"key":"19_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-662-49890-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Stevens","year":"2016","unstructured":"Stevens, M., Karpman, P., Peyrin, T.: Freestart collision for full SHA-1. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 459\u2013483. Springer, Heidelberg (2016). doi:\n                      10.1007\/978-3-662-49890-3_18"},{"key":"19_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72540-4_1","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"M Stevens","year":"2007","unstructured":"Stevens, M., Lenstra, A., Weger, B.: Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 1\u201322. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-72540-4_1"},{"key":"19_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-03356-8_4","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M Stevens","year":"2009","unstructured":"Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D.A., Weger, B.: Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 55\u201369. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-03356-8_4"},{"key":"19_CR47","unstructured":"ThreadPost: SHA-1 end times have arrived, January 2017"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup [40], pp. 17\u201336 (2005)","DOI":"10.1007\/11535218_2"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer [6], pp. 19\u201335 (2005)","DOI":"10.1007\/11426639_2"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks on SHA-0. In: Shoup [40], pp. 1\u201316 (2005)","DOI":"10.1007\/11535218_1"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Yajima, J., Iwasaki, T., Naito, Y., Sasaki, Y., Shimoyama, T., Peyrin, T., Kunihiro, N., Ohta, K.: A strict evaluation on the number of conditions for SHA-1 collision search. IEICE Transactions, vol. 92-A, no. 1, pp. 87\u201395 (2009). \n                      http:\/\/search.ieice.org\/bin\/summary.php?id=e92-a_1_87&category=A&year=2009&lang=E&abst=","DOI":"10.1587\/transfun.E92.A.87"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-73458-1_4","volume-title":"Information Security and Privacy","author":"J Yajima","year":"2007","unstructured":"Yajima, J., Sasaki, Y., Naito, Y., Iwasaki, T., Shimoyama, T., Kunihiro, N., Ohta, K.: A new strategy for finding a differential path of SHA-1. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 45\u201358. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-73458-1_4"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63688-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T00:05:20Z","timestamp":1596845120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63688-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319636870","9783319636887"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63688-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"29 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/conferences\/crypto2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}