{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:18Z","timestamp":1776847998360,"version":"3.51.2"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319566191","type":"print"},{"value":"9783319566207","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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-56620-7_8","type":"book-chapter","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T02:29:18Z","timestamp":1490927358000},"page":"202-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A Kilobit Hidden SNFS Discrete Logarithm Computation"],"prefix":"10.1007","author":[{"given":"Joshua","family":"Fried","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierrick","family":"Gaudry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Heninger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"8_CR1","unstructured":"(author redacted): Eurocrypt \u201992 reviewed. Cryptolog, March 1994. \n                      https:\/\/www.nsa.gov\/news-features\/declassified-documents\/cryptologs\/"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Adrian, D., Bhargavan, K., Durumeric, Z., Gaudry, P., Green, M., Halderman, J.A., Heninger, N., Springall, D., Thom\u00e9, E., Valenta, L., VanderSloot, B., Wustrow, E., B\u00e9guelin, S.Z., Zimmermann, P.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015: 22nd Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015, pp. 5\u201317. ACM Press (2015)","DOI":"10.1145\/2810103.2813707"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76900-2_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"K Aoki","year":"2007","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A kilobit special number field sieve factorization. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 1\u201312. Springer, Heidelberg (2007). doi:\n                      10.1007\/978-3-540-76900-2_1"},{"key":"8_CR4","unstructured":"Ball, J., Borger, J., Greenwald, G.: Revealed: how US and UK spy agencies defeat internet privacy and security. The Guardian, 5 September 2013. \n                      https:\/\/www.theguardian.com\/world\/2013\/sep\/05\/nsa-gchq-encryption-codes-security"},{"key":"8_CR5","unstructured":"Barbulescu, R.: Algorithmes de logarithmes discrets dans les corps finis. Ph.D. thesis, Universit\u00e9 de Lorraine, France (2013)"},{"key":"8_CR6","unstructured":"Barker, E., Roginsky, A.: Transitions: recommendation for transitioning the use of cryptographic algorithms and key lengths. Technical report, National Institute of Standards and Technology (2011). \n                      http:\/\/nvlpubs.nist.gov\/nistpubs\/Legacy\/SP\/nistspecialpublication800-131a.pdf"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0895479892230031","volume":"15","author":"B Beckerman","year":"1994","unstructured":"Beckerman, B., Labahn, G.: A uniform approach for the fast computation of matrix-type Pad\u00e9 approximants. SIAM J. Matrix Anal. Appl. 15(3), 804\u2013823 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-27152-1_6","volume-title":"Security Standardisation Research","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J., Chou, T., Chuengsatiansup, C., H\u00fclsing, A., Lambooij, E., Lange, T., Niederhagen, R., van Vredendaal, C.: How to manipulate curve standards: a white paper for the black hat \n                      http:\/\/bada55.cr.yp.to\n                      \n                    . In: Chen, L., Matsuo, S. (eds.) SSR 2015. LNCS, vol. 9497, pp. 109\u2013139. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27152-1_6"},{"key":"8_CR9","unstructured":"Checkoway, S., Fredrikson, M., Niederhagen, R., Everspaugh, A., Green, M., Lange, T., Ristenpart, T., Bernstein, D.J., Maskiewicz, J., Shacham, H.: On the practical exploitability of Dual EC in TLS implementations. In: Fu, K. (ed.) Proceedings of USENIX Security 2014, pp. 319\u2013335. USENIX, August 2014"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Checkoway, S., Maskiewicz, J., Garman, C., Fried, J., Cohney, S., Green, M., Heninger, N., Weinmann, R.-P., Rescorla, E., Shacham, H.: A systematic analysis of the juniper dual EC incident. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 468\u2013479. ACM Press (2016)","DOI":"10.1145\/2976749.2978395"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11745853_12","volume-title":"Public Key Cryptography - PKC 2006","author":"A Commeine","year":"2006","unstructured":"Commeine, A., Semaev, I.: An algorithm to solve the discrete logarithm problem with the number field sieve. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 174\u2013190. Springer, Heidelberg (2006). doi:\n                      10.1007\/11745853_12"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00198464","volume":"6","author":"D Coppersmith","year":"1993","unstructured":"Coppersmith, D.: Modifications to the number field sieve. J. Cryptol. 6(3), 169\u2013180 (1993)","journal-title":"J. Cryptol."},{"issue":"205","key":"8_CR13","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving linear equations over GF(2) via block Wiedemann algorithm. Math. Comp. 62(205), 333\u2013350 (1994)","journal-title":"Math. Comp."},{"key":"8_CR14","unstructured":"Denis, T.S.: LibTomCrypt. \n                      http:\/\/www.libtom.net\/"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-47555-9_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201992","author":"Y Desmedt","year":"1993","unstructured":"Desmedt, Y., Landrock, P., Lenstra, A.K., McCurley, K.S., Odlyzko, A.M., Rueppel, R.A., Smid, M.E.: The Eurocrypt\u201992 controversial issue trapdoor primes and moduli. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 194\u2013199. Springer, Heidelberg (1993). doi:\n                      10.1007\/3-540-47555-9_17"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Durumeric, Z., Adrian, D., Mirian, A., Bailey, M., Halderman, J.A.: A search engine backed by internet-wide scanning. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015: 22nd Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015, pp. 542\u2013553. ACM Press (2015)","DOI":"10.1145\/2810103.2813703"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00145-010-9057-y","volume":"24","author":"A Enge","year":"2011","unstructured":"Enge, A., Gaudry, P., Thom\u00e9, E.: An \n                      \n                        \n                      \n                      $${L}(1\/3)$$\n                     discrete logarithm algorithm for low degree curves. J. Cryptol. 24(1), 24\u201341 (2011)","journal-title":"J. Cryptol."},{"key":"8_CR18","unstructured":"Friedl, M., Provos, N., de Raadt, T., Steves, K., Miller, D., Tucker, D., McIntyre, J., Rice, T., Lindstrom, B.: Announce: OpenSSH 7.0 released, August 2015. \n                      http:\/\/www.openssh.com\/txt\/release-7.0"},{"key":"8_CR19","unstructured":"Gillmor, D.K.: Negotiated FFDHE for TLS, August 2016. \n                      https:\/\/datatracker.ietf.org\/doc\/rfc7919\/"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Giorgi, P., Lebreton, R.: Online order basis algorithm and its impact on the block Wiedemann algorithm. In: ISSAC 2014, pp. 202\u2013209. ACM (2014)","DOI":"10.1145\/2608628.2608647"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-48071-4_5","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"DM Gordon","year":"1993","unstructured":"Gordon, D.M.: Designing and detecting trapdoors for discrete log cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 66\u201375. Springer, Heidelberg (1993). doi:\n                      10.1007\/3-540-48071-4_5"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"DM Gordon","year":"1993","unstructured":"Gordon, D.M.: Discrete logarithms in GF\n                      \n                        \n                      \n                      $$(p)$$\n                     using the number field sieve. SIAM J. Discret. Math. 6(1), 124\u2013138 (1993)","journal-title":"SIAM J. Discret. Math."},{"issue":"242","key":"8_CR23","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method. Math. Comp. 72(242), 953\u2013967 (2003)","journal-title":"Math. Comp."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1142\/9789814719261_0008","volume-title":"Contemporary Developments in Finite Fields and Applications","author":"A Joux","year":"2016","unstructured":"Joux, A., Pierrot, C.: Nearly sparse linear algebra and application to discrete logarithms computations. In: Canteaut, A., Effinger, G., Huczynska, S., Panario, D., Storme, L. (eds.) Contemporary Developments in Finite Fields and Applications, pp. 119\u2013144. World Scientific Publishing Company, Singapore (2016)"},{"key":"8_CR25","unstructured":"Juniper Networks: 2015\u201312 Out of Cycle Security Bulletin: ScreenOS: Multiple Security issues with ScreenOS (CVE-2015-7755, CVE-2015-7756), December 2015"},{"issue":"210","key":"8_CR26","first-page":"777","volume":"64","author":"E Kaltofen","year":"1995","unstructured":"Kaltofen, E.: Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comp. 64(210), 777\u2013806 (1995)","journal-title":"Math. Comp."},{"key":"8_CR27","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":"8_CR28","unstructured":"Kleinjung, T., Diem, C., Lenstra, A.K., Priplata, C., Stahlke, C.: Discrete logarithms in GF(p) - 768 bits. E-mail on the NMBRTHRY mailing list, 16 June 2016"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Kolkman, O.M., Mekking, W.M., Gieben, R.M.: DNSSEC Operational Practices, Version 2. RFC 6781, Internet Society, December 2012","DOI":"10.17487\/rfc6781"},{"key":"8_CR30","unstructured":"Larson, J., Perlroth, N., Shane, S.: Revealed: the NSA\u2019s secret campaign to crack, undermine internet security. ProPublica, 5 September 2013. \n                      https:\/\/www.propublica.org\/article\/the-nsas-secret-campaign-to-crack-undermine-internet-encryption"},{"key":"8_CR31","unstructured":"Lenstra, A.K.: Constructing trapdoor primes for the proposed DSS. Technical report (1991). \n                      https:\/\/infoscience.epfl.ch\/record\/164559"},{"key":"8_CR32","series-title":"Lecture Notes in Mathematics","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993)"},{"key":"8_CR33","unstructured":"Lepinski, M., Kent, S.: Additional Diffie-Hellman groups for use with IETF standards (2010). \n                      http:\/\/ietf.org\/rfc\/rfc5114.txt"},{"key":"8_CR34","unstructured":"Lim, C.H., Lee, P.J.: Generating efficient primes for discrete log cryptosystems (2006). \n                      http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.43.8261"},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1515\/156939203321669546","volume":"13","author":"DV Matyukhin","year":"2003","unstructured":"Matyukhin, D.V.: On asymptotic complexity of computing discrete logarithms over \n                      \n                        \n                      \n                      $${GF}(p)$$\n                    . Discret. Math. Appl. 13(1), 27\u201350 (2003)","journal-title":"Discret. Math. Appl."},{"key":"8_CR36","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"8_CR37","unstructured":"Murphy, B.A.: Polynomial selection for the number field sieve integer factorisation algorithm. Ph.D. thesis, Australian National University (1999)"},{"key":"8_CR38","unstructured":"National Institute of Standards and Technology: Supplemental ITL bulletin for september 2013:NIST opens draft special publication 800\u201390A, recommendation for random number generation using deterministic random bit generators, for review and comment. \n                      http:\/\/csrc.nist.gov\/publications\/nistbul\/itlbul2013_09_supplemental.pdf"},{"key":"8_CR39","unstructured":"National Institute of Standards and Technology: Examples for NIST 800\u201356A (2006). \n                      http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/documents\/KS_FFC_Prime.pdf"},{"key":"8_CR40","unstructured":"National Institute of Standards and Technology: Digital signature standard (DSS, FIPS-186-4). Fourth revision (2013)"},{"key":"8_CR41","unstructured":"National Institute of Standards and Technology: Recommendation for pair-wise key establishment schemes using discrete logarithm cryptography, SP 800\u201356A, Second revision (2013)"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Orman, H.: The Oakley key determination protocol. RFC 2412, November 1998","DOI":"10.17487\/rfc2412"},{"key":"8_CR43","unstructured":"Perlroth, N., Larson, J., Shane, S.: N.S.A. able to foil basic safeguards of privacy on Web. The New York Times, 5 September 2013. \n                      http:\/\/www.nytimes.com\/2013\/09\/06\/us\/nsa-foils-much-internet-encryption.html"},{"key":"8_CR44","first-page":"89","volume-title":"Computational Methods in Number Theory Mathematical Center Tracts","author":"C Pomerance","year":"1982","unstructured":"Pomerance, C.: Analysis and comparison of some integer factoring algorithms. In: Lenstra Jr., H.W., Tijdeman, R. (eds.) Computational Methods in Number Theory Mathematical Center Tracts, vol. 154, pp. 89\u2013140. Mathematisch Centrum, Amsterdam (1982)"},{"issue":"7","key":"8_CR45","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/129902.129905","volume":"35","author":"R Rivest","year":"1992","unstructured":"Rivest, R., Hellman, M., Anderson, J.C., Lyons, J.W.: Responses to NIST\u2019s proposal. CACM 35(7), 41\u201354 (1992)","journal-title":"CACM"},{"issue":"1676","key":"8_CR46","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philos. Trans. Roy. Soc. Lond. Ser. A 345(1676), 409\u2013423 (1993)","journal-title":"Philos. Trans. Roy. Soc. Lond. Ser. A"},{"key":"8_CR47","unstructured":"Scott, M.: Re: NIST announces set of elliptic curves. sci.crypt newsgroup posting dated 1999\/06\/17. \n                      https:\/\/groups.google.com\/forum\/message\/raw?msg=sci.crypt\/mFMukSsORmI\/FpbHDQ6hM_MJ"},{"issue":"237","key":"8_CR48","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1090\/S0025-5718-00-01308-9","volume":"71","author":"IA Semaev","year":"2002","unstructured":"Semaev, I.A.: Special prime numbers and discrete logs in finite prime fields. Math. Comput. 71(237), 363\u2013377 (2002)","journal-title":"Math. Comput."},{"key":"8_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-48071-4_6","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"ME Smid","year":"1993","unstructured":"Smid, M.E., Branstad, D.K.: Response to comments on the NIST proposed digital signature standard. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 76\u201388. Springer, Heidelberg (1993). doi:\n                      10.1007\/3-540-48071-4_6"},{"key":"8_CR50","unstructured":"SSL Labs: SSL pulse. \n                      https:\/\/www.trustworthyinternet.org\/ssl-pulse\/"},{"key":"8_CR51","unstructured":"The CADO-NFS Development Team: CADO-NFS, an implementation of the number field sieve algorithm. Development version (prior to release 2.3) (2016). \n                      http:\/\/cado-nfs.gforge.inria.fr\/"},{"issue":"5","key":"8_CR52","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1006\/jsco.2002.0533","volume":"33","author":"E Thom\u00e9","year":"2002","unstructured":"Thom\u00e9, E.: Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. J. Symb. Comput. 33(5), 757\u2013775 (2002)","journal-title":"J. Symb. Comput."},{"key":"8_CR53","unstructured":"Valenta, L., Adrian, D., Sanso, A., Cohney, S., Fried, J., Hastings, M., Halderman, J.A., Heninger, N.: The most dangerous groups in the world: exploiting DSA groups for Diffie-Hellman (2016)"},{"key":"8_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201996","author":"A Young","year":"1996","unstructured":"Young, A., Yung, M.: The dark side of \u201cBlack-Box\u201d cryptography or: should we trust Capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 89\u2013103. Springer, Heidelberg (1996). doi:\n                      10.1007\/3-540-68697-5_8"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56620-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T00:04:41Z","timestamp":1586477081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56620-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566191","9783319566207"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56620-7_8","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":"1 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"30 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt2017.di.ens.fr\/","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"}]}}