{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:55Z","timestamp":1740123595768,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003848","name":"Industrial Technology Research Institute","doi-asserted-by":"publisher","award":["B5-11005-HQ-08"],"award-info":[{"award-number":["B5-11005-HQ-08"]}],"id":[{"id":"10.13039\/501100003848","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11227-022-04552-x","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T19:25:15Z","timestamp":1652297115000},"page":"16841-16860","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["POPS: an off-peak precomputing scheme for privacy-preserving computing"],"prefix":"10.1007","volume":"78","author":[{"given":"Po-Hsuan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Wei","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8967-1385","authenticated-orcid":false,"given":"Chia-Heng","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shen-Ming","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"issue":"2\u20133","key":"4552_CR1","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1561\/3300000019","volume":"2","author":"D Evans","year":"2018","unstructured":"Evans D, Kolesnikov V, Rosulek M (2018) A pragmatic introduction to secure multi-party computation. Found Trends Priv Secur 2(2\u20133):70\u2013246. https:\/\/doi.org\/10.1561\/3300000019","journal-title":"Found Trends Priv Secur"},{"key":"4552_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67522-0","volume-title":"Compilation for secure multi-party computation. Springer briefs in computer science","author":"N B\u00fcscher","year":"2017","unstructured":"B\u00fcscher N, Katzenbeisser S (2017) Compilation for secure multi-party computation. Springer briefs in computer science. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-67522-0"},{"key":"4552_CR3","doi-asserted-by":"publisher","unstructured":"D\u2019Arco P, Prisco RD (2013) Secure two-party computation: a visual way. In: Padr\u00f3 C (ed) Information Theoretic Security\u20147th International Conference, ICITS 2013, Singapore, November 28\u201330, 2013, Proceedings, Volume 8317 of Lecture Notes in Computer Science. Springer, pp 18\u201338. https:\/\/doi.org\/10.1007\/978-3-319-04268-8_2","DOI":"10.1007\/978-3-319-04268-8_2"},{"issue":"4","key":"4552_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar A, Aksu H, Uluagac AS, Conti M (2018) A survey on homomorphic encryption schemes: theory and implementation. ACM Comput Surv (CSUR) 51(4):1\u201335. https:\/\/doi.org\/10.1145\/3214303","journal-title":"ACM Comput Surv (CSUR)"},{"key":"4552_CR5","doi-asserted-by":"publisher","unstructured":"Boemer F, Lao Y, Cammarota R, Wierzynski C (2019) nGraph-HE: a graph compiler for deep learning on homomorphically encrypted data. In: ACM International Conference on Computing Frontiers. ACM, pp 3\u201313. https:\/\/doi.org\/10.1145\/3310273.3323047","DOI":"10.1145\/3310273.3323047"},{"key":"4552_CR6","doi-asserted-by":"publisher","unstructured":"Boemer F, Costache A, Cammarota R, Wierzynski C (2019) nGraph-HE2: a high-throughput framework for neural network inference on encrypted data. In: ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography. ACM, pp 45\u201356. https:\/\/doi.org\/10.1145\/3338469.3358944","DOI":"10.1145\/3338469.3358944"},{"key":"4552_CR7","doi-asserted-by":"publisher","unstructured":"Rathee D, Rathee M, Kumar N, Chandran N, Gupta D, Rastogi A, et\u00a0al (2020) CrypTFlow2: practical 2-party secure inference. In: ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 325\u2013342. https:\/\/doi.org\/10.1145\/3372297.3417274","DOI":"10.1145\/3372297.3417274"},{"key":"4552_CR8","doi-asserted-by":"publisher","unstructured":"Huang PH, Tu CH, Chung SM (2021) TONIC: towards oblivious neural inference compiler. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing. ACM, pp 491\u2013500. https:\/\/doi.org\/10.1145\/3412841.3441929","DOI":"10.1145\/3412841.3441929"},{"key":"4552_CR9","doi-asserted-by":"publisher","unstructured":"Yao ACC (1982) Protocols for secure computations. In: IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, pp 160\u2013164. https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"4552_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game or a completeness theorem for protocols with honest majority. In: ACM Symposium on Theory of Computing. ACM, pp 218\u2013229. https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"4552_CR11","doi-asserted-by":"publisher","unstructured":"Asharov G, Lindell Y, Schneider T, Zohner M (2013) More efficient oblivious transfer and extensions for faster secure computation. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. ACM, pp 535\u2013548. https:\/\/doi.org\/10.1145\/2508859.2516738","DOI":"10.1145\/2508859.2516738"},{"key":"4552_CR12","doi-asserted-by":"crossref","unstructured":"Demmler D, Schneider T, Zohner M (2015) ABY\u2014a framework for efficient mixed-protocol secure two-party computation. In: Network and Distributed System Security Symposium. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2015\/aby---framework-efficient-mixed-protocol-secure-two-party-computation","DOI":"10.14722\/ndss.2015.23113"},{"key":"4552_CR13","unstructured":"Wang X, Malozemoff AJ, Katz J EMP-toolkit: efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit"},{"key":"4552_CR14","doi-asserted-by":"publisher","unstructured":"Hussain S, Li B, Koushanfar F, Cammarota R (2020) TinyGarble2: smart, efficient, and scalable Yao\u2019s Garble circuit. In: Proceedings of the 2020 workshop on Privacy-Preserving Machine Learning in Practice. ACM, pp 65\u201367. https:\/\/doi.org\/10.1145\/3411501.3419433","DOI":"10.1145\/3411501.3419433"},{"key":"4552_CR15","doi-asserted-by":"publisher","unstructured":"Keller M (2020) MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 1575\u20131590. https:\/\/doi.org\/10.1145\/3372297.3417872","DOI":"10.1145\/3372297.3417872"},{"key":"4552_CR16","first-page":"1153","volume":"2015","author":"S Zahur","year":"2015","unstructured":"Zahur S, Evans D (2015) Obliv-C: a language for extensible data-oblivious computation. IACR Cryptol ePrint Arch 2015:1153","journal-title":"IACR Cryptol ePrint Arch"},{"key":"4552_CR17","doi-asserted-by":"publisher","unstructured":"Liu C, Wang XS, Nayak K, Huang Y, Shi E (2015) ObliVM: a programming framework for secure computation. In: IEEE Symposium on Security and Privacy. IEEE Computer Society, pp 359\u2013376. https:\/\/doi.org\/10.1109\/SP.2015.29","DOI":"10.1109\/SP.2015.29"},{"key":"4552_CR18","doi-asserted-by":"publisher","unstructured":"Ben-Efraim A, Nielsen M, Omri E (2019) Turbospeedz: double your online spdz! improving SPDZ using function dependent preprocessing. In: International Conference on Applied Cryptography and Network Security. Springer, pp 530\u2013549. https:\/\/doi.org\/10.1007\/978-3-030-21568-2_26","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"4552_CR19","unstructured":"Patra A, Schneider T, Suresh A, Yalame H (2021) ABY2.0: improved mixed-protocol secure two-party computation. In: USENIX Security Symposium. USENIX Association, pp 2165\u20132182. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/patra"},{"key":"4552_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/3490390","author":"L Braun","year":"2022","unstructured":"Braun L, Demmler D, Schneider T, Tkachenko O (2022) MOTION\u2014a framework for mixed-protocol multi-party computation. ACM Trans Privacy Secur. https:\/\/doi.org\/10.1145\/3490390","journal-title":"ACM Trans Privacy Secur"},{"key":"4552_CR21","doi-asserted-by":"publisher","unstructured":"Rathee D, Rathee M, Goli RKK, Gupta D, Sharma R, Chandran N, et\u00a0al (2021) SiRnn: a math library for secure RNN inference. In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24\u201327 May 2021. IEEE, pp 1003\u20131020. https:\/\/doi.org\/10.1109\/SP40001.2021.00086","DOI":"10.1109\/SP40001.2021.00086"},{"key":"4552_CR22","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd I, Pastro V, Smart N, Zakarias S (2012) Multiparty computation from somewhat homomorphic encryption. In: Annual Cryptology Conference. Springer, pp 643\u2013662. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"4552_CR23","doi-asserted-by":"publisher","unstructured":"Beaver D (1991) Efficient multiparty protocols using circuit randomization. In: Annual International Cryptology Conference, vol 576. Springer, pp 420\u2013432. https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"4552_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.erss.2018.01.018","volume":"38","author":"J Morley","year":"2018","unstructured":"Morley J, Widdicks K, Hazas M (2018) Digitalisation, energy and data demand: the impact of Internet traffic on overall and peak electricity consumption. Energy Res Soc Sci 38:128\u2013137. https:\/\/doi.org\/10.1016\/j.erss.2018.01.018","journal-title":"Energy Res Soc Sci"},{"key":"4552_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jpdc.2022.03.002","volume":"165","author":"Z Xiao","year":"2022","unstructured":"Xiao Z, Wang M, Chronopoulos AT, Jiang J (2022) A method for reducing cloud service request peaks based on game theory. J Parallel Distrib Comput 165:107\u2013119. https:\/\/doi.org\/10.1016\/j.jpdc.2022.03.002","journal-title":"J Parallel Distrib Comput"},{"key":"4552_CR26","doi-asserted-by":"publisher","unstructured":"He X, Meng X, Wang Y, Wang Z (2022) The impact of COVID-19 on various aspects of remote work software and future development. In: Proceedings of the 2022 7th International Conference on Financial Innovation and Economic Development (ICFIED 2022). Atlantis Press, pp 2761\u20132767. https:\/\/doi.org\/10.2991\/aebmr.k.220307.450","DOI":"10.2991\/aebmr.k.220307.450"},{"key":"4552_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of cryptography: basic applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich O (2004) Foundations of cryptography: basic applications, vol 2. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511721656"},{"key":"4552_CR28","doi-asserted-by":"publisher","unstructured":"Kolesnikov V, Schneider T (2008) Improved garbled circuit: free XOR gates and applications. In: International Colloquium on Automata, Languages, and Programming. Springer, pp 486\u2013498. https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"4552_CR29","doi-asserted-by":"publisher","unstructured":"Ishai Y, Kilian J, Nissim K, Petrank E (2003) Extending oblivious transfers efficiently. In: Annual International Cryptology Conference. Springer, pp 145\u2013161. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"issue":"6","key":"4552_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The mnist database of handwritten digit images for machine learning research. IEEE Signal Process Mag 29(6):141\u2013142. https:\/\/doi.org\/10.1109\/MSP.2012.2211477","journal-title":"IEEE Signal Process Mag"},{"key":"4552_CR31","doi-asserted-by":"publisher","unstructured":"Rouhani BD, Riazi MS, Koushanfar F (2018) Deepsecure: scalable provably-secure deep learning. In: Design Automation Conference. ACM, pp 1\u20136. https:\/\/doi.org\/10.1145\/3195970.3196023","DOI":"10.1145\/3195970.3196023"},{"key":"4552_CR32","doi-asserted-by":"publisher","unstructured":"Sandler M, Howard AG, Zhu M, Zhmoginov A, Chen LC (2018) MobileNetV2: inverted residuals and linear bottlenecks. In: IEEE\/CVF Conference on Computer Vision and Pattern Recognition. Computer Vision Foundation\/IEEE Computer Society, pp 4510\u20134520. https:\/\/doi.org\/10.1109\/CVPR.2018.00474","DOI":"10.1109\/CVPR.2018.00474"},{"key":"4552_CR33","doi-asserted-by":"publisher","unstructured":"Deng J, Dong W, Socher R, Li LJ, Li K, Fei-Fei L (2009) Imagenet: a large-scale hierarchical image database. In: IEEE Conference on Computer Vision and Pattern Recognition. IEEE Computer Society, pp 248\u2013255. https:\/\/doi.org\/10.1109\/CVPR.2009.5206848","DOI":"10.1109\/CVPR.2009.5206848"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04552-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04552-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04552-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T10:17:55Z","timestamp":1664878675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04552-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":33,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["4552"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04552-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,5,11]]},"assertion":[{"value":"18 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}