{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:07Z","timestamp":1774976167600,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030129415","type":"print"},{"value":"9783030129422","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-12942-2_29","type":"book-chapter","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T08:26:50Z","timestamp":1549355210000},"page":"376-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Vulnerabilities of the McEliece Variants Based on Polar Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-9097","authenticated-orcid":false,"given":"Vlad","family":"Dr\u0103goi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8185-956X","authenticated-orcid":false,"given":"Valeriu","family":"Beiu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9260-9387","authenticated-orcid":false,"given":"Dominic","family":"Bucerzan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"issue":"7","key":"29_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Ar\u0131kan","year":"2009","unstructured":"Ar\u0131kan, E.: Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246\u2013262. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-85855-3_17"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proceedings of the IEEE International Symposium on Information Theory - ISIT, Nice, France, pp. 2591\u20132595, June 2007","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-29360-8_9","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2016","unstructured":"Bardet, M., Chaulet, J., Dragoi, V., Otmani, A., Tillich, J.-P.: Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 118\u2013143. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29360-8_9"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Bardet, M., Dragoi, V., Otmani, A., Tillich, J.P.: Algebraic properties of polar codes from a new polynomial formalism. In: Proceedings of the IEEE International Symposium on Information Theory - ISIT, Barcelona, Spain, pp. 230\u2013234, July 2016","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2n\/20: How \n                    \n                      \n                    \n                    $$1+1=0$$\n                    \n                      \n                        \n                          1\n                          +\n                          1\n                          =\n                          0\n                        \n                      \n                    \n                   improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 143\u2013158. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-19574-7_10"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-69284-5_10","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"D Bucerzan","year":"2017","unstructured":"Bucerzan, D., Dragoi, V., Kalachi, H.T.: Evolution of the McEliece public key encryption scheme. In: Farshim, P., Simion, E. (eds.) SecITC 2017. LNCS, vol. 10543, pp. 129\u2013149. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-69284-5_10"},{"key":"29_CR10","unstructured":"Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece\u2019s cryptosystem. In: Proceedings of the International Symposium on Coding Theory and Applications - EUROCODE 1994, pp. 169\u2013173 (1994)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto-Torres","year":"2016","unstructured":"Canto-Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"key":"29_CR12","unstructured":"Chen, L., et al.: Report on post-quantum cryptography. Technical Report, National Institute of Standards and Technology (2016)"},{"issue":"5","key":"29_CR13","first-page":"273","volume":"24","author":"IV Chizhov","year":"2014","unstructured":"Chizhov, I.V., Borodin, M.A.: Effective attack on the McEliece cryptosystem based on Reed-Muller codes. Discrete Math. Appl. 24(5), 273\u2013280 (2014)","journal-title":"Discrete Math. Appl."},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Uma\u00f1a, V., Otmani, A., Tillich, J.P.: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Des. Codes Crypt. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Crypt."},{"key":"29_CR15","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.: A new signature scheme based on \n                    \n                      \n                    \n                    $$(u | u+v)$$\n                    \n                      \n                        \n                          (\n                          u\n                          |\n                          u\n                          +\n                          v\n                          )\n                        \n                      \n                    \n                   codes. CoRR abs\/1706.08065 (2017). \n                    http:\/\/arxiv.org\/abs\/1706.08065"},{"key":"29_CR16","unstructured":"Dragoi, V.: Algebraic approach for the study of algorithmic problems coming from cryptography and the theory of error correcting codes. Ph.D. thesis, Universit\u00e9 de Rouen, France, July 2017"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V., Richmond, T., Bucerzan, D., Legay, A.: Survey on cryptanalysis of code-based cryptography: From theoretical to physical attacks. In: International Conference on Computers Communications and Control - ICCCC, Oradea, Romania, pp. 215\u2013223, May 2018","DOI":"10.1109\/ICCCC.2018.8390461"},{"issue":"1","key":"29_CR18","first-page":"17","volume":"25","author":"I Dumer","year":"1989","unstructured":"Dumer, I.: Two decoding algorithms for linear codes. Prob. Inf. Transm. 25(1), 17\u201323 (1989)","journal-title":"Prob. Inf. Transm."},{"issue":"10","key":"29_CR19","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"JC Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/TIT.2015.2493539","volume":"62","author":"JC Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.P.: Folding alternant and Goppa codes with non-trivial automorphism groups. IEEE Trans. Inf. Theory 62(1), 184\u2013198 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-015-0036-z","volume":"79","author":"JC Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.P.: Structural cryptanalysis of McEliece schemes with compact keys. Des. Codes Crypt. 79(1), 87\u2013112 (2016)","journal-title":"Des. Codes Crypt."},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-662-45611-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J-C Faug\u00e8re","year":"2014","unstructured":"Faug\u00e8re, J.-C., Perret, L., de Portzamparc, F.: Algebraic attack against variants of McEliece with Goppa polynomial of a special form. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 21\u201341. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-45611-8_2"},{"issue":"6","key":"29_CR23","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6), 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Shooshtari, M.K., Eghlidos, T., Aref, M.: Reducing the key length of McEliece cryptosystem using polar codes. In: International ISC Conference on Information Security and Cryptology - ISCISC, Teheran, Iran, pp. 104\u2013108, September 2014","DOI":"10.1109\/ISCISC.2014.6994031"},{"issue":"3","key":"29_CR25","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Crypt. 8(3), 293\u2013307 (1996)","journal-title":"Des. Codes Crypt."},{"key":"29_CR26","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)","edition":"5"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                    \n                      \n                    \n                    $$\\tilde{\\cal{O}}(2^{0.054n})$$\n                    \n                      \n                        \n                          \n                            O\n                            ~\n                          \n                          \n                            (\n                            \n                              2\n                              \n                                0.054\n                                n\n                              \n                            \n                            )\n                          \n                        \n                      \n                    \n                  . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"29_CR29","unstructured":"McEliece, R.J.: A puclic-key system based on algebraic theory, pp. 114\u2013116. The Deep Space Network Progress Report, DSN PR 42\u201344, January 1978. \n                    https:\/\/tmo.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-72540-4_20"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes. In: Proceedings of the IEEE International Symposium Information Theory - ISIT, Istanbul, Turkey, pp. 2069\u20132073, July 2013","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"29_CR32","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"29_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-18681-8_14","volume-title":"Codes, Cryptology, and Information Security","author":"A Otmani","year":"2015","unstructured":"Otmani, A., Kalachi, H.T.: Square code attack on a modified Sidelnikov cryptosystem. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 173\u2013183. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-18681-8_14"},{"key":"29_CR34","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-88702-7_4","volume-title":"Post-Quantum Cryptography","author":"R Overbeck","year":"2009","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95\u2013145. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88702-7_4"},{"issue":"2","key":"29_CR35","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/jmc-2011-0099","volume":"6","author":"E Persichetti","year":"2012","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptology 6(2), 149\u2013169 (2012)","journal-title":"J. Math. Cryptology"},{"issue":"5","key":"29_CR36","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"2","key":"29_CR37","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"29_CR38","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/S0895480195294027","volume":"10","author":"N Sendrier","year":"1997","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM J. Discrete Math. 10, 282\u2013293 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"29_CR39","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-1-4757-3585-7_10","volume-title":"Information, Coding and Mathematics","author":"N Sendrier","year":"2002","unstructured":"Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds.) Information, Coding and Mathematics, vol. 687, pp. 141\u2013163. Springer, Boston (2002). \n                    https:\/\/doi.org\/10.1007\/978-1-4757-3585-7_10"},{"key":"29_CR40","unstructured":"Sendrier, N.: On the use of structured codes in code based cryptography. In: Coding Theory and Cryptography III, pp. 59\u201368 (2010)"},{"key":"29_CR41","doi-asserted-by":"crossref","unstructured":"Shrestha, S.R., Kim, Y.S.: New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In: International Symposium on Communication and Information Technologies - ISCIT, Incheon, Korea, pp. 368\u2013372, September 2014","DOI":"10.1109\/ISCIT.2014.7011934"},{"issue":"3","key":"29_CR42","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosytem based on Reed-Muller codes. Discrete Math. Appl. 4(3), 191\u2013207 (1994)","journal-title":"Discrete Math. Appl."},{"key":"29_CR43","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. IACR Cryptology ePrint Archive, Report 2009\/452 (2009)","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12942-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:39:57Z","timestamp":1558478397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12942-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129415","9783030129422"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12942-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SECITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security for Information Technology and Communications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Three papers of invited keynote speakers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}