{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T16:10:30Z","timestamp":1775146230498,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030996185","type":"print"},{"value":"9783030996192","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-99619-2_48","type":"book-chapter","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:19:48Z","timestamp":1648617588000},"page":"504-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Highly Scalable Beaver Triple Generator from\u00a0Additively Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Huafei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wee Keong","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Demmler, D., et al.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS 2015 (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: High-throughput semi-honest secure three-party computation with an honest majority. In: 23rd ACM SIGSAC Conference on Computer and Communications Security, Austria, Vienna, October 2013, pp. 805\u2013817 (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"48_CR4","first-page":"446","volume-title":"29th Annual ACM Symposium on Theory of Computing","author":"D Beaver","year":"1997","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: 29th Annual ACM Symposium on Theory of Computing, pp. 446\u2013455. ACM Press, TX, USA (1997)"},{"issue":"6","key":"48_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., et al.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Sec."},{"key":"48_CR6","first-page":"117","volume":"3","author":"D Bogdanov","year":"2016","unstructured":"Bogdanov, D., et al.: Students and taxes: a privacy-preserving study using secure computation. Proc. Priv. Enhanc. Technol. 3, 117\u2013135 (2016)","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"48_CR7","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":"48_CR8","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":"48_CR9","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":"48_CR10","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. II: Basic Applications. Cambridge University Press, UK (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Keller, M., et al.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: 23rd ACM SIGSAC Conference on Computer and Communications Security, Austria, Vienna, pp. 830\u2013842 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"48_CR13","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":"48_CR14","first-page":"46","volume":"216","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: How to simulate it - a tutorial on the simulation proof technique. IACR Cryptol. ePrint Arch. 216, 46 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Orsini, E., et al.: Overdrive2k: efficient secure MPC over $$\\mathbb{Z}_{2^k}$$ from somewhat homomorphic encryption. In: CT-RSA 2020, pp. 254\u2013283 (2020)","DOI":"10.1007\/978-3-030-40186-3_12"},{"key":"48_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"48_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-030-31578-8_19","volume-title":"Cryptology and Network Security","author":"D Rathee","year":"2019","unstructured":"Rathee, D., Schneider, T., Shukla, K.K.: Improved multiplication triple generation over rings via RLWE-based AHE. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 2019. LNCS, vol. 11829, pp. 347\u2013359. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_19"},{"key":"48_CR18","unstructured":"Smart, N.P., et al.: Commodity MPC via triples-as-a-service. In: CCSW@CCS, pp. 105\u2013116 (2019)"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Smart, N.P., et al.: TaaS: commodity MPC via triples-as-a-service. In: ACM SIGSAC Conference on Cloud Computing Security Workshop, London, UK, pp. 105\u2013116 (2019)","DOI":"10.1145\/3338466.3358918"},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"48_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11780656_26","volume-title":"Information Security and Privacy","author":"H Zhu","year":"2006","unstructured":"Zhu, H., Bao, F.: Oblivious scalar-product protocols. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 313\u2013323. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780656_26"},{"key":"48_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11689522_14","volume-title":"Information Security Practice and Experience","author":"H Zhu","year":"2006","unstructured":"Zhu, H., Bao, F., Li, T., Qiu, Y.: More on shared-scalar-product protocols. In: Chen, K., Deng, R., Lai, X., Zhou, J. (eds.) ISPEC 2006. LNCS, vol. 3903, pp. 142\u2013152. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11689522_14"},{"key":"48_CR23","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/0-387-33406-8_29","volume-title":"Security and Privacy in Dynamic Environments","author":"H Zhu","year":"2006","unstructured":"Zhu, H., Li, T., Bao, F.: Privacy-preserving shared-additive-inverse protocols and their applications. In: Fischer-H\u00fcbner, S., Rannenberg, K., Yngstr\u00f6m, L., Lindskog, S. (eds.) SEC 2006. IIFIP, vol. 201, pp. 340\u2013350. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/0-387-33406-8_29"},{"issue":"2020","key":"48_CR24","doi-asserted-by":"publisher","first-page":"198275","DOI":"10.1109\/ACCESS.2020.3034602","volume":"8","author":"H Zhu","year":"2020","unstructured":"Zhu, H., et al.: Privacy-preserving weighted federated learning within the secret sharing framework. IEEE Access 8(2020), 198275\u2013198284 (2020)","journal-title":"IEEE Access"},{"key":"48_CR25","unstructured":"Zhu, H.: A lightweight, anonymous and confidential genomic computing for industrial scale deployment. CoRR abs\/2110.01390 (2021)"}],"container-title":["Lecture Notes in Networks and Systems","Advanced Information Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99619-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:18:03Z","timestamp":1648621083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99619-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030996185","9783030996192"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99619-2_48","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AINA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Networking and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aina2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/voyager.ce.fit.ac.jp\/conf\/aina\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}