{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:26:10Z","timestamp":1768537570660,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030953904","type":"print"},{"value":"9783030953911","type":"electronic"}],"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-95391-1_28","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:04:54Z","timestamp":1645520694000},"page":"447-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["V-EPTD: A Verifiable and\u00a0Efficient Scheme for\u00a0Privacy-Preserving Truth Discovery"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9726-7232","authenticated-orcid":false,"given":"Chang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Hongzhou","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kashif","family":"Sharif","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"28_CR1","unstructured":"Matrix mathematics: theory, facts, and formulas with application to linear systems theory, pp. xlii+1139. Princeton University Press (2009)"},{"key":"28_CR2","unstructured":"Ajarn, J.J.: Permutations and Combinations. Combinatorial Theory, 2nd edn. (2009)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216\u2013233. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_22"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"2835","DOI":"10.1007\/s10586-020-03049-7","volume":"23","author":"F Erfan","year":"2020","unstructured":"Erfan, F., Mala, H.: Secure and efficient publicly verifiable outsourcing of matrix multiplication in online mode. Cluster Comput. 23(4), 2835\u20132845 (2020). https:\/\/doi.org\/10.1007\/s10586-020-03049-7","journal-title":"Cluster Comput."},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Gajera, H., Das, M.L.: Privc: privacy preserving verifiable computation. In: 2020 International Conference on COMmunication Systems & NETworkS, COMSNETS 2020, Bengaluru, India, 7\u201311 January 2020, pp. 298\u2013305. IEEE (2020). https:\/\/doi.org\/10.1109\/COMSNETS48256.2020.9027488","DOI":"10.1109\/COMSNETS48256.2020.9027488"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TIFS.2020.3043139","volume":"16","author":"X Guo","year":"2021","unstructured":"Guo, X., et al.: VeriFL: communication-efficient and fast verifiable aggregation for federated learning. IEEE Trans. Inf. Forensics Secur. 16, 1736\u20131751 (2021). https:\/\/doi.org\/10.1109\/TIFS.2020.3043139","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Li, Q., Li, Y., Gao, J., Zhao, B., Fan, W., Han, J.: Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation. In: Dyreson, C.E., Li, F., \u00d6zsu, M.T. (eds.) International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, 22\u201327 June 2014, pp. 1187\u20131198. ACM (2014). https:\/\/doi.org\/10.1145\/2588555.2610509","DOI":"10.1145\/2588555.2610509"},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Miao, C., et al.: Cloud-enabled privacy-preserving truth discovery in crowd sensing systems. In: Song, J., Abdelzaher, T.F., Mascolo, C. (eds.) Proceedings of the 13th ACM Conference on Embedded Networked Sensor Systems, SenSys 2015, Seoul, South Korea, 1\u20134 November 2015, pp. 183\u2013196. ACM (2015). https:\/\/doi.org\/10.1145\/2809695.2809719","DOI":"10.1145\/2809695.2809719"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Miao, C., et al.: Privacy-preserving truth discovery in crowd sensing systems. ACM Trans. Sens. Netw. 15(1), 9:1\u20139:32 (2019). https:\/\/doi.org\/10.1145\/3277505","DOI":"10.1145\/3277505"},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Miao, C., Su, L., Jiang, W., Li, Y., Tian, M.: A lightweight privacy-preserving truth discovery framework for mobile crowd sensing systems. In: 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, 1\u20134 May 2017, pp. 1\u20139. IEEE (2017). https:\/\/doi.org\/10.1109\/INFOCOM.2017.8057114","DOI":"10.1109\/INFOCOM.2017.8057114"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"1586","DOI":"10.1109\/TIFS.2019.2936971","volume":"15","author":"XA Wang","year":"2020","unstructured":"Wang, X.A., Choo, K.R., Weng, J., Ma, J.: Comments on \u201cpublicly verifiable computation of polynomials over outsourced data with multiple sources\u2019\u2019. IEEE Trans. Inf. Forensics Secur. 15, 1586\u20131588 (2020). https:\/\/doi.org\/10.1109\/TIFS.2019.2936971","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/TIFS.2019.2929409","volume":"15","author":"G Xu","year":"2020","unstructured":"Xu, G., Li, H., Liu, S., Yang, K., Lin, X.: VerifyNet: secure and verifiable federated learning. IEEE Trans. Inf. Forensics Secur. 15, 911\u2013926 (2020). https:\/\/doi.org\/10.1109\/TIFS.2019.2929409","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"28_CR14","doi-asserted-by":"publisher","unstructured":"Xu, G., Li, H., Lu, R.: Practical and privacy-aware truth discovery in mobile crowd sensing systems. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 2312\u20132314. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3278529","DOI":"10.1145\/3243734.3278529"},{"key":"28_CR15","doi-asserted-by":"publisher","unstructured":"Xu, G., et al.: Catch you if you deceive me: verifiable and privacy-aware truth discovery in crowdsensing systems. In: Sun, H., Shieh, S., Gu, G., Ateniese, G. (eds.) ASIA CCS\u201920: The 15th ACM Asia Conference on Computer and Communications Security, Taipei, Taiwan, 5\u20139 October 2020, pp. 178\u2013192. ACM (2020). https:\/\/doi.org\/10.1145\/3320269.3384720","DOI":"10.1145\/3320269.3384720"},{"key":"28_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101848","volume":"97","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Xu, C., Zhu, L., Li, Y., Zhang, C., Wu, H.: An efficient and privacy-preserving truth discovery scheme in crowdsensing applications. Comput. Secur. 97, 101848 (2020). https:\/\/doi.org\/10.1016\/j.cose.2020.101848","journal-title":"Comput. Secur."},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TDSC.2019.2919517","volume":"18","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Zhu, L., Xu, C., Liu, X., Sharif, K.: Reliable and privacy-preserving truth discovery for mobile crowdsensing systems. IEEE Trans. Dependable Secur. Comput. 18(3), 1245\u20131260 (2021). https:\/\/doi.org\/10.1109\/TDSC.2019.2919517","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"28_CR18","doi-asserted-by":"publisher","unstructured":"Zhang, C., Zhu, L., Xu, C., Ni, J., Huang, C., Shen, X.S.: Efficient and privacy-preserving non-interactive truth discovery for mobile crowdsensing. In: IEEE Global Communications Conference, GLOBECOM 2020, Virtual Event, Taiwan, 7\u201311 December 2020, pp. 1\u20136. IEEE (2020). https:\/\/doi.org\/10.1109\/GLOBECOM42002.2020.9322483","DOI":"10.1109\/GLOBECOM42002.2020.9322483"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10623-019-00704-y","volume":"88","author":"LF Zhang","year":"2019","unstructured":"Zhang, L.F., Safavi-Naini, R.: Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions. Des. Codes Cryptogr. 88(4), 677\u2013709 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00704-y","journal-title":"Des. Codes Cryptogr."}],"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-95391-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:08:52Z","timestamp":1645520932000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95391-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953904","9783030953911"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95391-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}