{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:24:44Z","timestamp":1743056684774,"version":"3.40.3"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031547690"},{"type":"electronic","value":"9783031547706"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54770-6_3","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"58-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Approach to\u00a0Efficient and\u00a0Secure Fixed-Point Computation"],"prefix":"10.1007","author":[{"given":"Tore Kasper","family":"Frederiksen","sequence":"first","affiliation":[]},{"given":"Jonas","family":"Lindstr\u00f8m","sequence":"additional","affiliation":[]},{"given":"Mikkel Wienberg","family":"Madsen","sequence":"additional","affiliation":[]},{"given":"Anne Dorte","family":"Spangsberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Ieee standard for floating-point arithmetic. IEEE Std 754\u20132019 (Revision of IEEE 754\u20132008), pp. 1\u201384 (2019). https:\/\/doi.org\/10.1109\/IEEESTD.2019.8766229","DOI":"10.1109\/IEEESTD.2019.8766229"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Dalskov, A.P.K., Escudero, D., Nof, A.: An efficient passive-to-active compiler for honest-majority MPC over rings. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 21, Part II. LNCS, vol. 12727, pp. 122\u2013152. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-78375-4_6","DOI":"10.1007\/978-3-030-78375-4_6"},{"key":"3_CR3","unstructured":"Alexandra Institute: FRESCO - a FRamework for Efficient Secure COmputation. https:\/\/github.com\/aicis\/fresco"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417\u2013432. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_27","DOI":"10.1007\/3-540-45708-9_27"},{"key":"3_CR5","unstructured":"Aliasgari, M., Blanton, M., Zhang, Y., Steele, A.: Secure computation on floating point numbers. In: NDSS 2013. The Internet Society, February 2013"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Almeida, J.B., et al.: A fast and verified software stack for secure function evaluation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1989\u20132006. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134017","DOI":"10.1145\/3133956.3134017"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Asif, S., Hossain, M.S., Kong, Y.: High-throughput multi-key elliptic curve cryptosystem based on residue number system. IET Comput. Digit. Tech. 11(5), 165\u2013172 (2017). https:\/\/doi.org\/10.1049\/iet-cdt.2016.0141","DOI":"10.1049\/iet-cdt.2016.0141"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Atallah, M.J., Bykova, M., Li, J., Frikken, K.B., Topkara, M.: Private collaborative forecasting and benchmarking. In: Atluri, V., Syverson, P.F., di Vimercati, S.D.C. (eds.) Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, WPES 2004, Washington, DC, USA, October 28, 2004, pp. 103\u2013114. ACM (2004). https:\/\/doi.org\/10.1145\/1029179.1029204","DOI":"10.1145\/1029179.1029204"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010). https:\/\/doi.org\/10.1007\/s00145-009-9040-7","journal-title":"J. Cryptol."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Clear, M., Tewari, H.: zkHawk: practical private smart contracts from MPC-based hawk. Cryptology ePrint Archive, Report 2021\/501 (2021). https:\/\/eprint.iacr.org\/2021\/501","DOI":"10.1109\/BRAINS52497.2021.9569822"},{"key":"3_CR11","unstructured":"Baum, C., Chiang, J.H., David, B., Frederiksen, T.K.: Eagle: Efficient privacy preserving smart contracts. IACR Cryptol. ePrint Arch., p. 1435 (2022). https:\/\/eprint.iacr.org\/2022\/1435"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-78372-3_7","volume-title":"Applied Cryptography and Network Security","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Frederiksen, T.K.: P2DEX: privacy-preserving decentralized cryptocurrency exchange. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 2021. LNCS, vol. 12726, pp. 163\u2013194. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78372-3_7"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-030-77886-6_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"E Boyle","year":"2021","unstructured":"Boyle, E., et al.: Function secret sharing for mixed-mode and fixed-point secure computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 871\u2013900. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_30"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved primitives for secure multiparty integer computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 182\u2013199. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-14577-3_6","volume-title":"Financial Cryptography and Data Security","author":"O Catrina","year":"2010","unstructured":"Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 35\u201350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_6"},{"key":"3_CR18","unstructured":"Chandran, N., Gupta, D., Obbattu, S.L.B., Shah, A.: SIMC: ML inference secure against malicious clients at semi-honest cost. Cryptology ePrint Archive, Report 2021\/1538 (2021). https:\/\/eprint.iacr.org\/2021\/1538"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-56877-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Chen","year":"2020","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_3"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Chen, M., et al.: Multiparty generation of an RSA modulus. J. Cryptol. 35(2), 12 (2022). https:\/\/doi.org\/10.1007\/s00145-021-09395-y","DOI":"10.1007\/s00145-021-09395-y"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: 2021 IEEE Symposium on Security and Privacy, pp. 590\u2013607. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00025","DOI":"10.1109\/SP40001.2021.00025"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Cramer","year":"2018","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD$$\\mathbb{Z}_{2^k}$$: efficient MPC mod $$2^k$$ for dishonest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Dalskov, A.P.K., Escudero, D., Nof, A.: Fast fully secure multi-party computation over any ring with two-thirds honest majority. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 653\u2013666. ACM Press, November 2022. https:\/\/doi.org\/10.1145\/3548606.3559389","DOI":"10.1145\/3548606.3559389"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-59013-0_32","volume-title":"Computer Security \u2013 ESORICS 2020","author":"A Dalskov","year":"2020","unstructured":"Dalskov, A., Orlandi, C., Keller, M., Shrishak, K., Shulman, H.: Securing DNSSEC keys via threshold ECDSA from generic MPC. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 654\u2013673. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_32"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-662-54970-4_10","volume-title":"Financial Cryptography and Data Security","author":"I Damg\u00e5rd","year":"2017","unstructured":"Damg\u00e5rd, I., Damg\u00e5rd, K., Nielsen, K., Nordholt, P.S., Toft, T.: Confidential benchmarking based on multiparty computation. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 169\u2013187. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_10"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Escudero, D., Frederiksen, T.K., Keller, M., Scholl, P., Volgushev, N.: New primitives for actively-secure MPC over rings with applications to private machine learning. In: 2019 IEEE Symposium on Security and Privacy, pp. 1102\u20131120. IEEE Computer Society Press, May 2019. https:\/\/doi.org\/10.1109\/SP.2019.00078","DOI":"10.1109\/SP.2019.00078"},{"key":"3_CR27","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":"3_CR28","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":"3_CR29","doi-asserted-by":"publisher","unstructured":"Delpech de Saint Guilhem, C., Makri, E., Rotaru, D., Tanguy, T.: The return of eratosthenes: secure generation of RSA moduli using distributed sieving. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 594\u2013609. ACM Press, November 2021. https:\/\/doi.org\/10.1145\/3460120.3484754","DOI":"10.1145\/3460120.3484754"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS 2015. The Internet Society, February 2015","DOI":"10.14722\/ndss.2015.23113"},{"key":"3_CR31","unstructured":"Deryabin, M., Chervyakov, N., Tchernykh, A., Babenko, M., Shabalina, M.: High performance parallel computing in residue number system. Int. J. Comb. Optim. Problems Inform. 9(1), 62\u201367 (2018). https:\/\/ijcopi.org\/ojs\/article\/view\/80"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Ghosh, S., Nielsen, J.B., Nilges, T., Trifiletti, R.: TinyOLE: Efficient actively secure two-party computation from oblivious linear function evaluation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2263\u20132276. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134024","DOI":"10.1145\/3133956.3134024"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Du, W., Atallah, M.J.: Privacy-preserving cooperative statistical analysis. In: 17th Annual Computer Security Applications Conference (ACSAC 2001), 11\u201314 December 2001, New Orleans, Louisiana, USA, pp. 102\u2013110. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/ACSAC.2001.991526","DOI":"10.1109\/ACSAC.2001.991526"},{"key":"3_CR34","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"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36504-4_10","volume-title":"Financial Cryptography","author":"P-A Fouque","year":"2003","unstructured":"Fouque, P.-A., Stern, J., Wackers, G.-J.: CryptoComputing with rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 136\u2013146. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_10"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Fournaris, A.P., Papachristodoulou, L., Batina, L., Sklavos, N.: Residue number system as a side channel and fault injection attack countermeasure in elliptic curve cryptography. In: 2016 International Conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2016, Istanbul, Turkey, April 12\u201314, 2016, pp. 1\u20134. IEEE (2016). https:\/\/doi.org\/10.1109\/DTIS.2016.7483807","DOI":"10.1109\/DTIS.2016.7483807"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Franz, M., Deiseroth, B., Hamacher, K., Jha, S., Katzenbeisser, S., Schr\u00f6der, H.: Secure computations on non-integer values. In: 2010 IEEE International Workshop on Information Forensics and Security, WIFS 2010, Seattle, WA, USA, December 12\u201315, 2010, pp. 1\u20136. IEEE (2010). https:\/\/doi.org\/10.1109\/WIFS.2010.5711458","DOI":"10.1109\/WIFS.2010.5711458"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Franz, M., Katzenbeisser, S.: Processing encrypted floating point signals. In: Heitzenrater, C., Craver, S., Dittmann, J. (eds.) Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security, MM &Sec \u201911, Buffalo, New York, USA, September 29\u201330, 2011, pp. 103\u2013108. ACM (2011). https:\/\/doi.org\/10.1145\/2037252.2037271","DOI":"10.1145\/2037252.2037271"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-662-48797-6_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"TK Frederiksen","year":"2015","unstructured":"Frederiksen, T.K., Keller, M., Orsini, E., Scholl, P.: A unified approach to MPC with preprocessing using OT. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 711\u2013735. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_29"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-96881-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"TK Frederiksen","year":"2018","unstructured":"Frederiksen, T.K., Lindell, Y., Osheter, V., Pinkas, B.: Fast distributed RSA key generation for\u00a0semi-honest and malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 331\u2013361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_12"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Lindstr\u00f8m, J., Madsen, M.W., Spangsberg, A.D.: A new approach to efficient and secure fixed-point computation. IACR Cryptol. ePrint Arch., p. 035 (2024). https:\/\/eprint.iacr.org\/2024\/035","DOI":"10.1007\/978-3-031-54770-6_3"},{"key":"3_CR42","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press, May 1987. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Hazay, C., Ishai, Y., Marcedone, A., Venkitasubramaniam, M.: LevioSA: Lightweight secure arithmetic computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 327\u2013344. ACM Press, November 2019. https:\/\/doi.org\/10.1145\/3319535.3354258","DOI":"10.1145\/3319535.3354258"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-319-70694-8_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 598\u2013628. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21"},{"key":"3_CR45","unstructured":"Jacquemin, D., Mert, A.C., Roy, S.S.: Exploring RNS for isogeny-based cryptography. IACR Cryptol. ePrint Arch., p. 1289 (2022). https:\/\/eprint.iacr.org\/2022\/1289"},{"key":"3_CR46","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-78372-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 158\u2013189. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-662-53357-4_18","volume-title":"Financial Cryptography and Data Security","author":"L Kerik","year":"2016","unstructured":"Kerik, L., Laud, P., Randmets, J.: Optimizing MPC for robust and scalable integer and floating-point arithmetic. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 271\u2013287. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_18"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure computation of the mean and related statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 283\u2013302. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_16"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-662-44381-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Larraia","year":"2014","unstructured":"Larraia, E., Orsini, E., Smart, N.P.: Dishonest majority multi-party computation for binary circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 495\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_28"},{"key":"3_CR51","doi-asserted-by":"publisher","unstructured":"Li, S., Xue, K., Zhu, B., Ding, C., Gao, X., Wei, D.S.L., Wan, T.: FALCON: A fourier transform based approach for fast and secure convolutional neural network predictions. In: 2020 IEEE\/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2020, Seattle, WA, USA, June 13\u201319, 2020. pp. 8702\u20138711. Computer Vision Foundation \/ IEEE (2020). https:\/\/doi.org\/10.1109\/CVPR42600.2020.00873. https:\/\/openaccess.thecvf.com\/content_CVPR_2020\/html\/Li_FALCON_A_Fourier_Transform_Based_Approach_for_Fast_and_Secure_CVPR_2020_paper.html","DOI":"10.1109\/CVPR42600.2020.00873"},{"key":"3_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36\u201354. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_3"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-662-64322-8_12","volume-title":"Financial Cryptography and Data Security","author":"E Makri","year":"2021","unstructured":"Makri, E., Rotaru, D., Vercauteren, F., Wagh, S.: $$\\sf Rabbit$$: efficient comparison for secure multi-party computation. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, Part I, vol. 12674, pp. 249\u2013270. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64322-8_12"},{"key":"3_CR54","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rindal, P.: ABY$$^3$$: a mixed protocol framework for machine learning. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 35\u201352. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243760","DOI":"10.1145\/3243734.3243760"},{"key":"3_CR55","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy, pp. 19\u201338. IEEE Computer Society Press, May 2017. https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"3_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-00457-5_22","volume-title":"Theory of Cryptography","author":"JB Nielsen","year":"2009","unstructured":"Nielsen, J.B., Orlandi, C.: LEGO for two-party secure computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 368\u2013386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_22"},{"key":"3_CR57","doi-asserted-by":"crossref","unstructured":"Quisquater, J.J.: Fast decipherment algorithm for rsa public-key cryptosystem. Electron. Lett. 18, 905\u2013907(2) (1982). https:\/\/digital-library.theiet.org\/content\/journals\/10.1049\/el_19820617","DOI":"10.1049\/el:19820617"},{"issue":"1","key":"3_CR58","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-021-09416-w","volume":"35","author":"D Rotaru","year":"2022","unstructured":"Rotaru, D., Smart, N.P., Tanguy, T., Vercauteren, F., Wood, T.: Actively secure setup for SPDZ. J. Cryptol. 35(1), 5 (2022). https:\/\/doi.org\/10.1007\/s00145-021-09416-w","journal-title":"J. Cryptol."},{"key":"3_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-35423-7_12","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"D Rotaru","year":"2019","unstructured":"Rotaru, D., Wood, T.: MArBled circuits: mixing arithmetic and boolean circuits with active security. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 227\u2013249. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_12"},{"key":"3_CR60","doi-asserted-by":"publisher","unstructured":"Simi\u0107, S., Bemporad, A., Inverso, O., Tribastone, M.: Tight error analysis in fixed-point arithmetic. Form. Asp. Comput. 34(1) (2022). https:\/\/doi.org\/10.1145\/3524051","DOI":"10.1145\/3524051"},{"key":"3_CR61","unstructured":"Szabo, N.S., Tanaka, R.I.: Residue arithmetic and its applications to computer technology \/ Nicholas S. Szabo, Richard I. Tanaka. McGraw-Hill series in information processing and computers, McGraw-Hill, New York (1967)"},{"issue":"3","key":"3_CR62","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. PoPETs 2019(3), 26\u201349 (2019). https:\/\/doi.org\/10.2478\/popets-2019-0035","journal-title":"PoPETs"},{"key":"3_CR63","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press, November 1982. https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"3_CR64","unstructured":"Yuan, S., Shen, M., Mironov, I., Nascimento, A.C.A.: Practical, label private deep learning training based on secure multiparty computation and differential privacy. Cryptology ePrint Archive, Report 2021\/835 (2021). https:\/\/eprint.iacr.org\/2021\/835"}],"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-031-54770-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:12:46Z","timestamp":1709655166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","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":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","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":"230","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":"54","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":"23% - 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":"4","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":"4-6","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)"}}]}}