{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:44:55Z","timestamp":1765039495892,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672408","61976168","61972309"],"award-info":[{"award-number":["61672408","61976168","61972309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013064","name":"Key Research and Development Program of Jiangxi Province","doi-asserted-by":"publisher","award":["20181ACE50029"],"award-info":[{"award-number":["20181ACE50029"]}],"id":[{"id":"10.13039\/501100013064","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Plan of Shaanxi Province","award":["2019ZDLGY13-09"],"award-info":[{"award-number":["2019ZDLGY13-09"]}]},{"name":"CCF-Huawei Database System Innovation Research Plan","award":["CCF-HuaweiDBIR008B"],"award-info":[{"award-number":["CCF-HuaweiDBIR008B"]}]},{"name":"National Engineering Laboratory for Public Safety Risk Perception and Control by Big Data"},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["JB181505"],"award-info":[{"award-number":["JB181505"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2018JM6073"],"award-info":[{"award-number":["2018JM6073"]}]},{"name":"Innovation Fund of Xidian University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2955243","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T15:40:55Z","timestamp":1575387655000},"page":"169636-169645","source":"Crossref","is-referenced-by-count":8,"title":["Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6556-104X","authenticated-orcid":false,"given":"Yixiao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0440-6169","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5569-0780","authenticated-orcid":false,"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3549-9035","authenticated-orcid":false,"given":"Yong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2917628"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9182-0"},{"journal-title":"On Updatable Redactable Signatures","year":"2014","author":"p\u00f6hls","key":"ref32"},{"key":"ref31","first-page":"274","article-title":"One-way accumulators: A decentralized alternative to digital signatures","author":"benaloh","year":"1993","journal-title":"Proc Workshop Theory Appl Cryptograph Techn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3233181"},{"article-title":"Universally composable accumulators","year":"2018","author":"baldimtsi","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_16"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"article-title":"A fully homomorphic encryption scheme","year":"2009","author":"gentry","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","article-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based","author":"gentry","year":"2013","journal-title":"Advances in Cryptology—CRYPTO 2013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488678"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-017-0387-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39927-8_28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752944"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882956"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660354"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9355-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_26"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382250"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516681"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_7"},{"key":"ref25","first-page":"765","article-title":"TRUESET: Faster verifiable set computations","author":"kosba","year":"2014","journal-title":"Proc 23rd USENIX Secur Symp"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08910341.pdf?arnumber=8910341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:29Z","timestamp":1641987149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8910341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2955243","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}