{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:58:14Z","timestamp":1742932694905,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609567"},{"type":"electronic","value":"9789819609574"}],"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-0957-4_8","type":"book-chapter","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:34:03Z","timestamp":1738272843000},"page":"143-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication-Efficient Secure Neural Network via\u00a0Key-Reduced Distributed Comparison Function"],"prefix":"10.1007","author":[{"given":"Peng","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zoe Lin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiqi","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongxiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangyiye","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junbin","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,31]]},"reference":[{"key":"8_CR1","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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-030-77886-6_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"E Boyle","year":"2021","unstructured":"Boyle, E., et al.: Function secret sharing for mixed-mode and fixed-point secure computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 871\u2013900. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_30"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1292\u20131303. ACM, Vienna (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-36030-6_14","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 341\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_14"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Chaudhari, H., Rachuri, R., Suresh, A.: Trident: efficient 4PC framework for privacy preserving machine learning. In: Network and Distributed System Security Symposium (2020). https:\/\/doi.org\/10.14722\/ndss.2020.23005","DOI":"10.14722\/ndss.2020.23005"},{"key":"8_CR7","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":"8_CR8","doi-asserted-by":"publisher","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: Network and Distributed System Security Symposium (2015). https:\/\/doi.org\/10.14722\/ndss.2015.23113","DOI":"10.14722\/ndss.2015.23113"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Doerner, J., Shelat, A.: Scaling ORAM for secure computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 523\u2013535. ACM, Dallas (2017). https:\/\/doi.org\/10.1145\/3133956.3133967","DOI":"10.1145\/3133956.3133967"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Feng, D., Yang, K.: Concretely efficient secure multi-party computation protocols: survey and more. In: Security and Safety, p. 2021001 (2022). https:\/\/doi.org\/10.1051\/sands\/2021001","DOI":"10.1051\/sands\/2021001"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM, Bethesda (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Foundations of Cryptography: volume 2, Basic Applications. Cambridge university press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656","DOI":"10.1017\/CBO9780511721656"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM, New York (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Gupta, K., Kumaraswamy, D., Chandran, N., Gupta, D.: LLAMA: a low latency math library for secure inference. In: Proceedings on Privacy Enhancing Technologies, pp. 274\u2013294 (2022). https:\/\/doi.org\/10.56553\/popets-2022-0109","DOI":"10.56553\/popets-2022-0109"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Jawalkar, N., Gupta, K., Basu, A., Chandran, N., Gupta, D., Sharma, R.: Orca: FSS-based secure training and inference with GPUs. In: 2024 IEEE Symposium on Security and Privacy, pp. 66\u201366. IEEE, San Francisco (2024). https:\/\/doi.org\/10.1109\/SP54263.2024.00063","DOI":"10.1109\/SP54263.2024.00063"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Koti, N., Patra, A., Rachuri, R., Suresh, A.: Tetrad: actively secure 4PC for secure training and inference. In: Network and Distributed System Security Symposium (2022). https:\/\/doi.org\/10.14722\/ndss.2022.24058","DOI":"10.14722\/ndss.2022.24058"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: How to simulate it\u2013a tutorial on the simulation proof technique. In: Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich, pp. 277\u2013346 (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rindal, P.: ABY3: a mixed protocol framework for machine learning. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 35\u201352. ACM, Toronto (2018). https:\/\/doi.org\/10.1145\/3243734.3243760","DOI":"10.1145\/3243734.3243760"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: 2017 IEEE Symposium on Security and Privacy, pp. 19\u201338. IEEE, San Jose (2017). https:\/\/doi.org\/10.1109\/SP.2017.12","DOI":"10.1109\/SP.2017.12"},{"key":"8_CR21","unstructured":"Patra, A., Schneider, T., Suresh, A., Yalame, H.: ABY2.0: improved mixed-protocol secure two-party computation. In: 30th USENIX Security Symposium, pp. 2165\u20132182. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/patra"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Ryffel, T., Tholoniat, P., Pointcheval, D., Bach, F.: AriaNN: low-interaction privacy-preserving deep learning via function secret sharing. In: Proceedings on Privacy Enhancing Technologies, pp. 291\u2013316 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0015","DOI":"10.2478\/popets-2022-0015"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Storrier, K., Vadapalli, A., Lyons, A., Henry, R.: Grotto: screaming fast $$(2+1)$$-PC for $$\\mathbb{Z} _{2^n}$$ via (2, 2)-DPFs. In: 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 2143\u20132157. ACM, Copenhagen (2023). https:\/\/doi.org\/10.1145\/3576915.3623147","DOI":"10.1145\/3576915.3623147"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. In: Proceedings on Privacy Enhancing Technologies, pp. 26\u201349 (2019). https:\/\/doi.org\/10.2478\/popets-2019-0035","DOI":"10.2478\/popets-2019-0035"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Wagh, S., Tople, S., Benhamouda, F., Kushilevitz, E., Mittal, P., Rabin, T.: Falcon: honest-majority maliciously secure framework for private deep learning. In: Proceedings on Privacy Enhancing Technologies, pp. 188\u2013208 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0011","DOI":"10.2478\/popets-2021-0011"},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1607\u20131626. ACM, Virtual Event (2020). https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"},{"key":"8_CR27","unstructured":"Yang, P., et al.: FssNN: communication-efficient secure neural network training via function secret sharing. Cryptology ePrint Archive, Paper 2023\/073 (2023). https:\/\/eprint.iacr.org\/2023\/073"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","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-0957-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:34:06Z","timestamp":1738272846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0957-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609567","9789819609574"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0957-4_8","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":"31 January 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"}}]}}