{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:52Z","timestamp":1740123832074,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"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":["Wireless Netw"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s11276-022-03040-7","type":"journal-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T15:44:20Z","timestamp":1657035860000},"page":"3261-3274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal-round preprocessing-MPC of polynomials over non-zero inputs via distributed random matrix"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9295-6541","authenticated-orcid":false,"given":"Dor","family":"Bitan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"3040_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., & Tsabary R. (2018). Perfect secure computation in two rounds. In Theory of cryptography conference (pp. 152\u2013174). Springer.","DOI":"10.1007\/978-3-030-03807-6_6"},{"key":"3040_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., & Rogaway, P. (1990). The round complexity of secure protocols. In Proceedings of the twenty-second annual ACM symposium on theory of computing (pp. 503\u2013513). ACM.","DOI":"10.1145\/100216.100287"},{"key":"3040_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., & Wigderson, A. (1988). Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM symposium on theory of computing (pp. 1\u201310). ACM.","DOI":"10.1145\/62212.62213"},{"key":"3040_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I. (1988). Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on theory of computing (pp. 11\u201319). ACM.","DOI":"10.1145\/62212.62214"},{"key":"3040_CR5","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., & Nielsen, J. B. (2003). Universally composable efficient multiparty computation from threshold homomorphic encryption. In Annual international cryptology conference (pp. 247\u2013264). Springer.","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"3040_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., & Wigderson, A. (1987). How to play any mental game. In Proceedings of the nineteenth annual ACM symposium on theory of computing (pp. 218\u2013229). ACM.","DOI":"10.1145\/28395.28420"},{"key":"3040_CR7","unstructured":"Rivest, R. (1999). Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer."},{"key":"3040_CR8","first-page":"160","volume":"82","author":"AC-C Yao","year":"1982","unstructured":"Yao, A. C.-C. (1982). Protocols for secure computations. FOCS, 82, 160\u2013164.","journal-title":"FOCS"},{"key":"3040_CR9","doi-asserted-by":"crossref","unstructured":"Beaver, D. (1997). Commodity-based cryptography. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (pp. 446\u2013455). ACM.","DOI":"10.1145\/258533.258637"},{"key":"3040_CR10","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., & Paskin-Cherniavsky, A. (2013). On the power of correlated randomness in secure computation. In Theory of cryptography conference (pp. 600\u2013620). Springer.","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"3040_CR11","volume-title":"Communication complexity","author":"Eyal Kushilevitz","year":"2006","unstructured":"Kushilevitz, E., & Nisan, N. (2006). Communication complexity. Cambridge University Press."},{"issue":"11","key":"3040_CR12","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"Adi Shamir","year":"1979","unstructured":"Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"3040_CR13","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., & Beaver, D. (1989). Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Proceedings of the eighth annual ACM symposium on principles of distributed computing (pp. 201\u2013209). ACM.","DOI":"10.1145\/72981.72995"},{"key":"3040_CR14","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Larsen, K. G., & Nielsen, J. B. (2019). Communication lower bounds for statistically secure MPC, with or without preprocessing. IACR Cryptology, 2019, 220.","DOI":"10.1007\/978-3-030-26951-7_3"},{"key":"3040_CR15","doi-asserted-by":"crossref","unstructured":"Patra, A., & Ravi, D. (2018). On the exact round complexity of secure three-party computation. In Annual international cryptology conference (pp. 425\u2013458). Springer.","DOI":"10.1007\/978-3-319-96881-0_15"},{"key":"3040_CR16","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A. R., Goel, A., & Jain, A. (2018). Round-optimal secure multiparty computation with honest majority. In Annual international cryptology conference (pp. 395\u2013424). Springer.","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"3040_CR17","doi-asserted-by":"crossref","unstructured":"Garg, S., Ishai, Y., & Srinivasan, A. (2018) Two-round MPC: information-theoretic and black-box. In Theory of cryptography conference (pp. 123\u2013151). Springer.","DOI":"10.1007\/978-3-030-03807-6_5"},{"key":"3040_CR18","doi-asserted-by":"crossref","unstructured":"Couteau, G. (2019). A note on the communication complexity of multiparty computation in the correlated randomness model. In Advances in cryptology\u2014EUROCRYPT 2019\u201438th annual international conference on the theory and applications of cryptographic techniques, Darmstadt, Germany, 2019, proceedings, part II (pp. 473\u2013503).","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"3040_CR19","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J. B., Nielsen, M., & Ranellucci, S. (2017). The tinytable protocol for 2-party secure computation, or: Gate-scrambling revisited. In Advances in cryptology\u2014CRYPTO 2017\u201437th annual international cryptology conference, Santa Barbara, CA, 2017, proceedings, part I (pp. 167\u2013187).","DOI":"10.1007\/978-3-319-63688-7_6"},{"issue":"3","key":"3040_CR20","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1007\/s11276-022-02903-3","volume":"28","author":"AF-X Ametepe","year":"2022","unstructured":"Ametepe, A. F.-X., Ahouandjinou, A. S. R. M., & Ezin, E. C. (2022). Robust encryption method based on AES-CBC using elliptic curves Diffie\u2013Hellman to secure data in wireless sensor networks. Wireless Networks, 28(3), 991\u20131001.","journal-title":"Wireless Networks"},{"issue":"2","key":"3040_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11276-021-02881-y","volume":"28","author":"MR Akbari","year":"2022","unstructured":"Akbari, M. R., Barati, H., & Barati, A. (2022). An overlapping routing approach for sending data from things to the cloud inspired by fog technology in the large-scale IoT ecosystem. Wireless Networks, 28(2), 521\u2013538.","journal-title":"Wireless Networks"},{"issue":"5","key":"3040_CR22","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1109\/TNET.2015.2487344","volume":"24","author":"Xu Chen","year":"2016","unstructured":"Chen, X., Jiao, L., Li, W., & Xiaoming, F. (2016). Efficient multi-user computation offloading for mobile-edge cloud computing. IEEE\/ACM Transactions on Networking, 24(5), 2795\u20132808.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"3040_CR23","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11276-020-02457-2","volume":"27","author":"Philip Derbeko","year":"2021","unstructured":"Derbeko, P., Dolev, S., & Gudes, E. (2021). Wavelet-based dynamic and privacy-preserving similitude data models for edge computing. Wireless Networks, 27(1), 351\u2013366.","journal-title":"Wireless Networks"},{"issue":"8","key":"3040_CR24","doi-asserted-by":"publisher","first-page":"5125","DOI":"10.1007\/s11276-021-02792-y","volume":"27","author":"Sangeetha Ganesan","year":"2021","unstructured":"Ganesan, S., & Muthuswamy, V. (2021). Ensuring reliability of high-priority data transport using expected congestion shortfall prediction in wireless sensor networks. Wireless Networks, 27(8), 5125\u20135143.","journal-title":"Wireless Networks"},{"issue":"1","key":"3040_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s11276-021-02837-2","volume":"28","author":"Xinbin Li","year":"2022","unstructured":"Li, X., Shuo, X., Zhao, H., Han, S., & Yan, L. (2022). An adaptive multi-zone geographic routing protocol for underwater acoustic sensor networks. Wireless Networks, 28(1), 209\u2013223.","journal-title":"Wireless Networks"},{"issue":"3","key":"3040_CR26","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1007\/s11276-022-02909-x","volume":"28","author":"Jue Liu","year":"2022","unstructured":"Liu, J., & Yang, W. (2022). Secure UAV communication against cooperative adaptive eavesdroppers. Wireless Networks, 28(3), 1113\u20131128.","journal-title":"Wireless Networks"},{"issue":"8","key":"3040_CR27","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1109\/JPROC.2019.2918749","volume":"107","author":"Fang-Yu Rao","year":"2019","unstructured":"Rao, F.-Y., & Bertino, E. (2019). Privacy techniques for edge computing systems. Proceedings of the IEEE, 107(8), 1632\u20131654.","journal-title":"Proceedings of the IEEE"},{"key":"3040_CR28","doi-asserted-by":"crossref","unstructured":"Srinivas, M., & Amgoth, T. (2022). Data acquisition in large-scale wireless sensor networks using multiple mobile sinks: A hierarchical clustering approach. Wireless Networks, 28(2), 603\u2013619.","DOI":"10.1007\/s11276-021-02845-2"},{"issue":"2","key":"3040_CR29","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s11276-021-02862-1","volume":"28","author":"R Saida","year":"2022","unstructured":"Saida, R., Hadj Kacem, Y., BenSaleh, M. S., & Abid, M. (2022). A model based process for reconfigurable wireless sensor network development. Wireless Networks, 28(2), 567\u2013585.","journal-title":"Wireless Networks"},{"issue":"6","key":"3040_CR30","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1007\/s11276-021-02660-9","volume":"27","author":"SVN Santhosh Kumar","year":"2021","unstructured":"Santhosh Kumar, S. V. N., Palanichamy, Y., Selvi, M., Ganapathy, S., Kannan, A., & Pariserum Perumal, S. (2021). Energy efficient secured k means based unequal fuzzy clustering algorithm for efficient reprogramming in wireless sensor networks. Wireless Networks, 27(6), 3873\u20133894.","journal-title":"Wireless Networks"},{"issue":"6","key":"3040_CR31","doi-asserted-by":"publisher","first-page":"4229","DOI":"10.1007\/s11276-018-1892-z","volume":"27","author":"K Wang","year":"2021","unstructured":"Wang, K., XiaoYi, Y., Lin, W. L., Deng, Z. L., & Liu, X. (2021). Computing aware scheduling in mobile edge computing system. Wireless Networks, 27(6), 4229\u20134245.","journal-title":"Wireless Networks"},{"issue":"6","key":"3040_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/3065468","volume":"60","author":"A Wigderson","year":"2017","unstructured":"Wigderson, A. (2017). Technical perspective: Low-depth arithmetic circuits. Communications of the ACM, 60(6), 91\u201391.","journal-title":"Communications of the ACM"},{"key":"3040_CR33","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., & Zakarias, S. (2013). Constant-overhead secure computation of Boolean circuits using preprocessing. In Proceedings of theory of cryptography 2013\u2014The 10th theory of cryptography conference TCC (pp. 621\u2013641).","DOI":"10.1007\/978-3-642-36594-2_35"},{"issue":"3","key":"3040_CR34","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-011-9515-z","volume":"62","author":"Hossein Ghodosi","year":"2012","unstructured":"Ghodosi, H., Pieprzyk, J., & Steinfeld, R. (2012). Multi-party computation with conversion of secret sharing. Designs, Codes and Cryptography, 62(3), 259\u2013272.","journal-title":"Designs, Codes and Cryptography"},{"key":"3040_CR35","doi-asserted-by":"crossref","unstructured":"Halevi, S., Ishai, Y., Kushilevitz, E., & Rabin, T. (2018). Best possible information-theoretic MPC. In Theory of cryptography conference (pp. 255\u2013281). Springer.","DOI":"10.1007\/978-3-030-03810-6_10"},{"key":"3040_CR36","doi-asserted-by":"crossref","unstructured":"Valiant, L. G. (1979). Completeness classes in algebra. In Proceedings of the eleventh annual ACM symposium on theory of computing (pp. 249\u2013261). ACM.","DOI":"10.1145\/800135.804419"},{"key":"3040_CR37","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (1995). Private information retrieval. In Proceedings of IEEE 36th annual foundations of computer science (pp. 41\u201350). IEEE.","DOI":"10.1109\/SFCS.1995.492461"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-03040-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11276-022-03040-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-022-03040-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T18:16:20Z","timestamp":1663611380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11276-022-03040-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,5]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["3040"],"URL":"https:\/\/doi.org\/10.1007\/s11276-022-03040-7","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2022,7,5]]},"assertion":[{"value":"24 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}