{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T10:35:32Z","timestamp":1761993332552,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533567"},{"type":"electronic","value":"9783662533574"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53357-4_18","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T13:22:01Z","timestamp":1472563321000},"page":"271-287","source":"Crossref","is-referenced-by-count":17,"title":["Optimizing MPC for Robust and Scalable Integer and Floating-Point Arithmetic"],"prefix":"10.1007","author":[{"given":"Liisi","family":"Kerik","sequence":"first","affiliation":[]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[]},{"given":"Jaak","family":"Randmets","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"18_CR1","unstructured":"2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013. ACM (2013)"},{"key":"18_CR2","unstructured":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015. ACM (2015)"},{"key":"18_CR3","unstructured":"Aliasgari, M., Blanton, M., Zhang, Y., Steele, A.: Secure computation on floating point numbers. In: 20th Annual Network and Distributed System Security Symposium, NDSS 2013, San Diego, California, USA, 24\u201327 February 2013. The Internet Society (2013)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: CCS 2008: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 257\u2013266. ACM (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., J\u00f5emets, M., Siim, S., Vaht, M.: A short paper on how the national tax office evaluated a tax fraud detection system based on secure multi-party computation. In: Proceedings of 19th International Conference on Financial Cryptography and Data Security. LNCS, vol. 8975, pp. 227\u2013234. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-47854-7_14"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-319-06749-0_3","volume-title":"Privacy Technologies and Policy","author":"D Bogdanov","year":"2014","unstructured":"Bogdanov, D., Kamm, L., Laur, S., Pruulmann-Vengerfeldt, P., Talviste, R., Willemson, J.: Privacy-preserving statistical data analysis on federated databases. In: Preneel, B., Ikonomou, D. (eds.) APF 2014. LNCS, vol. 8450, pp. 30\u201355. Springer, Heidelberg (2014)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laud, P., Laur, S., Pullonen, P.: From input private to universally composable secure multi-party computation primitives. In: IEEE 27th Computer Security Foundations Symposium, CSF 2014, pp. 184\u2013198. IEEE, July 2014","DOI":"10.1109\/CSF.2014.21"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laud, P., Randmets, J.: Domain-polymorphic programming of privacy-preserving applications. In: Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS@ECOOP 2014, Uppsala, Sweden, 29 July 2014, p. 53. ACM (2014)","DOI":"10.1145\/2637113.2637119"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"issue":"6","key":"18_CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Secur. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Secur."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"18_CR12","volume-title":"Numerical Analysis","author":"RL Burden","year":"2011","unstructured":"Burden, R.L., Faires, J.D.: Numerical Analysis, 9th edn. Brooks\/Cole, Boston (2011)","edition":"9"},{"key":"18_CR13","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: USENIX Security Symposium, pp. 223\u2013239. Washington, DC, USA (2010)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Demmler, D., Dessouky, G., Koushanfar, F., Sadeghi, A., Schneider, T., Zeitouni, S.: Automated synthesis of optimized circuits for secure computation. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12\u20136 October 2015 [2], pp. 1504\u20131517 (2015)","DOI":"10.1145\/2810103.2813678"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.R., Schneider, T., Wehrenberg, I.: TASTY: tool for automating secure two-party computations. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 451\u2013462. ACM (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"18_CR22","unstructured":"Kamm, L.: Privacy-preserving statistical analysis using secure multi-party computation. Ph.D. thesis, University of Tartu (2015)"},{"issue":"6","key":"18_CR23","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10207-014-0271-8","volume":"14","author":"L Kamm","year":"2015","unstructured":"Kamm, L., Willemson, J.: Secure floating point arithmetic and private satellite collision analysis. Int. J. Inf. Secur. 14(6), 531\u2013548 (2015)","journal-title":"Int. J. Inf. Secur."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Keller, M., Scholl, P., Smart, N.P.: An architecture for practical actively secure MPC with dishonest majority. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013 [1], pp. 549\u2013560 (2013)","DOI":"10.1145\/2508859.2516744"},{"issue":"9","key":"18_CR25","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MC.2011.224","volume":"44","author":"F Kerschbaum","year":"2011","unstructured":"Kerschbaum, F., Schr\u00f6pfer, A., Zilli, A., Pibernik, R., Catrina, O., de Hoogh, S., Schoenmakers, B., Cimato, S., Damiani, E.: Secure collaborative supply-chain management. IEEE Comput. 44(9), 38\u201343 (2011)","journal-title":"IEEE Comput."},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-319-13257-0_11","volume-title":"Information Security","author":"T Krips","year":"2014","unstructured":"Krips, T., Willemson, J.: Hybrid model of fixed and floating point numbers in secure multiparty computations. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S.M. (eds.) ISC 2014. LNCS, vol. 8783, pp. 179\u2013197. Springer, Heidelberg (2014)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Laud, P., Randmets, J.: A domain-specific language for low-level secure multiparty computation protocols. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, 12\u201316 October 2015 [2], pp. 1492\u20131503 (2015)","DOI":"10.1145\/2810103.2813664"},{"issue":"2","key":"18_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptology 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptology"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.W.: Automating efficient ram-model secure computation. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, 18\u201321 May 2014, pp. 623\u2013638. IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Y.C., Chiang, Y.T., Hsu, T.S., Liau, C.J., Wang, D.W.: Floating point arithmetic protocols for constructing secure data analysis application. Procedia Comput. Sci. 22, 152\u2013161 (2013). 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems - KES2013","DOI":"10.1016\/j.procs.2013.09.091"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Malka, L.: VMCrypt: modular software architecture for scalable secure computation. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, 17\u201321 October 2011, pp. 715\u2013724. ACM (2011)","DOI":"10.1145\/2046707.2046787"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Pettai, M., Laud, P.: Automatic proofs of privacy of secure multi-party computation protocols against active adversaries. In: 2015 IEEE 28th Computer Security Foundations Symposium (CSF 2015) (2015)","DOI":"10.1109\/CSF.2015.13"},{"key":"18_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-662-48051-9_13","volume-title":"Financial Cryptography and Data Security","author":"P Pullonen","year":"2015","unstructured":"Pullonen, P., Siim, S.: Combining secret sharing and garbled circuits for efficient private IEEE 754 floating-point computations. In: Brenner, M., Christin, N., Johnson, B., Rohloff, K. (eds.) FC 2015 Workshops. LNCS, vol. 8976, pp. 172\u2013183. Springer, Heidelberg (2015)"},{"issue":"11","key":"18_CR34","doi-asserted-by":"crossref","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":"18_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Steele, A., Blanton, M.: PICCO: a general-purpose compiler for private distributed computation. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013 [1], pp. 813\u2013826","DOI":"10.1145\/2508859.2516752"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53357-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T02:23:12Z","timestamp":1568341392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53357-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533567","9783662533574"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53357-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}