{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T08:24:00Z","timestamp":1771230240683,"version":"3.50.1"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030987947","type":"print"},{"value":"9783030987954","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98795-4_6","type":"book-chapter","created":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T18:03:58Z","timestamp":1649354638000},"page":"109-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Privacy-Preserving Machine Learning Using Cryptography"],"prefix":"10.1007","author":[{"given":"Christian","family":"Rechberger","sequence":"first","affiliation":[]},{"given":"Roman","family":"Walch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"6_CR1","unstructured":"Abadi, M., et al.: Tensorflow: large-scale machine learning on heterogeneous distributed systems. CoRR abs\/1603.04467 (2016)"},{"key":"6_CR2","unstructured":"Alexandra Institute: FRESCO - a FRamework for Efficient Secure COmputation (2020). https:\/\/github.com\/aicis\/fresco"},{"key":"6_CR3","unstructured":"Aly, A., Keller, M., Rotaru, D., Scholl, P., Smart, N.P., Wood, T.: SCALE-MAMBA (2020). https:\/\/homes.esat.kuleuven.be\/nsmart\/SCALE\/"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-030-21568-2_29","volume-title":"Applied Cryptography and Network Security","author":"F Bergamaschi","year":"2019","unstructured":"Bergamaschi, F., Halevi, S., Halevi, T.T., Hunt, H.: Homomorphic training of 30,000 logistic regression models. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 592\u2013611. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_29"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Boemer, F., Cammarota, R., Demmler, D., Schneider, T., Yalame, H.: MP2ML: a mixed-protocol machine learning framework for private inference. In: ARES, pp. 14:1\u201314:10. ACM (2020)","DOI":"10.1145\/3411501.3419425"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Boemer, F., Costache, A., Cammarota, R., Wierzynski, C.: nGraph-HE2: a high-throughput framework for neural network inference on encrypted data. In: WAHC@CCS, pp. 45\u201356. ACM (2019)","DOI":"10.1145\/3338469.3358944"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Boemer, F., Lao, Y., Cammarota, R., Wierzynski, C.: nGraph-HE: a graph compiler for deep learning on homomorphically encrypted data. In: CF, pp. 3\u201313. ACM (2019)","DOI":"10.1145\/3310273.3323047"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-319-96878-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"F Bourse","year":"2018","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 483\u2013512. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_17"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-030-40186-3_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"F Bourse","year":"2020","unstructured":"Bourse, F., Sanders, O., Traor\u00e9, J.: Improved secure integer comparison via homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 391\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_17"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd, S.P., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"6_CR17","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption library (2016). https:\/\/tfhe.github.io\/tfhe\/"},{"key":"6_CR18","unstructured":"Chollet, F., et al.: Keras (2015). https:\/\/keras.io"},{"key":"6_CR19","unstructured":"Cyphers, S., et al.: Intel nGraph: an intermediate representation, compiler, and executor for deep learning. CoRR abs\/1801.08058 (2018)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 Or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Dathathri, R., et al.: CHET: an optimizing compiler for fully-homomorphic neural-network inferencing. In: PLDI, pp. 142\u2013156. ACM (2019)","DOI":"10.1145\/3314221.3314628"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Escudero","year":"2020","unstructured":"Escudero, D., Ghosh, S., Keller, M., Rachuri, R., Scholl, P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 823\u2013852. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29"},{"issue":"6","key":"6_CR25","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"6_CR26","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR28","unstructured":"Gilad-Bachrach, R., Dowlin, N., Laine, K., Lauter, K.E., Naehrig, M., Wernsing, J.: CryptoNets: applying neural networks to encrypted data with high throughput and accuracy. In: ICML. JMLR Workshop and Conference Proceedings, vol. 48, pp. 201\u2013210. JMLR.org (2016)"},{"key":"6_CR29","unstructured":"Halevi, S., Shoup, V.: Design and implementation of a homomorphicencryption library (2013). https:\/\/github.com\/homenc\/HElib"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Hesamifard, E., Takabi, H., Ghasemi, M.: Deep neural networks classification over encrypted data. In: CODASPY, pp. 97\u2013108. ACM (2019)","DOI":"10.1145\/3292006.3300044"},{"key":"6_CR32","unstructured":"Iandola, F.N., Moskewicz, M.W., Ashraf, K., Han, S., Dally, W.J., Keutzer, K.: SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and $$<$$1mb model size. CoRR abs\/1602.07360 (2016)"},{"key":"6_CR33","unstructured":"Jean, J.: TikZ for Cryptographers. (2016) https:\/\/www.iacr.org\/authors\/tikz\/"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Jiang, X., Kim, M., Lauter, K.E., Song, Y.: Secure outsourced matrix computation and application to neural networks. In: CCS, pp. 1209\u20131222. ACM (2018)","DOI":"10.1145\/3243734.3243837"},{"key":"6_CR35","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.: GAZELLE: a low latency framework for secure neural network inference. In: USENIX, pp. 1651\u20131669. USENIX Association (2018)"},{"key":"6_CR36","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: USENIX. pp. 1447\u20131464. USENIX Association (2019)"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: CCS, pp. 1575\u20131590. ACM (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.H.: Logistic regression model training based on the approximate homomorphic encryption. IACR Cryptol. ePrint Arch. 2018, 254 (2018)","DOI":"10.1186\/s12920-018-0401-7"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. 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. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40"},{"key":"6_CR41","unstructured":"Krizhevsky, A.: The CIFAR-10 Dataset (2009). http:\/\/www.cs.toronto.edu\/kriz\/cifar.html"},{"key":"6_CR42","unstructured":"LeCun, Y., Cortes, C., Burges, C.: The MNIST Database of Handwritten Digits (2009). http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"6_CR43","unstructured":"Liu, B., Ding, M., Shaham, S., Rahayu, W., Farokhi, F., Lin, Z.: When machine learning meets privacy: a survey and outlook. CoRR abs\/2011.11819 (2020)"},{"key":"6_CR44","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":"6_CR45","unstructured":"Mohassel, P., Rindal, P.: Aby$$^{3}$$: a mixed protocol framework for machine learning. In: CCS, pp. 35\u201352. ACM (2018)"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC, pp. 129\u2013139. ACM (1999)","DOI":"10.1145\/336992.337028"},{"key":"6_CR47","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"},{"key":"6_CR48","unstructured":"Polyakov, Y., Rohloff, K., Ryan, G., Cousins, D.: Palisade lattice cryptography library (2020). https:\/\/palisade-crypto.org\/software-library\/"},{"key":"6_CR49","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical report, TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR51","unstructured":"Riazi, M.S., Samragh, M., Chen, H., Laine, K., Lauter, K.E., Koushanfar, F.: XONN: xnor-based oblivious deep neural network inference. In: USENIX, pp. 1501\u20131518. USENIX Association (2019)"},{"key":"6_CR52","unstructured":"Rindal, P.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"issue":"2","key":"6_CR53","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"6_CR54","unstructured":"Romero, A., Ballas, N., Kahou, S.E., Chassang, A., Gatta, C., Bengio, Y.: FitNets: hints for thin deep nets. In: ICLR (Poster) (2015)"},{"key":"6_CR55","unstructured":"Microsoft SEAL (release 3.6) (2020). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA"},{"issue":"11","key":"6_CR56","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"6_CR57","doi-asserted-by":"crossref","unstructured":"Songhori, E.M., Hussain, S.U., Sadeghi, A., Schneider, T., Koushanfar, F.: TinyGarble: highly compressed and scalable sequential garbled circuits. In: IEEE S&P, pp. 411\u2013428. IEEE (2015)","DOI":"10.1109\/SP.2015.32"},{"key":"6_CR58","unstructured":"University of Bristol: Multi-Protocol SPDZ (2020). https:\/\/github.com\/data61\/MP-SPDZ"},{"issue":"3","key":"6_CR59","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. Proc. Priv. Enhancing Technol. 2019(3), 26\u201349 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"6_CR60","unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: efficient MultiParty computation toolkit (2016). https:\/\/github.com\/emp-toolkit"},{"key":"6_CR61","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"6_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-46803-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Zahur","year":"2015","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. Reducing data transfer in garbled circuits using half gates. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 220\u2013250. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8"},{"key":"6_CR63","doi-asserted-by":"crossref","unstructured":"Zheng, W., Popa, R.A., Gonzalez, J.E., Stoica, I.: Helen: maliciously secure coopetitive learning for linear models. In: IEEE S&P, pp. 724\u2013738. IEEE (2019)","DOI":"10.1109\/SP.2019.00045"}],"container-title":["Lecture Notes in Computer Science","Security and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98795-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T18:06:44Z","timestamp":1649354804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98795-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030987947","9783030987954"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98795-4_6","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":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}