{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:42:07Z","timestamp":1742985727949,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953836"},{"type":"electronic","value":"9783030953843"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95384-3_33","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"529-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recode-Decode-and-Compare: An Efficient Verification Scheme for\u00a0Coded Edge Computing Against Collusion Attack"],"prefix":"10.1007","author":[{"given":"Zhaobo","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingya","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kejie","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"2462","DOI":"10.1109\/COMST.2020.3009103","volume":"22","author":"T Qiu","year":"2020","unstructured":"Qiu, T., Chi, J., Zhou, X., Ning, Z., Atiquzzaman, M., Wu, D.: Edge computing in industrial internet of things: architecture, advances and challenges. IEEE Commun. Surv. Tut. 22(4), 2462\u20132488 (2020)","journal-title":"IEEE Commun. Surv. Tut."},{"issue":"10","key":"33_CR2","doi-asserted-by":"publisher","first-page":"6663","DOI":"10.1109\/TII.2019.2962844","volume":"16","author":"T Wang","year":"2020","unstructured":"Wang, T., et al.: Privacy-enhanced data collection based on deep learning for Internet of vehicles. IEEE Trans. Industr. Inf. 16(10), 6663\u20136672 (2020)","journal-title":"IEEE Trans. Industr. Inf."},{"issue":"8","key":"33_CR3","doi-asserted-by":"publisher","first-page":"6722","DOI":"10.1109\/JIOT.2020.3004500","volume":"7","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Peng, M., Shou, G., Chen, Y., Chen, S.: Toward edge intelligence: multiaccess edge computing for 5G and Internet of things. IEEE Internet Things J. 7(8), 6722\u20136747 (2020)","journal-title":"IEEE Internet Things J."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ins.2019.08.064","volume":"508","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Huang, H., Wu, N., Wang, Y., Bhuiyan, M.Z.A., Wang, T.: An incentive-based protection and recovery strategy for secure big data in social networks. Inf. Sci. 508, 79\u201391 (2020)","journal-title":"Inf. Sci."},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"2322","DOI":"10.1109\/COMST.2017.2745201","volume":"19","author":"Y Mao","year":"2017","unstructured":"Mao, Y., You, C., Zhang, J., Huang, K., Letaief, K.: A survey on mobile edge computing: the communication perspective. IEEE Commun. Surv. Tut. 19(4), 2322\u20132358 (2017)","journal-title":"IEEE Commun. Surv. Tut."},{"issue":"4","key":"33_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, M., Avestimehr, A.: Coding for distributed fog computing. IEEE Commun. Mag. 55(4), 34\u201340 (2017)","journal-title":"IEEE Commun. Mag."},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TIT.2017.2756959","volume":"64","author":"S Li","year":"2018","unstructured":"Li, S., Maddah-Ali, M., Yu, Q., Avestimehr, A.: A fundamental tradeoff between computation and communication in distributed computing. IEEE Trans. Inf. Theor. 64(1), 109\u2013128 (2018)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TIT.2017.2736066","volume":"64","author":"K Lee","year":"2018","unstructured":"Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., Ramchandran, K.: Speeding up distributed machine learning using codes. IEEE Trans. Inf. Theor. 64(3), 1514\u20131529 (2018)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/JSAC.2020.3036961","volume":"39","author":"S Prakash","year":"2021","unstructured":"Prakash, S., et al.: Coded computing for low-latency federated learning over wireless edge networks. IEEE J. Sel. Areas Commun. 39(1), 233\u2013250 (2021)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"10","key":"33_CR10","doi-asserted-by":"publisher","first-page":"6171","DOI":"10.1109\/TIT.2019.2927558","volume":"65","author":"S Dutta","year":"2019","unstructured":"Dutta, S., Cadambe, V., Grover, P.: Short-dot: computing large linear transforms distributedly using coded short dot products. IEEE Trans. Inf. Theor. 65(10), 6171\u20136193 (2019)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"33_CR11","unstructured":"Yu, Q., Maddah-Ali, M., Avestimehr, A.: Polynomial codes: an optimal design for high-dimensional coded matrix multiplication. In: Advances in Neural Information Processing Systems (NIPS), pp. 4406\u20134416. MIT Press (2017)"},{"issue":"1","key":"33_CR12","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":"33_CR13","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. (2019, early access)"},{"issue":"8","key":"33_CR14","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., El Rouayheb, S.: 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":"33_CR15","unstructured":"Bhattad, K., Narayanan, K.: Weakly secure network coding. In: 1st Workshop on Network Coding Theory and Applications (NETCOD), pp. 281\u2013285 (2005)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-11203-9_7","volume-title":"Computer Security - ESORICS 2014","author":"LF Zhang","year":"2014","unstructured":"Zhang, L.F., Safavi-Naini, R.: Verifiable delegation of computations with storage-verification trade-off. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 112\u2013129. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_7"},{"issue":"10","key":"33_CR17","doi-asserted-by":"publisher","first-page":"2334","DOI":"10.1109\/TIFS.2017.2705628","volume":"12","author":"W Song","year":"2017","unstructured":"Song, W., Wang, B., Wang, Q., Shi, C., Lou, W., Peng, Z.: Publicly verifiable computation of polynomials over outsourced data with multiple sources. IEEE Trans. Inf. Forensics Secur. 12(10), 2334\u20132347 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Halevi, S., Shoup, V.: Faster homomorphic linear transformations in HElib. In: Annual International Cryptology Conference, pp. 93\u2013120 (2018)","DOI":"10.1007\/978-3-319-96884-1_4"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zheng, Z., Lyu, M.: BFTCloud: a Byzantine fault tolerance framework for voluntary-resource cloud computing. In: IEEE International Conference on Cloud Computing, pp. 444\u2013451. IEEE (2011)","DOI":"10.1109\/CLOUD.2011.16"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Biely, M., Schiper, A.: Bounded delay in Byzantine-tolerant state machine replication. In: IEEE International Symposium on Reliable Distributed Systems, pp. 61\u201370. IEEE (2013)","DOI":"10.1109\/SRDS.2013.15"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Rui, G., Rodrigo, R., Nuno, P.: Efficient middleware for Byzantine fault tolerant database replication. In: European Conference on Computer Systems (EuroSys), pp. 107\u2013122. ACM (2011)","DOI":"10.1145\/1966445.1966456"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Fu, M., Wang, J., Wang, J., Lu, K., Jukan, A., Gu, F.: Decode-and compare: an efficient verification scheme for coded edge computing. In: IEEE\/ACM International Symposium on Quality of Service (IWQoS), pp. 1\u20136. IEEE\/ACM (2020)","DOI":"10.1109\/IWQoS49365.2020.9212828"},{"issue":"4","key":"33_CR23","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1109\/TIFS.2016.2598533","volume":"12","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Cheung, S., Luo, Y.: Information-theoretic secure multi-party computation with collusion deterrence. IEEE Trans. Inf. Forensics Secur. 12(4), 980\u2013995 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"33_CR24","unstructured":"Tando, R., Lei, Q., Dimakis, A., Karampatziakis, N.: Gradient coding: avoiding stragglers in distributed learning. In: International Conference on Machine Learning (ICML), pp. 3368\u20133376. ACM (2017)"}],"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-3-030-95384-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:08:39Z","timestamp":1726704519000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","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":"36% - 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.12","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":"2.27","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}