{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:05:45Z","timestamp":1743030345083,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609536"},{"type":"electronic","value":"9789819609543"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0954-3_3","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:21Z","timestamp":1738345821000},"page":"43-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Five-Party Computation with\u00a0Private Robustness and\u00a0Minimal Online Communication"],"prefix":"10.1007","author":[{"given":"Hikaru","family":"Tsuchida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Nishide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Optimized honest-majority mpc for malicious adversaries-breaking the 1 billion-gate per second barrier. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 843\u2013862. IEEE (2017)","DOI":"10.1109\/SP.2017.15"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 805\u2013817 (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"3_CR4","first-page":"459","volume":"2020","author":"M Byali","year":"2020","unstructured":"Byali, M., Chaudhari, H., Patra, A., Suresh, A.: FLASH: fast and robust framework for privacy-preserving machine learning. Proc. Priv. Enhan. Technol. 2020(2), 459\u2013480 (2020)","journal-title":"Proc. Priv. Enhan. Technol."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhari, H., Rachuri, R., Suresh, A.: Trident: efficient 4pc framework for privacy preserving machine learning. In: NDSS. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.23005"},{"key":"3_CR8","unstructured":"Dalskov, A.P.K., Escudero, D., Keller, M.: Fantastic four: honest-majority four-party secure computation with malicious security. In: USENIX Security Symposium, pp. 2183\u20132200. USENIX Association (2021)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dalskov, A.P.K., Escudero, D., Nof, A.: Fast fully secure multi-party computation over any ring with two-thirds honest majority. In: CCS, pp. 653\u2013666. ACM (2022)","DOI":"10.1145\/3548606.3559389"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/978-3-319-96881-0_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Damg\u00e5rd","year":"2018","unstructured":"Damg\u00e5rd, I., Orlandi, C., Simkin, M.: Yet another compiler for active security or: efficient MPC over arbitrary rings. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 799\u2013829. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_27"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Lindell, Y.: Two-thirds honest-majority mpc for malicious adversaries at almost the cost of semi-honest. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1557\u20131571 (2019)","DOI":"10.1145\/3319535.3339811"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-56614-6_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Furukawa","year":"2017","unstructured":"Furukawa, J., Lindell, Y., Nof, A., Weinstein, O.: High-throughput secure three-party computation for malicious adversaries and an honest majority. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 225\u2013255. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_8"},{"key":"3_CR13","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":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-03332-3_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"SD Gordon","year":"2018","unstructured":"Gordon, S.D., Ranellucci, S., Wang, X.: Secure computation with low communication from cross-checking. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 59\u201385. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_3"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Koti, N., Kukkala, V.B., Patra, A., Raj\u00a0Gopal, B.: Pentagod: stepping beyond traditional god with five parties. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 1843\u20131856 (2022)","DOI":"10.1145\/3548606.3559369"},{"key":"3_CR16","unstructured":"Koti, N., Pancholi, M., Patra, A., Suresh, A.: SWIFT: super-fast and robust privacy-preserving machine learning. In: USENIX Security Symposium, pp. 2651\u20132668. USENIX Association (2021)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Koti, N., Patra, A., Rachuri, R., Suresh, A.: Tetrad: actively secure 4pc for secure training and inference. In: NDSS. The Internet Society (2022)","DOI":"10.14722\/ndss.2022.24058"},{"issue":"5","key":"3_CR18","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. SIAM J. Comput. 39(5), 2090\u20132112 (2010)","journal-title":"SIAM J. Comput."},{"key":"3_CR19","unstructured":"Mohassel, P., Rindal, P.: Aby$$ ^{\\text{3}}$$: a mixed protocol framework for machine learning. In: ACM Conference on Computer and Communications Security, pp. 35\u201352. ACM (2018)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Patra, A., Suresh, A.: BLAZE: blazing fast privacy-preserving machine learning. In: NDSS. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.24202"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0954-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:32Z","timestamp":1738345832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0954-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609536","9789819609543"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0954-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2024.github.io\/ProvSec2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}