{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:17Z","timestamp":1784638877278,"version":"3.55.0"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_14","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:03:35Z","timestamp":1784635415000},"page":"382-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practice-Oriented Instances of\u00a0Deterministic LPN"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5761-8694","authenticated-orcid":false,"given":"Carlos","family":"Cid","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9157-3821","authenticated-orcid":false,"given":"Alex","family":"Davidson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1914-3484","authenticated-orcid":false,"given":"Atharva","family":"Phanse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"issue":"2","key":"14_CR1","first-page":"129","volume":"13","author":"M Ajtai","year":"1993","unstructured":"Ajtai, M., Linial, N.: The influence of large coalitions. Comb. 13(2), 129\u2013145 (1993)","journal-title":"Comb."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in AC0. MOD2. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, ITCS 2014, pp. 251\u2013260. Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2554797.2554821"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-40041-4_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Alwen","year":"2013","unstructured":"Alwen, J., Krenn, S., Pietrzak, K., Wichs, D.: Learning with rounding, revisited. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 57\u201374. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_4"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Hamann, M., Mikhalev, V.: Lightweight authentication protocols on ultra-constrained RFIDs - myths and facts. In: Saxena, N., Sadeghi, A.-R. (eds.) Radio Frequency Identification: Security and Privacy Issues, pp. 1\u201318. Springer International Publishing, Cham (2014)","DOI":"10.1007\/978-3-319-13066-8_1"},{"key":"14_CR6","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"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.46586\/tosc.v2021.i1.37-77","volume":"2021","author":"S Banik","year":"2021","unstructured":"Banik, S., Isobe, T., Liu, F., Minematsu, K., Sakamoto, K.: Orthros: a low-latency PRF. IACR Trans. Symmetric Cryptol. 2021(1), 37\u201377 (2021)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.46586\/tosc.v2024.i2.35-67","volume":"2024","author":"A Bariant","year":"2024","unstructured":"Bariant, A., Baudrin, J., Leurent, G., Pernot, C., Perrin, L., Peyrin, T.: Fast AES-based universal hash functions and macs: Featuring LeMac and PetitMac. IACR Trans. Symmetric Cryptol. 2024(2), 35\u201367 (2024)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"14_CR9","unstructured":"Baum, C., et\u00a0al.: FAEST: algorithm specifications. Technical report, National Institute of Standards and Technology (2023)"},{"issue":"11","key":"14_CR10","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1007\/s10623-023-01292-8","volume":"91","author":"C Baum","year":"2023","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: SOK: vector OLE-based zero-knowledge protocols. Des. Codes Cryptogr. 91(11), 3527\u20133561 (2023)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.46586\/tches.v2021.i3.390-417","volume":"2021","author":"D Bellizia","year":"2021","unstructured":"Bellizia, D., et al.: Learning parity with physical noise: imperfections, reductions and FPGA prototype. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(3), 390\u2013417 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"4","key":"14_CR12","first-page":"1","volume":"2022","author":"D Bellizia","year":"2022","unstructured":"Bellizia, D., Hoffmann, C., Kamel, D., M\u00e9aux, P., Standaert, F.: When bad news become good news towards usable instances of learning with physical errors. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4), 1\u201324 (2022)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-77883-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Ben-Efraim","year":"2021","unstructured":"Ben-Efraim, A., Cong, K., Omri, E., Orsini, E., Smart, N.P., Soria-Vazquez, E.: Large scale, actively secure computation from LPN and free-XOR garbled circuits. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 33\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_2"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, 8\u201310 January 2012, pp. 326\u2013349. ACM (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Yao, F.F., Luks, E.M. (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 21\u201323 May 2000, Portland, OR, USA, pp. 435\u2013440. ACM (2000)","DOI":"10.1145\/335305.335355"},{"key":"14_CR17","unstructured":"Bogdanov, A., Lauridsen, M.M., Tischhauser, E.: AES-based authenticated encryption modes in parallel high-performance software. IACR Cryptology ePrint Archive, p. 186 (2014)"},{"key":"14_CR18","unstructured":"Bogdanov, A., Rosen, A.: Pseudorandom functions: three decades later. Cryptology ePrint Archive, Paper 2017\/652 (2017). https:\/\/eprint.iacr.org\/2017\/652"},{"key":"14_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":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 896\u2013912. ACM (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1069\u20131080. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-030-84259-8_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Boyle","year":"2021","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Low-complexity weak pseudorandom functions in AC0[MOD2]. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 487\u2013516. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_17"},{"key":"14_CR24","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Low-complexity weak pseudorandom functions in AC0[MOD2] (2021). Full version, made available privately by the authors"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Carlet, C., Sarkar, P.: Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks. Cryptology ePrint Archive, Paper 2024\/1305 (2024)","DOI":"10.1016\/j.dam.2025.05.004"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-75248-4_26","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"JH Cheon","year":"2021","unstructured":"Cheon, J.H., Cho, W., Kim, J.H., Kim, J.: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 739\u2013760. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_26"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-84252-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 502\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part II. LNCS, vol. 14082, pp. 315\u2013348. Springer (2023)","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"14_CR29","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":"14_CR30","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon MAC, PRF, and Short-Input PRF - Lightweight, Fast, and Efficient Pseudorandom Functions (2024)","DOI":"10.1007\/978-3-031-58868-6_15"},{"issue":"2","key":"14_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.46586\/tosc.v2023.i2.69-93","volume":"2023","author":"C Dobraunig","year":"2023","unstructured":"Dobraunig, C., Mennink, B., Neves, S.: EliMAC: speeding up LightMAC by around 20%. IACR Trans. Symmetric Cryptol. 2023(2), 69\u201393 (2023)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-34961-4_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N D\u00f6ttling","year":"2012","unstructured":"D\u00f6ttling, N., M\u00fcller-Quade, J., Nascimento, A.C.A.: IND-CCA secure cryptography based on a variant of the LPN problem. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 485\u2013503. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_30"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Drucker, N., Gueron, S., Krasnov, V.: Making AES great again: the forthcoming vectorized AES instruction. Cryptology ePrint Archive, Paper 2018\/392 (2018)","DOI":"10.1007\/978-3-030-14070-0_6"},{"key":"14_CR34","unstructured":"Eliasi, P.A., et al.: Koala: a low-latency pseudorandom function. Cryptology ePrint Archive, Paper 2024\/1249 (2024)"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-319-63715-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Esser","year":"2017","unstructured":"Esser, A., K\u00fcbler, R., May, A.: LPN decoded. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 486\u2013514. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_17"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-40921-0_5","volume-title":"Information Security and Cryptology \u2013 ICISC 2019","author":"H Fujii","year":"2020","unstructured":"Fujii, H., Rodrigues, F.C., L\u00f3pez, J.: Fast AES implementation using ARMv8 ASIMD without cryptography extension. In: Seo, J.H. (ed.) ICISC 2019. LNCS, vol. 11975, pp. 84\u2013101. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40921-0_5"},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1049\/el:20052622","volume":"41","author":"H Gilbert","year":"2005","unstructured":"Gilbert, H., Robshaw, M., Sibert, H.: Active attack against HB+: a provably secure lightweight authentication protocol. Electron. Lett. 41, 1169\u20131170 (2005)","journal-title":"Electron. Lett."},{"key":"14_CR38","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":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-540-70583-3_55","volume-title":"Automata, Languages and Programming","author":"H Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M.J.B., Seurin, Y.: How to encrypt with the LPN problem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 679\u2013690. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_55"},{"key":"14_CR40","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2021.01.029","volume":"294","author":"S Gilboa","year":"2021","unstructured":"Gilboa, S., Gueron, S.: The advantage of truncated permutations. Discret. Appl. Math. 294, 214\u2013223 (2021)","journal-title":"Discret. Appl. Math."},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-16715-2_9","volume-title":"Topics in Cryptology \u2013- CT-RSA 2015","author":"CPL Gouv\u00eaa","year":"2015","unstructured":"Gouv\u00eaa, C.P.L., L\u00f3pez, J.: Implementing GCM on ARMv8. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 167\u2013180. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_9"},{"key":"14_CR42","volume-title":"Generalized tribes","author":"R Gross","year":"2019","unstructured":"Gross, R.: Generalized tribes. Boolean Zoo, Weizmann Institute (2019)"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-53887-6_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Gueron","year":"2016","unstructured":"Gueron, S., Mouha, N.: Simpira\u00a0v2: a family of efficient permutations using the AES round function. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 95\u2013125. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_4"},{"key":"14_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-68914-0_21","volume-title":"Applied Cryptography and Network Security","author":"G Hammouri","year":"2008","unstructured":"Hammouri, G., Sunar, B.: PUF-HB: a tamper-resilient HB based authentication protocol. In: Bellovin, S.M., Gennaro, R., Keromytis, A., Yung, M. (eds.) ACNS 2008. LNCS, vol. 5037, pp. 346\u2013365. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68914-0_21"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: Hartmanis, J. (ed.) Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 28\u201330 May 1986, Berkeley, California, USA, pp. 6\u201320. ACM (1986)","DOI":"10.1145\/12130.12132"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. In: Leighton, F.T., Shor, P.W. (eds.) Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, 4\u20136 May 1997, pp. 1\u201310. ACM (1997)","DOI":"10.1145\/258533.258536"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Heimberger, L., Kales, D., Lolato, R., Mir, O., Ramacher, S., Rechberger, C.: Leap: a fast, lattice-based OPRF with application to private set intersection. In: Fehr, S., Fouque, P. (eds.) Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, 4\u20138 May 2025, Proceedings, Part VII. LNCS, vol. 15607, pp. 254\u2013283. Springer (2025)","DOI":"10.1007\/978-3-031-91098-2_10"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-34047-5_20","volume-title":"Fast Software Encryption","author":"S Heyse","year":"2012","unstructured":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., Pietrzak, K.: Lapin: an efficient authentication protocol based on ring-LPN. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 346\u2013365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_20"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Krovetz, T., Rogaway, P.: Robust authenticated-encryption AEZ and the problem that it solves. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 15\u201344. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_2"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45682-1_4","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NJ Hopper","year":"2001","unstructured":"Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_4"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-662-52993-5_17","volume-title":"Fast Software Encryption","author":"J Jean","year":"2016","unstructured":"Jean, J., Nikoli\u0107, I.: Efficient design strategies based on the AES round function. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 334\u2013353. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_17"},{"key":"14_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11535218_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A Juels","year":"2005","unstructured":"Juels, A., Weis, S.A.: Authenticating pervasive devices with human protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 293\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_18"},{"issue":"2","key":"14_CR53","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s13389-020-00238-3","volume":"11","author":"D Kamel","year":"2021","unstructured":"Kamel, D., Bellizia, D., Bronchain, O., Standaert, F.: Side-channel analysis of a learning parity with physical noise processor. J. Cryptogr. Eng. 11(2), 171\u2013179 (2021)","journal-title":"J. Cryptogr. Eng."},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"Kamel, D., Bellizia, D., Standaert, F.-X., Flandre, D., Bol, D.: Demonstrating an LPPN processor. In: Proceedings of the 2018 Workshop on Attacks and Solutions in Hardware Security, ASHES 2018, pp. 18\u201323. ACM, New York, NY, USA (2018)","DOI":"10.1145\/3266444.3266445"},{"issue":"5","key":"14_CR55","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TDSC.2018.2830763","volume":"17","author":"D Kamel","year":"2020","unstructured":"Kamel, D., Standaert, F., Duc, A., Flandre, D., Berti, F.: Learning with physical noise or errors. IEEE Trans. Dependable Secur. Comput. 17(5), 957\u2013971 (2020)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"14_CR56","unstructured":"Lefevre, C., Belkheyar, Y., Daemen, J.: Kirby: a robust permutation-based PRF construction. Cryptology ePrint Archive, Paper 2023\/1520 (2023)"},{"key":"14_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-52993-5_3","volume-title":"Fast Software Encryption","author":"A Luykx","year":"2016","unstructured":"Luykx, A., Preneel, B., Tischhauser, E., Yasuda, K.: A MAC mode for lightweight block ciphers. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 43\u201359. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_3"},{"key":"14_CR58","doi-asserted-by":"crossref","unstructured":"Madhavan, M., Thangaraj, A., Sankarasubramanian, Y., Viswanathan, K.: NLHB: a non-linear Hopper-Blum protocol. In: 2010 IEEE International Symposium on Information Theory, pp. 2498\u20132502 (2010)","DOI":"10.1109\/ISIT.2010.5513440"},{"issue":"3","key":"14_CR59","doi-asserted-by":"publisher","first-page":"228","DOI":"10.46586\/tosc.v2017.i3.228-252","volume":"2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Optimal PRFs from blockcipher designs. IACR Trans. Symmetric Cryptol. 2017(3), 228\u2013252 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"14_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-27660-6_9","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"K Pietrzak","year":"2012","unstructured":"Pietrzak, K.: Cryptography from learning parity with noise. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 99\u2013114. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27660-6_9"},{"key":"14_CR61","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"14_CR62","doi-asserted-by":"crossref","unstructured":"Rossman, B., Servedio, R.A., Tan, L.: An average-case depth hierarchy theorem for Boolean circuits. In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October, 2015, pp. 1030\u20131048. IEEE Computer Society (2015)","DOI":"10.1109\/FOCS.2015.67"},{"key":"14_CR63","unstructured":"Rott, J.K.: Intel advanced encryption standard instructions (AES-NI). Blog (2012)"},{"key":"14_CR64","doi-asserted-by":"crossref","unstructured":"Roy, L.: SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, 15\u201318 August 2022, Proceedings, Part I. LNCS, vol. 13507, pp. 657\u2013687. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"14_CR65","doi-asserted-by":"crossref","unstructured":"Sim, M., et al.: Optimized implementation of Simpira on microcontrollers for secure massive learning. Symmetry 14(11) (2022)","DOI":"10.3390\/sym14112377"},{"key":"14_CR66","doi-asserted-by":"crossref","unstructured":"S\u00f6nmez\u00a0Turan, M., McKay, K., Chang, D., Kang, J., Kelsey, J.: Ascon-based lightweight cryptography standards for constrained devices: authenticated encryption, hash, and extendable output functions. Technical report, National Institute of Standards and Technology, NIST SP 800-232 (2024)","DOI":"10.6028\/NIST.SP.800-232"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:03:43Z","timestamp":1784635423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}