{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:59:32Z","timestamp":1790816372347,"version":"4.1.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030884277","type":"print"},{"value":"9783030884284","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-88428-4_18","type":"book-chapter","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T02:03:11Z","timestamp":1633053791000},"page":"352-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Complexity and Performance of Secure Floating-Point Polynomial Evaluation Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7498-9881","authenticated-orcid":false,"given":"Octavian","family":"Catrina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,2]]},"reference":[{"key":"18_CR1","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) (2013)"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10207-016-0350-0","volume":"16","author":"M Aliasgari","year":"2017","unstructured":"Aliasgari, M., Blanton, M., Bayatbabolghani, F.: Secure computation of hidden Markov models and secure floating-point arithmetic in the malicious model. Int. J. Inf. Secur. 16(6), 577\u2013601 (2017). https:\/\/doi.org\/10.1007\/s10207-016-0350-0","journal-title":"Int. J. Inf. Secur."},{"key":"18_CR3","unstructured":"Aly, A., et al.: SCALE and MAMBA documentation. https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/. Accessed Apr 2020"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-030-21568-2_25","volume-title":"Applied Cryptography and Network Security","author":"A Aly","year":"2019","unstructured":"Aly, A., Smart, N.P.: Benchmarking privacy preserving scientific operations. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 509\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_25"},{"issue":"03","key":"18_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TDSC.2016.2587623","volume":"15","author":"D Bogdanov","year":"2018","unstructured":"Bogdanov, D., Kamm, L., Laur, S., Sokk, V.: Rmind: a tool for cryptographically secure statistical analysis. IEEE Trans. Dependable Secure Comput. 15(03), 481\u2013495 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"6","key":"18_CR6","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10207-012-0177-2","journal-title":"Int. J. Inf. Secur."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Catrina, O.: Round-efficient protocols for secure multiparty fixed-point arithmetic. In: 12th International Conference on Communications (COMM 2018), pp. 431\u2013436. IEEE (2018)","DOI":"10.1109\/ICComm.2018.8484794"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Catrina, O.: Optimization and tradeoffs in secure floating-point computation: products, powers, and polynomials. In: 6th Conference on the Engineering of Computer Based Systems (ECBS 2019), pp. 7:1\u20137:10. ACM (2019)","DOI":"10.1145\/3352700.3352707"},{"key":"18_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-52686-3_5","volume-title":"E-Business and Telecommunications","author":"O Catrina","year":"2020","unstructured":"Catrina, O.: Evaluation of floating-point arithmetic protocols based on Shamir secret sharing. In: Obaidat, M.S. (ed.) ICETE 2019. CCIS, vol. 1247, pp. 108\u2013131. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52686-3_5"},{"issue":"1","key":"18_CR10","first-page":"21","volume":"21","author":"O Catrina","year":"2020","unstructured":"Catrina, O.: Optimizing secure floating-point arithmetic: sums, dot products, and polynomials. Proc. Rom. Acad. (Ser. A) 21(1), 21\u201328 (2020)","journal-title":"Proc. Rom. Acad. (Ser. A)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Catrina, O.: Performance analysis of secure floating-point sums and dot products. In: 13th International Conference on Communications (COMM 2020), pp. 465\u2013470. IEEE (2020)","DOI":"10.1109\/COMM48946.2020.9141961"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19"},{"key":"18_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-72540-4_24","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Non-interactive proofs for integer multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412\u2013429. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_24"},{"issue":"6","key":"18_CR15","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10207-014-0271-8","journal-title":"Int. J. Inf. Secur."},{"key":"18_CR16","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":"18_CR17","unstructured":"Knuth, D.E.: The Art of Computer Programming, volume 2: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Boston (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88428-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:04:49Z","timestamp":1790813089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88428-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030884277","9783030884284"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88428-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2021.athene-center.de\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"351","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":"71","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":"20% - 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.07","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":"6.06","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}