{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T09:55:08Z","timestamp":1769334908785,"version":"3.49.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229626","type":"print"},{"value":"9783031229633","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22963-3_16","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"474-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-interactive Secure Computation of\u00a0Inner-Product from LPN and LWE"],"prefix":"10.1007","author":[{"given":"Geoffroy","family":"Couteau","sequence":"first","affiliation":[]},{"given":"Maryam","family":"Zarezadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"16_CR1","unstructured":"Aguilar, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. Cryptology ePrint Archive, Report 2016\/1194 (2016). https:\/\/eprint.iacr.org\/2016\/1194"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar, C., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop, pp. 648\u2013652. IEEE (2011)","DOI":"10.1109\/ITW.2011.6089577"},{"issue":"5","key":"16_CR3","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theor. 64(5), 3927\u20133943 (2018)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298\u2013307. IEEE Computer Society Press, October 2003","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"16_CR5","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":"16_CR6","unstructured":"Aragon, N., et al.: BIKE: bit flipping key encapsulation (2017)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00521-010-0346-z","volume":"20","author":"A Bansal","year":"2011","unstructured":"Bansal, A., Chen, T., Zhong, S.: Privacy preserving back-propagation neural network learning over arbitrarily partitioned data. Neural Comput. Appl. 20(1), 143\u2013150 (2011)","journal-title":"Neural Comput. Appl."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Appenzeller to brie: efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k (2021)","DOI":"10.1145\/3460120.3484812"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-57990-6_7","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2020","unstructured":"Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P., Troncoso-Pastoriza, J.R.: Efficient protocols for oblivious linear function evaluation from ring-LWE. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 130\u2013149. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_7"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"16_CR12","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 1 $$+$$ 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_42"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM (JACM) 50(4), 506\u2013519 (2003)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02920362","volume":"6","author":"JL Bordewijk","year":"1957","unstructured":"Bordewijk, J.L.: Inter-reciprocity applied to electrical networks. Appl. Sci. Res. Sect. A 6(1), 1\u201374 (1957)","journal-title":"Appl. Sci. Res. Sect. A"},{"key":"16_CR16","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.) ACM CCS 2018, pp. 896\u2013912. ACM Press, October 2018","DOI":"10.1145\/3243734.3243868"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 291\u2013308. ACM Press, November 2019","DOI":"10.1145\/3319535.3354255"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"16_CR19","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: 61st FOCS, pp. 1069\u20131080. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient\u00a0pseudorandom\u00a0correlation\u00a0generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17656-3_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1"},{"key":"16_CR22","unstructured":"de Castro, L., Juvekar, C., Vaikuntanathan, V.: Fast vector oblivious linear evaluation from ring learning with errors. Cryptology ePrint Archive, Report 2020\/685 (2020). https:\/\/eprint.iacr.org\/2020\/685"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-19574-7_12","volume-title":"Selected Areas in Cryptography","author":"P-L Cayrel","year":"2011","unstructured":"Cayrel, P.-L., V\u00e9ron, P., El Yousfi Alaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 171\u2013186. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_12"},{"key":"16_CR24","unstructured":"Chen, M.S., Cheng, C.M., Kuo, P.C., Li, W.D., Yang, B.Y.: Multiplying boolean polynomials with Frobenius Partitions in additive fast Fourier Transform. arXiv preprint arXiv:1803.11301 (2018)"},{"issue":"10","key":"16_CR25","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/TNN.2009.2026902","volume":"20","author":"T Chen","year":"2009","unstructured":"Chen, T., Zhong, S.: Privacy-preserving backpropagation neural network learning. IEEE Trans. Neural Netw. 20(10), 1554\u20131564 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Cheng, Q., Gao, C.Z.: A cloud aided privacy-preserving profile matching scheme in mobile social networks. In: 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), vol. 2, pp. 195\u2013198. IEEE (2017)","DOI":"10.1109\/CSE-EUC.2017.219"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-93387-0_16","volume-title":"Applied Cryptography and Network Security","author":"G Couteau","year":"2018","unstructured":"Couteau, G.: New protocols for secure equality test and comparison. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 303\u2013320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_16"},{"key":"16_CR28","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":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45067-X_30","volume-title":"Information Security and Privacy","author":"I Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 350\u2013364. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45067-X_30"},{"key":"16_CR30","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Doerner, J., Shelat, A.: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 523\u2013535. ACM Press, October\/November 2017","DOI":"10.1145\/3133956.3133967"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-319-06608-0_50","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C Dong","year":"2014","unstructured":"Dong, C., Chen, L.: A fast secure dot product protocol with application to privacy preserving association rule mining. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 606\u2013617. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06608-0_50"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Dong, W., Dave, V., Qiu, L., Zhang, Y.: Secure friend discovery in mobile social networks. In: 2011 Proceedings IEEE INFOCOM, pp. 1647\u20131655. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5934958"},{"key":"16_CR34","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":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85230-8_12","volume-title":"Financial Cryptography and Data Security","author":"H Gilbert","year":"2008","unstructured":"Gilbert, H., Robshaw, M.J.B., Seurin, Y.: Good variants of HB$$^{+}$$ are hard to find. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 156\u2013170. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85230-8_12"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-48405-1_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116\u2013129. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press, October 1984","DOI":"10.1109\/SFCS.1984.715949"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-17373-8_12","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Toft, T.: Computationally secure pattern matching in the presence of malicious adversaries. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 195\u2013212. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_12"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 433\u2013442. ACM Press, May 2008","DOI":"10.1145\/1374376.1374438"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-22348-8_19","volume-title":"Data and Applications Security and Privacy XXV","author":"W Jiang","year":"2011","unstructured":"Jiang, W., Samanthula, B.K.: N-gram based secure similar document detection. In: Li, Y. (ed.) DBSec 2011. LNCS, vol. 6818, pp. 239\u2013246. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22348-8_19"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40084-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Kolesnikov","year":"2013","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 54\u201370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_4"},{"issue":"2","key":"16_CR42","first-page":"413","volume":"8","author":"H Li","year":"2017","unstructured":"Li, H., Li, H., Wei, K., Yin, S.L., Zhao, C.: A multi-keyword search algorithm based on polynomial function and safety inner-product method in secure cloud environment. J. Inf. Hiding Multimedia Sig. Process. 8(2), 413\u2013422 (2017)","journal-title":"J. Inf. Hiding Multimedia Sig. Process."},{"key":"16_CR43","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1109\/TSC.2020.3020688","volume":"15","author":"Q Liu","year":"2020","unstructured":"Liu, Q., Peng, Y., Pei, S., Wu, J., Peng, T., Wang, G.: Prime inner product encoding for effective wildcard-based multi-keyword fuzzy search. IEEE Trans. Serv. Comput. 15, 1799\u20131812 (2020)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-40084-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Masny, D.: Man-in-the-middle secure authentication schemes from LPN and Weak PRFs. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 308\u2013325. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_18"},{"key":"16_CR45","unstructured":"Melchor, C.A., et al.: Hamming quasi-cyclic (HQC). In: NIST PQC Round 2, pp. 4\u201313 (2018)"},{"issue":"4","key":"16_CR46","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00778-009-0175-9","volume":"19","author":"M Murugesan","year":"2010","unstructured":"Murugesan, M., Jiang, W., Clifton, C., Si, L., Vaidya, J.: Efficient privacy-preserving similar document detection. VLDB J. 19(4), 457\u2013475 (2010)","journal-title":"VLDB J."},{"key":"16_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-030-77870-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Orlandi","year":"2021","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Osadchy, M., Pinkas, B., Jarrous, A., Moskovich, B.: SCiFI - a system for secure face identification. In: 2010 IEEE Symposium on Security and Privacy, pp. 239\u2013254. IEEE (2010)","DOI":"10.1109\/SP.2010.39"},{"key":"16_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"5","key":"16_CR50","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. Theor. 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_4"},{"issue":"4","key":"16_CR52","first-page":"351","volume":"12","author":"H Shuguo","year":"2007","unstructured":"Shuguo, H., Ng, W.K.: Multi-party privacy-preserving decision trees for arbitrarily partitioned data. Int. J. Intell. Control Syst. 12(4), 351\u2013358 (2007)","journal-title":"Int. J. Intell. Control Syst."},{"key":"16_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"J Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_2"},{"key":"16_CR54","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 1074\u20131091. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Cheung, D.W.l., Kao, B., Mamoulis, N.: Secure KNN computation on encrypted databases. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"key":"16_CR56","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. IACR Cryptology ePrint Archive 2021\/076 (2021)","DOI":"10.1145\/3460120.3484556"},{"key":"16_CR57","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11731139_74","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Yu","year":"2006","unstructured":"Yu, H., Vaidya, J., Jiang, X.: Privacy-preserving SVM classification on vertically partitioned data. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 647\u2013656. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11731139_74"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22963-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:12Z","timestamp":1769216592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22963-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229626","9783031229633"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22963-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"10","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}