{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:54Z","timestamp":1742913354299,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819790524"},{"type":"electronic","value":"9789819790531"}],"license":[{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"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-97-9053-1_14","type":"book-chapter","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T19:02:33Z","timestamp":1729796553000},"page":"240-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Large-Scale Multi-party Computation Based on Garbled Circuit"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7441-2954","authenticated-orcid":false,"given":"Zhusen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8125-1586","authenticated-orcid":false,"given":"Jiafei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8578-2635","authenticated-orcid":false,"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,25]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. ACM (1990)","DOI":"10.1145\/100216.100287"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Lindell, Y., Omri, E.: Optimizing semi-honest secure multiparty computation for the internet. In: Procceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 578\u2013590. ACM (2016)","DOI":"10.1145\/2976749.2978347"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cascudo, I., Damg\u00e5rd, I., David, B., D\u00f6ttling, N., Nielsen, J.B.: Rate-1, linear time and additively homomorphic UC commitments. In: CRYPTO 2016, vol.\u00a09816, pp. 179\u2013207 (2016)","DOI":"10.1007\/978-3-662-53015-3_7"},{"key":"14_CR4","unstructured":"Chowdhury, A.R., Guo, C., Jha, S., van\u00a0der Maaten, L.: Eiffel: Ensuring integrity for federated learning. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 2535\u20132549 (2022)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Advances in Cryptology\u2014CRYPTO 2005: 25th Annual International Cryptology Conference, vol.\u00a03621, pp. 378\u2013394. Springer, Berlin (2005)","DOI":"10.1007\/11535218_23"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO 2012, pp. 643\u2013662 (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Green, M., Miers, I.: Bolt: anonymous payment channels for decentralized currencies. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 473\u2013489. ACM (2017)","DOI":"10.1145\/3133956.3134093"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00145-023-09465-3","volume":"36","author":"C Hazay","year":"2023","unstructured":"Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Actively secure garbled circuits with constant communication overhead in the plain model. J. Cryptol. 36(3), 26 (2023)","journal-title":"J. Cryptol."},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00145-020-09355-y","volume":"33","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round MPC combining BMR and oblivious transfer. J. Cryptol. 33(4), 1732\u20131786 (2020)","journal-title":"J. Cryptol."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Katz, J., Ranellucci, S., Rosulek, M., Wang, X.: Optimizing authenticated garbling for faster secure two-party computation. In: CRYPTO 2018, Santa Barbara, CA, USA, pp. 365\u2013391 (2018)","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS, pp. 1575\u20131590 (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Advances in Cryptology, EUROCRYPT 2018\u201437th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol. 10822, pp. 158\u2013189. Springer, Berlin (2018)","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: ICALP 2008, pp. 486\u2013498 (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2015","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2015)","journal-title":"J. Cryptol."},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"8007","DOI":"10.1109\/TII.2023.3342882","volume":"20","author":"Z Liu","year":"2024","unstructured":"Liu, Z., Wang, L., Bao, H., Cao, Z., Zhou, L., Liu, Z.: Efficient and privacy-preserving cloud-assisted two-party computation scheme in heterogeneous networks. IEEE Trans. Industr. Inf. 20(5), 8007\u20138018 (2024)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"14_CR16","unstructured":"Malozemoff, A.J., Wang, X., Katz, J.: emp-toolkit. https:\/\/github.com\/emp-toolkit"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: CRYPTO 2012, pp. 681\u2013700 (2012)","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Rosulek, M., Roy, L.: Three halves make a whole? Beating the half-gates lower bound for garbled circuits. In: Annual International Cryptology Conference, pp. 94\u2013124. Springer, Berlin (2021)","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Rotaru, D., Wood, T.: Marbled circuits: mixing arithmetic and Boolean circuits with active security. In: Progress in Cryptology, INDOCRYPT 2019\u201420th International Conference on Cryptology in India. Lecture Notes in Computer Science, vol. 11898, pp. 227\u2013249. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-35423-7_12"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 39\u201356 (2017)","DOI":"10.1145\/3133956.3133979"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Yang, K., Wang, X., Zhang, J.: More efficient MPC from improved triple generation and authenticated garbling. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, pp. 1627\u20131646 (2020)","DOI":"10.1145\/3372297.3417285"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole\u2014reducing data transfer in garbled circuits using half gates. In: EUROCRYPT 2015, pp. 220\u2013250 (2015)","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, F., Maram, D., Malvai, H., Goldfeder, S., Juels, A.: DECO: liberating web data using decentralized oracles for TLS. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS2020, pp. 1919\u20131938. ACM (2020)","DOI":"10.1145\/3372297.3417239"},{"issue":"6","key":"14_CR25","doi-asserted-by":"publisher","first-page":"3607","DOI":"10.1109\/TDSC.2021.3103336","volume":"19","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Zhang, B., Kiayias, A., Zacharias, T., Ren, K.: An efficient E2E crowd verifiable e-voting system. IEEE Trans. Dependable Secur. Comput. 19(6), 3607\u20133620 (2021)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"14_CR26","unstructured":"Zheng, W., Deng, R., Chen, W., Popa, R.A., Panda, A., Stoica, I.: Cerebro: a platform for multi-party cryptographic collaborative learning. In: Proceedings of USENIX Security Symposium 2021, pp. 2723\u20132740. USENIX Association (2021)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Zheng, W., Popa, R.A., Gonzalez, J.E., Stoica, I.: Helen: maliciously secure coopetitive learning for linear models. In: 2019 IEEE Symposium on Security and Privacy (IEEE S &P), pp. 724\u2013738 (2019)","DOI":"10.1109\/SP.2019.00045"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-9053-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T19:07:03Z","timestamp":1729796823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-9053-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,25]]},"ISBN":["9789819790524","9789819790531"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-9053-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,25]]},"assertion":[{"value":"25 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ispec2024.github.io\/ISPEC2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}