{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:10:19Z","timestamp":1743066619480,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031243820"},{"type":"electronic","value":"9783031243837"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-24383-7_12","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:18:49Z","timestamp":1674577129000},"page":"213-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure and\u00a0Private Coding for\u00a0Edge Computing Against Cooperative Attack with\u00a0Low Communication Cost and\u00a0Computational Load"],"prefix":"10.1007","author":[{"given":"Xiaotian","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingzhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1109\/TETCI.2020.3007905","volume":"4","author":"M Asim","year":"2020","unstructured":"Asim, M., Wang, Y., Wang, K., Huang, P.Q.: A review on computational intelligence techniques in cloud and edge computing. IEEE Trans. Emerg. Top. Comput. Intell. 4(6), 742\u2013763 (2020)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Wang, L., Jiao, L., He, T., Li, J., M\u00fchlh\u00e4user, M.: Service entity placement for social virtual reality applications in edge computing. In: Proceedings of INFOCOM Conference on Computer Communications, pp. 468\u2013476 (2018)","DOI":"10.1109\/INFOCOM.2018.8486411"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.future.2020.08.037","volume":"115","author":"Z Lv","year":"2021","unstructured":"Lv, Z., Chen, D., Lou, R., Wang, Q.: Intelligent edge computing based on machine learning for smart city. Futur. Gener. Comput. Syst. 115, 90\u201399 (2021)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"8","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1109\/JPROC.2019.2915983","volume":"107","author":"S Liu","year":"2019","unstructured":"Liu, S., Liu, L., Tang, J., Yu, B., Wang, Y., Shi, W.: Edge computing for autonomous driving: opportunities and challenges. Proc. IEEE 107(8), 1697\u20131716 (2019)","journal-title":"Proc. IEEE"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1109\/JPROC.2019.2918951","volume":"107","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Chen, X., Li, E., Zeng, L., Luo, K., Zhang, J.: Edge intelligence: paving the last mile of artificial intelligence with edge computing. Proc. IEEE 107, 1738\u20131762 (2019)","journal-title":"Proc. IEEE"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCOM.2017.1600894","volume":"55","author":"S Li","year":"2017","unstructured":"Li, S., Maddah-Ali, A.M., Avestimehr, S.A.: Coding for distributed fog computing. IEEE Commun. Mag. 55(4), 34\u201340 (2017)","journal-title":"IEEE Commun. Mag."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TIT.2017.2736066","volume":"64","author":"K Lee","year":"2017","unstructured":"Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., Ramchandran, K.: Speeding up distributed machine learning using codes. IEEE Trans. Inf. Theory 64(3), 1514\u20131529 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Soto, P., Li, J.: Straggler-free coding for concurrent matrix multiplications. In: Proceedings of International Symposium on Information Theory (ISIT), pp. 233\u2013238 (2020)","DOI":"10.1109\/ISIT44484.2020.9174239"},{"key":"12_CR9","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, R.V., Grover, P.: On the optimal recovery threshold of coded matrix multiplication. IEEE Trans. Inf. Theory 66, 278\u2013301 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_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, 141\u2013150 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Bitar, R., Parag, P., Rouayheb, S.E.: Minimizing latency for secure distributed computing. In: Proceedings of International Symposium on Information Theory (ISIT), pp. 2900\u20132904 (2017)","DOI":"10.1109\/ISIT.2017.8007060"},{"issue":"8","key":"12_CR12","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1109\/TCOMM.2020.2988506","volume":"68","author":"R Bitar","year":"2020","unstructured":"Bitar, R., Parag, P., Rouayheb, S.E.: Minimizing latency for secure coded computing using secret sharing via staircase codes. IEEE Trans. Commun. 68(8), 4609\u20134619 (2020)","journal-title":"IEEE Trans. Commun."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Chang, W., Tandon, R.: On the capacity of secure distributed matrix multiplication. In: Proceedings of Global Communications Conference (GLOBECOM), pp. 1\u20136 (2019)","DOI":"10.1109\/GLOCOM.2018.8647313"},{"issue":"7","key":"12_CR14","doi-asserted-by":"publisher","first-page":"4038","DOI":"10.1109\/TIT.2020.2975021","volume":"66","author":"GLR D\u2019Oliveira","year":"2020","unstructured":"D\u2019Oliveira, G.L.R., Rouayheb, E.S., Karpuk, D.: GASP codes for secure distributed matrix multiplication. IEEE Trans. Inf. Theory 66(7), 4038\u20134050 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Wang, J., Cao, C., Wang, J., Lu, K., Jukan, A., Zhao, W.: Optimal task allocation and coding design for secure edge computing with heterogeneous edge devices. IEEE Trans. Cloud Comput. (2021)","DOI":"10.1109\/TCC.2021.3050012"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Zhu, L., Wang, J., Shi, L., Zhou, J., Lu, K., Wang, J.: Secure coded matrix multiplication against cooperative attack in edge computing. In: Proceedings of International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 547\u2013556 (2020)","DOI":"10.1109\/TrustCom50675.2020.00079"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kim, M., Yang, H., Lee, J.: Private coded computation for machine learning. arXiv:1807.01170 (2018)","DOI":"10.1109\/ISIT.2019.8849252"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Kim, M., Lee, J.: Private secure coded computation. IEEE Commun. Lett. 1918\u20131921 (2019)","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Chang, W.T., Tandon, R.: On the upload versus download cost for secure and private matrix multiplication. In: IEEE Information Theory Workshop (ITW), pp. 469\u2013473 (2019)","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TCOMM.2020.3032196","volume":"69","author":"Q Yu","year":"2021","unstructured":"Yu, Q., Avestimehr, S.A.: Coded computing for resilient, secure, and privacy-preserving distributed matrix multiplication. IEEE Trans. Commun. 69, 59\u201372 (2021)","journal-title":"IEEE Trans. Commun."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Vaidya, K., Rajan, S.B.: Distributed computation-privacy, straggler mitigation, and security against colluding workers. In: Proceedings of Global Communications Conference (GLOBECOM), pp. 1\u20136 (2020)","DOI":"10.1109\/GLOBECOM42002.2020.9322092"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"7427","DOI":"10.1109\/TIT.2020.3013152","volume":"66","author":"Z Jia","year":"2020","unstructured":"Jia, Z., Jafar, S.A.: X-secure T-private information retrieval from MDS coded storage with byzantine and unresponsive servers. IEEE Trans. Inf. Theory 66, 7427\u20137438 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/LCOMM.2020.3037744","volume":"25","author":"M Kim","year":"2021","unstructured":"Kim, M., Yang, H., Lee, J.: Fully private coded matrix multiplication from colluding workers. IEEE Commun. Lett. 25, 730\u2013733 (2021)","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/JPROC.2010.2094592","volume":"99","author":"N Cai","year":"2011","unstructured":"Cai, N., Chan, T.: Theory of secure network coding. Proc. IEEE 99(3), 421\u2013437 (2011)","journal-title":"Proc. IEEE"}],"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-24383-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:25:30Z","timestamp":1674577530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24383-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031243820","9783031243837"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24383-7_12","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","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":"Hangzhou","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/collaboratecom.eai-conferences.org\/2022","order":11,"name":"conference_url","label":"Conference URL","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":"Confyplus.eai.eu","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"171","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":"57","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":"4","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)"}}]}}