{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:13:51Z","timestamp":1753600431568,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708581"},{"type":"electronic","value":"9789819708598"}],"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-981-97-0859-8_23","type":"book-chapter","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:02:20Z","timestamp":1708963340000},"page":"378-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Test-and-Decode: A Partial Recovery Scheme for\u00a0Verifiable Coded Computing"],"prefix":"10.1007","author":[{"given":"Wei","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0766-9906","authenticated-orcid":false,"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3336-2369","authenticated-orcid":false,"given":"Lingzhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3830-9388","authenticated-orcid":false,"given":"Dongyang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Tang, T., Ali, R.E., Hashemi, H., Gangwani, T., Avestimehr, S., Annavaram, M.: Adaptive verifiable coded computing: towards fast, secure and private distributed machine learning. In: Proceedings of IEEE International Parallel Distribution Processing Symposium (IPDPS), pp. 628\u2013638 (2022)","DOI":"10.1109\/IPDPS53621.2022.00067"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TCOMM.2020.3032196","volume":"69","author":"Q Yu","year":"2020","unstructured":"Yu, Q., Avestimehr, A.S.: Coded computing for resilient, secure, and privacy-preserving distributed matrix multiplication. IEEE Trans. Commun. 69(1), 59\u201372 (2020)","journal-title":"IEEE Trans. Commun."},{"key":"23_CR3","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: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 1215\u20131225 (2019)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Lee, K., Suh, C., Ramchandran, K.: High-dimensional coded matrix multiplication. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2418\u20132422 (2017)","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Fan, X., Soto, P., Zhong, X., Xi, D., Wang, Y., Li, J.: Leveraging stragglers in coded computing with heterogeneous servers. In: Proceedings of IEEE International Symposium on Quality of Service (IWQoS), pp. 1\u201310. IEEE (2020)","DOI":"10.1109\/IWQoS49365.2020.9213028"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Liu, S., Jiang, C.: A novel prediction approach based on three-way decision for cloud datacenters. Appl. Intell., 1\u201317 (2023)","DOI":"10.1007\/s10489-023-04505-8"},{"issue":"1","key":"23_CR7","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. Theory 66(1), 278\u2013301 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Sarmasarkar, S., Lalitha, V., Karamchandani, N.: On gradient coding with partial recovery. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2274\u20132279 (2021)","DOI":"10.1109\/ISIT45174.2021.9517849"},{"issue":"3","key":"23_CR9","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. Theory 68(3), 1945\u20131959 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Qiu, H., et al.: EC-Fusion: an efficient hybrid erasure coding framework to improve both application and recovery performance in cloud storage systems. In: Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp. 191\u2013201 (2020)","DOI":"10.1109\/IPDPS47924.2020.00029"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Solanki, A., Cardone, M., Mohajer, S.: Non-colluding attacks identification in distributed computing. In: Proceedings of the IEEE Information Theory Workshop (ITW), pp. 1\u20135 (2019)","DOI":"10.1109\/ITW44776.2019.8989337"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/JSAC.2022.3142364","volume":"40","author":"S Hong","year":"2022","unstructured":"Hong, S., Yang, H., Lee, J.: Hierarchical group testing for byzantine attack identification in distributed matrix multiplication. IEEE J. Sel. Areas Commun. 40(3), 1013\u20131029 (2022)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TIFS.2022.3147638","volume":"17","author":"J Li","year":"2022","unstructured":"Li, J., Hollanti, C.: Private and secure distributed matrix multiplication schemes for replicated or MDS-coded servers. IEEE Trans. Inf. Forensics Secur. 17, 659\u2013669 (2022)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"23_CR14","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. Theory 66(3), 1920\u20131933 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/JSAC.2022.3142358","volume":"40","author":"S Ulukus","year":"2022","unstructured":"Ulukus, S., Avestimehr, S., Gastpar, M., Jafar, S., Tandon, R., Tian, C.: Private retrieval, computing and learning: recent progress and future challenges. IEEE J. Sel. Areas Commun. 40(3), 729\u2013748 (2022)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Fu, M., Wang, J., Zhou, J., Wang, J., Lu, K., Zhou, X.: A null-space-based verification scheme for coded edge computing against pollution attacks. In: Proceedings of IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp. 454\u2013461 (2019)","DOI":"10.1109\/ICPADS47876.2019.00071"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Lu, Z., Fu, M., Wang, J., Lv, K., Jukan, A.: Decode-and-compare: an efficient verification scheme for coded distributed edge computing. IEEE Trans. Cloud Comput., 1\u201318 (2022)","DOI":"10.1109\/TCC.2022.3228243"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/JSAIT.2021.3054865","volume":"2","author":"S Sahraei","year":"2021","unstructured":"Sahraei, S., Maddah-Ali, M.A., Avestimehr, A.S.: Interactive verifiable polynomial evaluation. IEEE J. Sel. Areas Inf. Theory 2(1), 317\u2013325 (2021)","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Dutta, S., Cadambe, V., Grover, P.: Coded convolution for parallel and distributed computing within a deadline. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2403\u20132407 (2017)","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"23_CR20","unstructured":"Bitar, R., Xhemrishi, M., Wachter-Zeh, A.: Fountain codes for private distributed matrix-matrix multiplication. In: Proceedings of International Symposium on Information Theory and Its Applications (ISITA), pp. 480\u2013484 (2020)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Hofmeister, C., Bitar, R., Xhemrishi, M., Wachter-Zeh, A.: Secure private and adaptive matrix multiplication beyond the singleton bound. IEEE J. Sel. Areas Inf., Theory (2022)","DOI":"10.1109\/JSAIT.2022.3180941"},{"key":"23_CR22","unstructured":"Yu, Q., Maddah-Ali, M., Avestimehr, S.: Polynomial codes: an optimal design for high-dimensional coded matrix multiplication. In: Proceedings of Advance Neural Information Processing Systems(NIPS), pp. 4403\u20134413 (2017)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Chang, W.T., Tandon, R.: On the capacity of secure distributed matrix multiplication. In: Proceedings of IEEE Global Communications Conference (GLOBECOM), pp. 1\u20136 (2018)","DOI":"10.1109\/GLOCOM.2018.8647313"},{"issue":"6","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1137\/08073408X","volume":"40","author":"KS Kedlaya","year":"2011","unstructured":"Kedlaya, K.S., Umans, C.: Fast polynomial factorization and modular composition. SIAM J. Comput. 40(6), 1767\u20131802 (2011)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0859-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T16:10:24Z","timestamp":1708963824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0859-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708581","9789819708598"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0859-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","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":"145","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":"33% - 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":"5","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)"}}]}}