{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:43:39Z","timestamp":1743140619474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_42","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"676-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Blockchain-Based Proxy Oriented Cloud Storage Public Audit Scheme for Low-Performance Terminal Devices"],"prefix":"10.1007","author":[{"given":"Mande","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiting","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"10","key":"42_CR1","doi-asserted-by":"publisher","first-page":"6663","DOI":"10.1109\/TII.2019.2962844","volume":"16","author":"T Wang","year":"2019","unstructured":"Wang, T., et al.: Privacy-enhanced data collection based on deep learning for internet of vehicles. IEEE Trans. Ind. Inf. 16(10), 6663\u20136672 (2019)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"1","key":"42_CR2","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TVT.2012.2217159","volume":"62","author":"T Wang","year":"2012","unstructured":"Wang, T., Jia, W., Xing, G., Li, M.: Exploiting statistical mobility models for efficient wi-fi deployment. IEEE Trans. Veh. Technol. 62(1), 360\u2013373 (2012)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.comcom.2019.12.054","volume":"151","author":"M Chen","year":"2020","unstructured":"Chen, M., Wang, T., Ota, K., Dong, M., Zhao, M., Liu, A.: Intelligent resource allocation management for vehicles network: an a3c learning approach. Comput. Commun. 151, 485\u2013494 (2020)","journal-title":"Comput. Commun."},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.future.2021.03.021","volume":"121","author":"M Xie","year":"2021","unstructured":"Xie, M., Ruan, Y., Hong, H., Shao, J.: A cp-abe scheme based on multi-authority in hybrid clouds for mobile devices. Futur. Gener. Comput. Syst. 121, 114\u2013122 (2021)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 598\u2013609 (2007)","DOI":"10.1145\/1315245.1315318"},{"issue":"4","key":"42_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699909","volume":"17","author":"CC Erway","year":"2015","unstructured":"Erway, C.C., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. ACM Trans. Inf. Syst. Secur. (TISSEC) 17(4), 1\u201329 (2015)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-19848-4_5","volume-title":"Intelligent Cloud Computing","author":"E Esiner","year":"2015","unstructured":"Esiner, E., K\u00fcp\u00e7\u00fc, A., \u00d6zkasap, \u00d6.: Analysis and optimization on FlexDPDP: a practical solution for dynamic provable data possession. In: Al-Saidi, A., Fleischer, R., Maamar, Z., Rana, O.F. (eds.) Analysis and optimization on flexdpdp: A practical solution for dynamic provable data possession. LNCS, vol. 8993, pp. 65\u201383. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19848-4_5"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski Jr, B.S.: Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 584\u2013597 (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-89255-7_7","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Shacham","year":"2008","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90\u2013107. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_7"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00145-015-9216-2","volume":"30","author":"D Cash","year":"2017","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious ram. J. Cryptol. 30(1), 22\u201357 (2017)","journal-title":"J. Cryptol."},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1007\/s10586-014-0394-8","volume":"17","author":"J Zhang","year":"2014","unstructured":"Zhang, J., Tang, W., Mao, J.: Efficient public verification proof of retrievability scheme in cloud. Clust. Comput. 17(4), 1401\u20131411 (2014). https:\/\/doi.org\/10.1007\/s10586-014-0394-8","journal-title":"Clust. Comput."},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TSC.2014.1","volume":"8","author":"H Wang","year":"2014","unstructured":"Wang, H.: Identity-based distributed provable data possession in multicloud storage. IEEE Trans. Serv. Comput. 8(2), 328\u2013340 (2014)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"42_CR13","first-page":"1","volume":"343","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Dong, Q.: Efficient id-based public auditing for the outsourced data in cloud storage. Inf. Sci. 343, 1\u201314 (2016)","journal-title":"Inf. Sci."},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.ins.2020.01.051","volume":"519","author":"H Wang","year":"2020","unstructured":"Wang, H., Qin, H., Zhao, M., Wei, X., Shen, H., Susilo, W.: Blockchain-based fair payment smart contract for public cloud storage auditing. Inf. Sci. 519, 348\u2013362 (2020)","journal-title":"Inf. Sci."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ins.2020.07.005","volume":"541","author":"H Yuan","year":"2020","unstructured":"Yuan, H., Chen, X., Wang, J., Yuan, J., Yan, H., Susilo, W.: Blockchain-based public auditing and secure deduplication with fair arbitration. Inf. Sci. 541, 409\u2013425 (2020)","journal-title":"Inf. Sci."},{"key":"42_CR16","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized Business Review, p. 21260 (2008)"},{"key":"42_CR17","first-page":"22","volume":"1","author":"V Buterin","year":"2013","unstructured":"Buterin, V., et al.: Ethereum white paper. GitHub Repository 1, 22\u201323 (2013)","journal-title":"Ethereum white paper. GitHub Repository"},{"issue":"6","key":"42_CR18","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TIFS.2016.2520886","volume":"11","author":"H Wang","year":"2016","unstructured":"Wang, H., He, D., Tang, S.: Identity-based proxy-oriented data uploading and remote data integrity checking in public cloud. IEEE Trans. Inf. Forensics Secur. 11(6), 1165\u20131176 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"De Caro, A., Iovino, V.: jpbc: Java pairing based cryptography. In: Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, pp. 850\u2013855. IEEE, Kerkyra, Corfu, Greece, June 28\u20131 July (2011)","DOI":"10.1109\/ISCC.2011.5983948"}],"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_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:25:51Z","timestamp":1645518351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95384-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953836","9783030953843"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95384-3_42","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)"}}]}}