{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:12:15Z","timestamp":1778256735895,"version":"3.51.4"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031313677","type":"print"},{"value":"9783031313684","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-31368-4_5","type":"book-chapter","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T12:02:24Z","timestamp":1682942544000},"page":"114-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["POLKA: Towards Leakage-Resistant Post-quantum CCA-Secure Public Key Encryption"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Hoffmann","sequence":"first","affiliation":[]},{"given":"Beno\u00eet","family":"Libert","sequence":"additional","affiliation":[]},{"given":"Charles","family":"Momin","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Peters","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11426639_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Abe","year":"2005","unstructured":"Abe, M., Gennaro, R., Kurosawa, K., Shoup, V.: Tag-KEM\/DEM: a new framework for hybrid encryption and a new analysis of Kurosawa-Desmedt KEM. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 128\u2013146. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_8"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"M Albrecht","year":"2015","unstructured":"Albrecht, M., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"key":"5_CR3","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: USENIX Security Symposium (2016)"},{"key":"5_CR4","unstructured":"Avanzi, R., et al.: CRYSTALS-KYBER algorithm specifications and supporting documentation. NIST PQC Round 3, 42 (2020)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Azouaoui, M., Bronchain, O., Hoffmann, C., Kuzovkova, Y. , Schneider, T., Standaert, F.: Systematic study of decryption and re-encryption leakage: the case of kyber. In: COSADE (2022)","DOI":"10.1007\/978-3-030-99766-3_11"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Balasch, J., Gierlichs, B., Grosso, V., Reparaz, O., Standaert, F.: On the cost of lazy engineering for masked software implementations. In: CARDIS (2014)","DOI":"10.1007\/978-3-319-16763-3_5"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: CCS (2016)","DOI":"10.1145\/2976749.2978427"},{"key":"5_CR9","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":"5_CR10","first-page":"44","volume":"3","author":"A Basso","year":"2020","unstructured":"Basso, A., et al.: SABER algorithm specifications and supporting documentation. NIST PQC Round 3, 44 (2020)","journal-title":"NIST PQC Round"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3429983","volume":"17","author":"MV Beirendonck","year":"2021","unstructured":"Beirendonck, M.V., D\u2019Anvers, J., Karmakar, A., Balasch, J., Verbauwhede, I.: A side-channel-resistant implementation of SABER. ACM J. Emerg. Technol. Comput. Syst. 17(2), 1\u201326 (2021)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., Coron, J., Fouque, P., G\u00e9rard, B., Kammerer, J., Prouff, E.: Improved side-channel analysis of finite-field multiplication. In: CHES (2015)","DOI":"10.1007\/978-3-662-48324-4_20"},{"key":"5_CR13","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":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-030-56784-2_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Bellizia","year":"2020","unstructured":"Bellizia, D., et al.: Mode-level vs. implementation-level physical security in symmetric cryptography. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 369\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_13"},{"key":"5_CR15","unstructured":"Bernstein, D.J., Persichetti, E.: Towards KEM unification. Cryptology ePrint Archive, Report 2018\/526 (2018)"},{"key":"5_CR16","first-page":"2022","volume":"1","author":"F Berti","year":"2022","unstructured":"Berti, F., Bhasin, S., Breier, J., Hou, X., Poussier, R., Standaert, F., Udvarhelyi, B.: A finer-grain analysis of the leakage (non) resilience of OCB. IACR Trans. Cryptogr. Hardw. Embed. Syst. 1, 2022 (2022)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR17","first-page":"2021","volume":"3","author":"S Bhasin","year":"2021","unstructured":"Bhasin, S., D\u2019Anvers, J., Heinz, D., P\u00f6ppelmann, T., Beirendonck, M.V.: Attacking and defending masked polynomial comparison for lattice-based cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 3, 2021 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-030-03810-6_25","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: - new simple PRF candidates and their applications. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 699\u2013729. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. In: IEEE EuroS &P (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"5_CR21","first-page":"2021","volume":"4","author":"JW Bos","year":"2021","unstructured":"Bos, J.W., Gourjon, M., Renes, J., Schneider, T., van Vredendaal, C.: Masking KYBER: First- and higher-order implementations. IACR Trans. Cryptogr. Hardw. Embed. Syst. 4, 2021 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Bronchain, O., Cassiers, G.: Bitslicing arithmetic\/Boolean masking conversions for fun and profit with application to lattice-based kems (2022)","DOI":"10.46586\/tches.v2022.i4.553-588"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s13389-020-00241-8","volume":"11","author":"O Bronchain","year":"2021","unstructured":"Bronchain, O., Schneider, T., Standaert, F.: Reducing risks through simplicity: high side-channel security for lazy engineers. J. Cryptogr. Eng. 11(1), 39\u201355 (2021)","journal-title":"J. Cryptogr. Eng."},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.46586\/tches.v2021.i3.202-234","volume":"2021","author":"O Bronchain","year":"2021","unstructured":"Bronchain, O., Standaert, F.: Breaking masked implementations with many shares on 32-bit software platforms or when the security order does not matter. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3), 202\u2013234 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"10","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1109\/TC.2020.3022979","volume":"70","author":"G Cassiers","year":"2021","unstructured":"Cassiers, G., Gr\u00e9goire, B., Levi, I., Standaert, F.: Hardware private circuits: from trivial composition to full verification. IEEE Trans. Comput. 70(10), 1677\u20131690 (2021)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"136","DOI":"10.46586\/tches.v2021.i2.136-158","volume":"2021","author":"G Cassiers","year":"2021","unstructured":"Cassiers, G., Standaert, F.: Provably secure hardware masking in the transition- and glitch-robust probing model: better safe than sorry. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 136\u2013158 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR27","first-page":"41","volume":"3","author":"C Chen","year":"2020","unstructured":"Chen, C., et al.: NTRU algorithm specifications and supporting documentation. NIST PQC Round 3, 41 (2020)","journal-title":"NIST PQC Round"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Coron, J., Giraud, C., Prouff, E., Renner, S., Rivain, M., Vadnala, P.K.: Conversion of security proofs from one leakage model to another: a new issue. In: COSADE (2012)","DOI":"10.1007\/978-3-642-29912-4_6"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Coron, J., Prouff, E., Rivain, M., Roche, T.: Higher-order side channel security and mask refreshing. In: FSE (2013)","DOI":"10.1007\/978-3-662-43933-3_21"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.-P., Guo, Q., Johansson, T., Nilsson, A., Vercauteren, F., Verbauwhede, I.: Decryption failure attacks on IND-CCA secure lattice-based schemes. In: PKC (2019)","DOI":"10.1007\/978-3-030-17259-6_19"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-89339-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"J-P D\u2019Anvers","year":"2018","unstructured":"D\u2019Anvers, J.-P., Karmakar, A., Sinha Roy, S., Vercauteren, F.: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 282\u2013305. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_16"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"D\u2019Anvers, J.-P., Orsini, E., Vercauteren, F.: Error term checking: Towards chosen ciphertext security without re-encryption. In: AsiaPKC (2021)","DOI":"10.1145\/3457338.3458295"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-45727-3_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J-P D\u2019Anvers","year":"2020","unstructured":"D\u2019Anvers, J.-P., Rossi, M., Virdia, F.: (One) Failure Is Not an Option: bootstrapping the search for failures in\u00a0lattice-based encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 3\u201333. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_1"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., et al.: Isap v2.0. IACR Trans. Symmetric Cryptol. 2020(S1) (2020)","DOI":"10.46586\/tosc.v2020.iS1.390-416"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2: Lightweight authenticated encryption and hashing. J. Cryptol. 34(3), 33 (2021)","DOI":"10.1007\/s00145-021-09398-9"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-31271-2_14","volume-title":"Smart Card Research and Advanced Applications","author":"C Dobraunig","year":"2016","unstructured":"Dobraunig, C., Koeune, F., Mangard, S., Mendel, F., Standaert, F.-X.: Towards fresh and hybrid re-keying schemes with beyond birthday security. In: Homma, N., Medwed, M. (eds.) CARDIS 2015. LNCS, vol. 9514, pp. 225\u2013241. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31271-2_14"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46800-5_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Duc","year":"2015","unstructured":"Duc, A., Faust, S., Standaert, F.-X.: Making Masking Security Proofs Concrete. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 401\u2013429. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_16"},{"key":"5_CR38","unstructured":"Duman, J., H\u00f6velmanns, K., Kiltz, E., Lyubashevsky, V., Seiler, G., Unruh, D.: A thorough treatment of highly-efficient NTRU instantiations. Cryptology ePrint Archive: Report 2021\/1352 (2021)"},{"key":"5_CR39","first-page":"2021","volume":"1","author":"S Duval","year":"2021","unstructured":"Duval, S., M\u00e9aux, P., Momin, C., Standaert, F.: Exploring crypto-physical dark matter and learning with physical rounding towards secure and efficient fresh re-keying. IACR Trans. Cryptogr. Hardw. Embed. Syst. 1, 2021 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-662-53008-5_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Dziembowski","year":"2016","unstructured":"Dziembowski, S., Faust, S., Herold, G., Journault, A., Masny, D., Standaert, F.-X.: Towards sound fresh re-keying with hard (physical) learning problems. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 272\u2013301. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_10"},{"key":"5_CR41","first-page":"2022","volume":"1","author":"T Fritzmann","year":"2022","unstructured":"Fritzmann, T., Beirendonck, M.V., Roy, D.B., Karl, P., Schamberger, T., Verbauwhede, I., Sigl, G.: Masked accelerators and instruction set extensions for post-quantum cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 1, 2022 (2022)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"issue":"21","key":"5_CR43","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. J. Cryptol. 26(21), 80\u2013101 (2013)","journal-title":"J. Cryptol."},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-78967-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"H Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M.J.B., Seurin, Y.: HB$$^{\\#}$$: increasing the security and efficiency of HB$$^{+}$$. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 361\u2013378. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_21"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-30530-7_8","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"C Guo","year":"2019","unstructured":"Guo, C., Pereira, O., Peters, T., Standaert, F.-X.: Authenticated encryption with nonce misuse and physical leakage: definitions, separation results and first construction. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 150\u2013172. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_8"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., Libert, B., Momin, C., Peters, T., Standaert, F.: Towards leakage-resistant post-quantum cca-secure public key encryption. IACR Cryptol. ePrint Arch., 873 (2022)","DOI":"10.1007\/978-3-031-31368-4_5"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-70500-2_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2017","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-74143-5_31","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Hofheinz","year":"2007","unstructured":"Hofheinz, D., Kiltz, E.: Secure hybrid encryption from weakened key encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553\u2013571. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_31"},{"key":"5_CR49","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":"5_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-662-53890-6_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Katsumata","year":"2016","unstructured":"Katsumata, S., Yamada, S.: Partitioning via non-linear polynomial functions: more compact Ibes from ideal lattices and bilinear maps. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 682\u2013712. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_23"},{"issue":"4","key":"5_CR51","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1007\/s00145-016-9247-3","volume":"30","author":"E Kiltz","year":"2017","unstructured":"Kiltz, E., Pietrzak, K., Venturi, D., Cash, D., Jain, A.: Efficient authentication from hard learning problems. J. Cryptol. 30(4), 1238\u20131275 (2017)","journal-title":"J. Cryptol."},{"key":"5_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power analysis attacks - revealing the secrets of smart cards. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-38162-6","DOI":"10.1007\/978-0-387-38162-6"},{"key":"5_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-30574-3_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"S Mangard","year":"2005","unstructured":"Mangard, S., Popp, T., Gammel, B.M.: Side-channel leakage of masked CMOS gates. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 351\u2013365. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_24"},{"key":"5_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-12678-9_17","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"M Medwed","year":"2010","unstructured":"Medwed, M., Standaert, F.-X., Gro\u00dfsch\u00e4dl, J., Regazzoni, F.: Fresh re-keying: security against side-channel and fault attacks for low-cost devices. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 279\u2013296. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12678-9_17"},{"issue":"1","key":"5_CR56","first-page":"267","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAMJC 37(1), 267\u2013302 (2007)","journal-title":"SIAMJC"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"Ngo, K., Dubrova, E., Guo, Q., Johansson, T.: A side-channel attack on a masked IND-CCA secure SABER KEM implementation. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4) (2021)","DOI":"10.46586\/tches.v2021.i4.676-707"},{"issue":"2","key":"5_CR58","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s00145-010-9085-7","volume":"24","author":"S Nikova","year":"2011","unstructured":"Nikova, S., Rijmen, V., Schl\u00e4ffer, M.: Secure hardware implementation of nonlinear functions in the presence of glitches. J. Cryptol. 24(2), 292\u2013321 (2011)","journal-title":"J. Cryptol."},{"key":"5_CR59","unstructured":"Persichetti, E.: Improving the efficiency of code-based cryptography. PhD thesis, Univ. of Auckland (2012)"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Ravi, P., Roy, S.S., Chattopadhyay, A., Bhasin, S.: Generic side-channel attacks on CCA-secure lattice-based PKE and KEMs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020 (3) (2020)","DOI":"10.46586\/tches.v2020.i3.307-335"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"5_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-319-78372-7_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"T Saito","year":"2018","unstructured":"Saito, T., Xagawa, K., Yamakawa, T.: Tightly-secure key-encapsulation mechanism in the quantum random oracle model. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 520\u2013551. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_17"},{"key":"5_CR63","unstructured":"Shoup, V.: A proposal for an ISO standard for public key encryption. Manuscript, December 2001"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Ueno, R., Xagawa, K., Tanaka, Y., Ito, A., Takahashi, J., Homma, N.: Curse of re-encryption: A generic power\/EM analysis on post-quantum KEMs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1) (2022)","DOI":"10.46586\/tches.v2022.i1.296-322"},{"key":"5_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-45611-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"N Veyrat-Charvillon","year":"2014","unstructured":"Veyrat-Charvillon, N., G\u00e9rard, B., Standaert, F.-X.: Soft analytical side-channel attacks. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 282\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_15"},{"key":"5_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-34961-4_44","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N Veyrat-Charvillon","year":"2012","unstructured":"Veyrat-Charvillon, N., Medwed, M., Kerckhof, S., Standaert, F.-X.: Shuffling against side-channel attacks: a comprehensive study with cautionary note. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 740\u2013757. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_44"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31368-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:04:27Z","timestamp":1746137067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31368-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031313677","9783031313684"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31368-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2023","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":"pkc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"183","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":"50","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":"12","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)"}}]}}