{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:11:34Z","timestamp":1772907094488,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031545276","type":"print"},{"value":"9783031545283","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54528-3_20","type":"book-chapter","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:06:29Z","timestamp":1708585589000},"page":"357-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure and\u00a0Private Approximated Coded Distributed Computing Using Elliptic Curve Cryptography"],"prefix":"10.1007","author":[{"given":"Houming","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"issue":"8","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/JPROC.2021.3087029","volume":"109","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Sun, J., Zhang, Y., Wei, Z., Chanussot, J.: Recent developments in parallel and distributed computing for remotely sensed big data processing. Proc. IEEE 109(8), 1282\u20131305 (2021)","journal-title":"Proc. IEEE"},{"key":"20_CR2","first-page":"508","volume":"6","author":"B G\u00fcler","year":"2020","unstructured":"G\u00fcler, B., Avestimehr, A.S., Ortega, A.: TACC: topology-aware coded computing for distributed graph processing. IEEE Trans. Sig. Inf. Process. Netw. 6, 508\u2013525 (2020)","journal-title":"IEEE Trans. Sig. Inf. Process. Netw."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/JSTSP.2022.3140660","volume":"16","author":"Y Guo","year":"2022","unstructured":"Guo, Y., Zhao, R., Lai, S., Fan, L., Lei, X., Karagiannidis, G.K.: Distributed machine learning for multiuser mobile edge computing systems. IEEE J. Sel. Top. Sig. Process. 16(3), 460\u2013473 (2022)","journal-title":"IEEE J. Sel. Top. Sig. Process."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Schlegel, R., Kumar, S., Rosnes, E., i\u00a0Amat, A.G.: Privacy-preserving coded mobile edge computing for low-latency distributed inference. IEEE J. Sel. Areas Commun. 40(3), 788\u2013799 (2022)","DOI":"10.1109\/JSAC.2022.3142295"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1109\/COMST.2021.3091684","volume":"23","author":"JS Ng","year":"2021","unstructured":"Ng, J.S., et al.: A comprehensive survey on coded distributed computing: fundamentals, challenges, and networking applications. IEEE Commun. Surv. Tut. 23(3), 1800\u20131837 (2021)","journal-title":"IEEE Commun. Surv. Tut."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1109\/TIT.2019.2963864","volume":"66","author":"Q Yu","year":"2020","unstructured":"Yu, Q., Maddah-Ali, M.A., Avestimehr, A.S.: Straggler mitigation in distributed matrix multiplication: fundamental limits and optimal coding. IEEE Trans. Inf. Theor. 66(3), 1920\u20131933 (2020)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TPAMI.2022.3151434","volume":"45","author":"T Jahani-Nezhad","year":"2023","unstructured":"Jahani-Nezhad, T., Maddah-Ali, M.A.: Berrut approximated coded computing: straggler resistance beyond polynomial computing. IEEE Trans. Pattern Anal. Mach. Intell. 45(1), 111\u2013122 (2023)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/JSAIT.2021.3085676","volume":"2","author":"T Jahani-Nezhad","year":"2021","unstructured":"Jahani-Nezhad, T., Maddah-Ali, M.A.: Optimal communication-computation trade-off in heterogeneous gradient coding. IEEE J. Sele. Areas Inf. Theor. 2(3), 1002\u20131011 (2021)","journal-title":"IEEE J. Sele. Areas Inf. Theor."},{"key":"20_CR9","unstructured":"Yu, Q., Maddah-Ali, M.A., Avestimehr, A.S.: Polynomial codes: an optimal design for high-dimensional coded matrix multiplication. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 4406\u20134416 (2017)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TIFS.2018.2846601","volume":"14","author":"H Yang","year":"2019","unstructured":"Yang, H., Lee, J.: Secure distributed computing with straggling servers using polynomial codes. IEEE Trans. Inf. Forensics Secur. 14(1), 141\u2013150 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"20_CR11","unstructured":"Yu, Q., Li, S., Raviv, N., Kalan, S.M.M., Soltanolkotabi, M., Avestimehr, S.A.: Lagrange coded computing: optimal design for resiliency, security, and privacy. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1215\u20131225 (2019)"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/TIT.2021.3133791","volume":"68","author":"E Ozfatura","year":"2021","unstructured":"Ozfatura, E., Ulukus, S., G\u00fcnd\u00fcz, D.: Coded distributed computing with partial recovery. IEEE Trans. Inf. Theor. 68(3), 1945\u20131959 (2021)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"12","key":"20_CR13","doi-asserted-by":"publisher","first-page":"7799","DOI":"10.1109\/TSMC.2022.3164024","volume":"52","author":"Y Jiang","year":"2022","unstructured":"Jiang, Y., et al.: Secure data transmission and trustworthiness judgement approaches against cyber-physical attacks in an integrated data-driven framework. IEEE Trans. Syst. Man Cybern. Syst. 52(12), 7799\u20137809 (2022)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.3390\/e25020266","volume":"25","author":"E Byrne","year":"2023","unstructured":"Byrne, E., Gnilke, O.W., Kliewer, J.: Straggler-and adversary-tolerant secure distributed matrix multiplication using polynomial codes. Entropy 25(2), 266 (2023)","journal-title":"Entropy"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"2722","DOI":"10.1109\/TIFS.2020.2972166","volume":"15","author":"M Aliasgari","year":"2020","unstructured":"Aliasgari, M., Simeone, O., Kliewer, J.: Private and secure distributed matrix multiplication with flexible communication load. IEEE Trans. Inf. Forensics Secur. 15, 2722\u20132734 (2020)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1007\/s11227-020-03318-7","volume":"77","author":"D Sadhukhan","year":"2021","unstructured":"Sadhukhan, D., Ray, S., Biswas, G., Khan, M.K., Dasgupta, M.: A lightweight remote user authentication scheme for IoT communication using elliptic curve cryptography. J. Supercomput. 77, 1114\u20131151 (2021)","journal-title":"J. Supercomput."},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(88)90067-3","volume":"15","author":"JP Berrut","year":"1988","unstructured":"Berrut, J.P.: Rational functions for guaranteed and experimentally well-conditioned global interpolation. Comput. Math. Appl. 15(1), 1\u201316 (1988)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/TIT.2019.2929328","volume":"66","author":"S Dutta","year":"2020","unstructured":"Dutta, S., Fahim, M., Haddadpour, F., Jeong, H., Cadambe, V., Grover, P.: On the optimal recovery threshold of coded matrix multiplication. IEEE Trans. Inf. Theor. 66(1), 278\u2013301 (2020)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54528-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:28:44Z","timestamp":1708586924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54528-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545276","9783031545283"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54528-3_20","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Corfu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cony +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"176","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}