{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:15:35Z","timestamp":1768277735421,"version":"3.49.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319552262","type":"print"},{"value":"9783319552279","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-55227-9_1","type":"book-chapter","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T11:32:52Z","timestamp":1488972772000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Brief History of Pairings"],"prefix":"10.1007","author":[{"given":"Razvan","family":"Barbulescu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"1_CR1","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., Zanella-B\u00e9guelin, S., Zimmermann, P.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security-CCS 2015, pp. 5\u201317. ACM, New York (2015)","DOI":"10.1145\/2810103.2813707"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Adleman, L.M.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In: 20th Annual Symposium on Foundations of Computer Science, pp. 55\u201360. IEEE (1979)","DOI":"10.1109\/SFCS.1979.2"},{"issue":"203","key":"1_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A Oliver","year":"1993","unstructured":"Oliver, A., Atkin, L., Morain, F.: Elliptic curves and primality proving. Math. Comput. 61(203), 29\u201368 (1993)","journal-title":"Math. Comput."},{"key":"1_CR4","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Discrete logarithms in GF(\n$$p^2$$\n) \u2013 160 digits (2014). Announcement available at the NMBRTHRY archives, item 004706"},{"key":"1_CR5","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: New record in \n$$\\mathbb{F}_{p^3}$$\n (2015). https:\/\/webusers.imj-prg.fr\/~razvan.barbaud\/p3dd52.pdf"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46800-5_6"},{"key":"1_CR7","unstructured":"Bouvier, C., Gaudry, P., Imbert, L., Jeljeli, H., Thom\u00e9, E.: Discrete logarithms in GF(p) \u2013 180 digits (2014). Announcement available at the NMBRTHRY archives, item 004703"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55220-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1\u201316. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-55220-5_1"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 31\u201355. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48800-3_2"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44598-6_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Biehl","year":"2000","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 131\u2013146. Springer, Heidelberg (2000). doi:10.1007\/3-540-44598-6_8"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). doi:10.1007\/11693383_22"},{"key":"1_CR12","unstructured":"Br\u00f6ker, R.: Constructing elliptic curves of prescribed order. Ph.D. thesis, Leiden University (2006). http:\/\/www.math.leidenuniv.nl\/~reinier\/thesis.pdf"},{"key":"1_CR13","unstructured":"Cocks, C., Pinch, R.G.E.: Identity-based cryptosystems based on the Weil pairing. Unpublished manuscript, 170 (2001)"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00145-004-0219-7","volume":"18","author":"R Dupont","year":"2005","unstructured":"Dupont, R., Enge, A., Morain, F.: Building curves with arbitrary small mov degree over finite prime fields. J. Cryptol. 18(2), 79\u201389 (2005)","journal-title":"J. Cryptol."},{"issue":"206","key":"1_CR15","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning \n$$m$$\n-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62(206), 865\u2013874 (1994)","journal-title":"Math. Comput."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38348-9_1"},{"key":"1_CR18","unstructured":"Gaudry, P., Guillevic, A., Morain, F.: Discrete logarithm record in GF(\n$$p^3$$\n) of 592 bits (180 decimal digits) (2016). Announcement available at the NMBRTHRY archives, item 004706"},{"issue":"A","key":"1_CR19","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1112\/S1461157016000164","volume":"19","author":"Pierrick Gaudry","year":"2016","unstructured":"Gaudry, P., Gr\u00e9my, L., Videau, M.: Collecting relations for the number field sieve in GF(\n$$p^6$$\n) (2016). Accepted for publication at ANTS-XII, Kaiserslautern","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"1_CR20","unstructured":"Hayasaka, K., Aoki, K., Kobayashi, T., Takagi, T.: A construction of 3-dimensional lattice sieve for number field sieve over GF(\n$$p^n$$\n). Cryptology ePrint Archive, Report 2015\/1179 (2015). http:\/\/eprint.iacr.org\/2014\/300"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-20901-7_11","volume-title":"Coding and Cryptology","author":"K Hayasaka","year":"2011","unstructured":"Hayasaka, K., Takagi, T.: An experiment of number field sieve over GF(p) of low hamming weight characteristic. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 191\u2013200. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20901-7_11"},{"key":"1_CR22","unstructured":"Jeong, J., Kim, T.: Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. Cryptology ePrint Archive, Report 2016\/526 (2016). http:\/\/eprint.iacr.org\/2016\/526"},{"issue":"242","key":"1_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 for discrete logarithms in prime fields. Math. Comput. 72(242), 953\u2013967 (2003)","journal-title":"Math. Comput."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/11818175_19","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Joux","year":"2006","unstructured":"Joux, A., Lercier, R., Smart, N., Vercauteren, F.: The number field sieve in the medium prime case. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 326\u2013344. Springer, Heidelberg (2006). doi:10.1007\/11818175_19"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). doi:10.1007\/10722028_23"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"A Joux","year":"2013","unstructured":"Joux, A.: Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 177\u2013193. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-38348-9_11"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-04873-4_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","author":"A Joux","year":"2014","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in \n$$\\mathbb{F}_{p^{n}}$$\n - application to pairing-friendly constructions. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol. 8365, pp. 45\u201361. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-04873-4_3"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53018-4_20"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-662-45611-8_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"T Kleinjung","year":"2014","unstructured":"Kleinjung, T., Bos, J.W., Lenstra, A.K.: Mersenne factorization factory. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 358\u2013377. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-45611-8_19"},{"key":"1_CR30","unstructured":"Kleinjung, T., Diem, C., Lenstra, A.K., Priplata, C., Stahlke, C.: Discrete logarithms in GF(p) \u2013 768 bits (2016). Announcement available at the NMBRTHRY archives, item 004917"},{"key":"1_CR31","unstructured":"Kleinjung, T.: Discrete logarithms in GF(p) \u2013 160 digits (2007). Announcement available at the NMBRTHRY archives, item 003269"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). doi:10.1007\/11586821_2"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45682-1_5","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"AK Lenstra","year":"2001","unstructured":"Lenstra, A.K.: Unbelievable security matching AES security using public key systems. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 67\u201386. Springer, Heidelberg (2001). doi:10.1007\/3-540-45682-1_5"},{"issue":"4","key":"1_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"1_CR35","first-page":"121","volume":"9","author":"D Matyukhin","year":"2006","unstructured":"Matyukhin, D.: Effective version of the number field sieve for discrete logarithms in the field GF\n$$(p^k)$$\n. Trudy po Discretnoi Matematike 9, 121\u2013151 (2006). (in Russian)","journal-title":"Trudy po Discretnoi Matematike"},{"issue":"4","key":"1_CR36","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The weil pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"issue":"5","key":"1_CR37","first-page":"1234","volume":"84","author":"A Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-46416-6_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1991","author":"F Morain","year":"1991","unstructured":"Morain, F.: Building cyclic elliptic curves modulo large primes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 328\u2013336. Springer, Heidelberg (1991). doi:10.1007\/3-540-46416-6_28"},{"issue":"5","key":"1_CR39","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"143","key":"1_CR40","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard, J.: Monte carlo methods for index computation \n$$(\\operatorname{mod} p)$$\n. Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"issue":"9","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TC.2006.134","volume":"55","author":"D Page","year":"2006","unstructured":"Page, D., Vercauteren, F.: A fault attack on pairing-based cryptography. IEEE Trans. Comput. 55(9), 1075\u20131080 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"231","key":"1_CR42","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O Schirokauer","year":"2000","unstructured":"Schirokauer, O.: Using number fields to compute logarithms in finite fields. Math. Comput. 69(231), 1267\u20131283 (2000)","journal-title":"Math. Comput."},{"issue":"237","key":"1_CR43","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1090\/S0025-5718-00-01308-9","volume":"71","author":"I Semaev","year":"2002","unstructured":"Semaev, I.: Special prime numbers and discrete logs in finite prime fields. Math. Comput. 71(237), 363\u2013377 (2002)","journal-title":"Math. Comput."},{"key":"1_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69904-2","volume-title":"The Arithmetic of Dynamical Systems","author":"JH Silverman","year":"2007","unstructured":"Silverman, J.H.: The Arithmetic of Dynamical Systems, vol. 241. Springer Science & Business Media, Heidelberg (2007)"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-49890-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 429\u2013458. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49890-3_17"},{"issue":"1940","key":"1_CR46","first-page":"592","volume":"210","author":"A Weil","year":"1940","unstructured":"Weil, A.: Sur les fonctions alg\u00e9briquesa corps de constantes fini. CR Acad. Sci. Paris 210(1940), 592\u2013594 (1940)","journal-title":"CR Acad. Sci. Paris"},{"issue":"1","key":"1_CR47","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D Wiedemann","year":"1986","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Trans. Inform. Theory 32(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1_CR48","first-page":"161","volume":"45","author":"P Zajac","year":"2010","unstructured":"Zajac, P.: On the use of the lattice sieve in the 3D NFS. Tatra Mt. Math. Publ. 45(1), 161\u2013172 (2010)","journal-title":"Tatra Mt. Math. Publ."}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55227-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:04:15Z","timestamp":1710345855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-55227-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319552262","9783319552279"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55227-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cage.ugent.be\/waifi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}