{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:07:45Z","timestamp":1742976465185,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648367"},{"type":"electronic","value":"9783030648374"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64837-4_28","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T16:02:55Z","timestamp":1607184175000},"page":"851-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Packed Multiplication: How to Amortize the Cost of Side-Channel Masking?"],"prefix":"10.1007","author":[{"given":"Weijia","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga\u00ebtan","family":"Cassiers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13389-018-00202-2","volume":"10","author":"G Barthe","year":"2019","unstructured":"Barthe, G., et al.: Improved parallel mask refreshing algorithms: generic solutions with parametrized non-interference and automated optimizations. J. Crypt. Eng. 10(1), 17\u201326 (2019). https:\/\/doi.org\/10.1007\/s13389-018-00202-2","journal-title":"J. Crypt. Eng."},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) CCS 2016, pp. 116\u2013129. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978427","DOI":"10.1145\/2976749.2978427"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-56620-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"G Barthe","year":"2017","unstructured":"Barthe, G., Dupressoir, F., Faust, S., Gr\u00e9goire, B., Standaert, F.-X., Strub, P.-Y.: Parallel implementations of masking schemes and the bounded moment leakage model. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 535\u2013566. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_19"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-53140-2_2","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"A Battistello","year":"2016","unstructured":"Battistello, A., Coron, J.-S., Prouff, E., Zeitoun, R.: Horizontal side-channel attacks and countermeasures on the ISW masking scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 23\u201339. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_2"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-662-49896-5_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Bela\u00efd","year":"2016","unstructured":"Bela\u00efd, S., Benhamouda, F., Passel\u00e8gue, A., Prouff, E., Thillard, A., Vergnaud, D.: Randomness complexity of private circuits for multiplication. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 616\u2013648. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_22"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-319-63697-9_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Bela\u00efd","year":"2017","unstructured":"Bela\u00efd, S., Benhamouda, F., Passel\u00e8gue, A., Prouff, E., Thillard, A., Vergnaud, D.: Private multiplication over finite fields. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 397\u2013426. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_14"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-662-48324-4_20","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"S Bela\u00efd","year":"2015","unstructured":"Bela\u00efd, S., Coron, J.-S., Fouque, P.-A., G\u00e9rard, B., Kammerer, J.-G., Prouff, E.: Improved side-channel analysis of finite-field multiplication. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 395\u2013415. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_20"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-662-45608-8_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Bela\u00efd","year":"2014","unstructured":"Bela\u00efd, S., Fouque, P.-A., G\u00e9rard, B.: Side-channel analysis of multiplications in GF(2128). In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 306\u2013325. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_17"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-03329-3_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"S Bela\u00efd","year":"2018","unstructured":"Bela\u00efd, S., Goudarzi, D., Rivain, M.: Tight private circuits: achieving probing security with the least refreshing. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 343\u2013372. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_12"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. J. Crypt. 21(4), 469\u2013491 (2008). https:\/\/doi.org\/10.1007\/s00145-008-9026-x","DOI":"10.1007\/s00145-008-9026-x"},{"key":"28_CR11","first-page":"438","volume":"2018","author":"G Cassiers","year":"2018","unstructured":"Cassiers, G., Standaert, F.: Improved bitslice masking: from optimized non-interference to probe isolation. IACR Crypt. ePrint Arch. 2018, 438 (2018)","journal-title":"IACR Crypt. ePrint Arch."},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.: Towards globally optimized masking: From low randomness to low noise rate or probe isolating multiplications with reduced randomness and security against horizontal attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(2), 162\u2013198 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.162-198","DOI":"10.13154\/tches.v2019.i2.162-198"},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.: Trivially and efficiently composing masked gadgets with probe isolating non-interference. IEEE Trans. Inf. Forensics Secur. 15, 2542\u20132555 (2020). https:\/\/doi.org\/10.1109\/TIFS.2020.2971153","DOI":"10.1109\/TIFS.2020.2971153"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-48405-1_26","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"S Chari","year":"1999","unstructured":"Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 398\u2013412. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_26"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-45727-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J-S Coron","year":"2020","unstructured":"Coron, J.-S., Greuet, A., Zeitoun, R.: Side-channel masking with pseudo-random generator. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 342\u2013375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_12"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-55220-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Duc","year":"2014","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 423\u2013440. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_24"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-319-70694-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Faust","year":"2017","unstructured":"Faust, S., Paglialonga, C., Schneider, T.: Amortizing randomness complexity in private circuits. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 781\u2013810. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_27"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-56620-7_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Goudarzi","year":"2017","unstructured":"Goudarzi, D., Rivain, M.: How fast can higher-order masking be in software? In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 567\u2013597. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_20"},{"key":"28_CR20","doi-asserted-by":"publisher","unstructured":"Gro\u00df, H., Mangard, S., Korak, T.: Domain-oriented masking: compact masked hardware implementations with arbitrary protection order. In: Bilgin, B., Nikova, S., Rijmen, V. (eds.) ACM 2016, p. 3. ACM (2016). https:\/\/doi.org\/10.1145\/2996366.2996426","DOI":"10.1145\/2996366.2996426"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-78375-8_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"V Grosso","year":"2018","unstructured":"Grosso, V., Standaert, F.-X.: Masking proofs are tight and how to exploit it in security evaluations. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 385\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_13"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-40349-1_23","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"V Grosso","year":"2013","unstructured":"Grosso, V., Standaert, F.-X., Faust, S.: Masking vs. multiparty computation: how large is the gap for AES? In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 400\u2013416. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_23"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-74143-5_23","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"S Halevi","year":"2007","unstructured":"Halevi, S.: Invertible universal hashing and the TET encryption mode. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 412\u2013429. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_23"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Horner, W.G.: XXI. a new method of solving numerical equations of all orders, by continuous approximation. Philos. Trans. Roy. Soc. Lond. 109, 308\u2013335 (1819)","DOI":"10.1098\/rstl.1819.0023"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-39206-1_49","volume-title":"Automata, Languages, and Programming","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., et al.: Robust pseudorandom generators. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 576\u2013588. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_49"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-66787-4_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"A Journault","year":"2017","unstructured":"Journault, A., Standaert, F.-X.: Very high order masking: efficient implementation and security evaluation. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 623\u2013643. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_30"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-030-03329-3_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"P Karpman","year":"2018","unstructured":"Karpman, P., Roche, D.S.: New instantiations of the CRYPTO 2017 masking schemes. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 285\u2013314. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_10"},{"key":"28_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-23951-9_7","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"HS Kim","year":"2011","unstructured":"Kim, H.S., Hong, S., Lim, J.: A fast and provably secure higher-order masking of AES S-Box. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 95\u2013107. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_7"},{"key":"28_CR30","unstructured":"McGrew, D.A., Viega, J.: The Galois\/Counter mode of operation (GCM). http:\/\/luca-giuzzi.unibs.it\/corsi\/Support\/papers-cryptography\/gcm-spec.pdf"},{"key":"28_CR31","unstructured":"Naor, M., Reingold, O.: A pseudo-random encryption mode"},{"key":"28_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-89641-0_3","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"H Oshida","year":"2018","unstructured":"Oshida, H., Ueno, R., Homma, N., Aoki, T.: On masked galois-field multiplication for authenticated encryption resistant to side channel analysis. In: Fan, J., Gierlichs, B. (eds.) COSADE 2018. LNCS, vol. 10815, pp. 44\u201357. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89641-0_3"},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38348-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"E Prouff","year":"2013","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 142\u2013159. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_9"},{"issue":"2","key":"28_CR34","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"28_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-15031-9_28","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"M Rivain","year":"2010","unstructured":"Rivain, M., Prouff, E.: Provably secure higher-order masking of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 413\u2013427. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_28"},{"issue":"1","key":"28_CR36","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02410779","volume":"39","author":"B Segre","year":"1955","unstructured":"Segre, B.: Curve razionali normali ek-archi negli spazi finiti. Annali di Matematica Pura ed Applicata 39(1), 357\u2013379 (1955)","journal-title":"Annali di Matematica Pura ed Applicata"},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"103961","DOI":"10.1109\/ACCESS.2019.2930986","volume":"7","author":"SC Seo","year":"2019","unstructured":"Seo, S.C., Kim, H.: SCA-resistant GCM implementation on 8-bit AVR microcontrollers. IEEE Access 7, 103961\u2013103978 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2930986","journal-title":"IEEE Access"},{"key":"28_CR38","doi-asserted-by":"publisher","unstructured":"Wang, W., M\u00e9aux, P., Cassiers, G., Standaert, F.: Efficient and private computations with code-based masking. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(2), 128\u2013171 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i2.128-171","DOI":"10.13154\/tches.v2020.i2.128-171"},{"key":"28_CR39","doi-asserted-by":"publisher","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90033-7","DOI":"10.1016\/0022-0000(81)90033-7"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64837-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:30:31Z","timestamp":1710354631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64837-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648367","9783030648374"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64837-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2020\/","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 (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference will take place virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}