{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T12:16:27Z","timestamp":1783685787331,"version":"3.55.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Science and Technology Program of Guizhou","award":["No. QianKeHe [2024]Zhongda-17"],"award-info":[{"award-number":["No. QianKeHe [2024]Zhongda-17"]}]},{"name":"Natural Science Researching Program of D.o.E. of Guizhou","award":["No. Qian Edu. & Tech. [2024] 326, Qian Edu. & Tech. [2023] 065, Qian Edu. & Tech. [2023]014"],"award-info":[{"award-number":["No. Qian Edu. & Tech. [2024] 326, Qian Edu. & Tech. [2023] 065, Qian Edu. & Tech. [2023]014"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10586-025-05930-9","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T20:36:19Z","timestamp":1774902979000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["OUVC-VDB: Publicly verifiable database with conjunctive keyword search and forward security"],"prefix":"10.1007","volume":"29","author":[{"given":"Lang","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changgen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuanda","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,30]]},"reference":[{"key":"5930_CR1","doi-asserted-by":"crossref","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Annual Cryptology Conference, pp. 111\u2013131 (2011)","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"5930_CR2","first-page":"55","volume":"2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. Public-Key Cryptography-PKC 2013, 55 (2013)","journal-title":"Public-Key Cryptography-PKC"},{"key":"5930_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jcss.2016.07.005","volume":"86","author":"M Miao","year":"2017","unstructured":"Miao, M., Wang, J., Ma, J., Susilo, W.: Publicly verifiable databases with efficient insertion\/deletion operations. J. Comput. Syst. Sci. 86, 49\u201358 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"5930_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.future.2020.09.028","volume":"115","author":"Q Wang","year":"2021","unstructured":"Wang, Q., Zhou, F., Xu, J., Xu, Z.: Efficient verifiable databases with additional insertion and deletion operations in cloud computing. Future Generation Computer Systems 115, 553\u2013567 (2021)","journal-title":"Future Generation Computer Systems"},{"key":"5930_CR5","doi-asserted-by":"publisher","first-page":"3045","DOI":"10.1007\/s12652-018-0757-8","volume":"10","author":"Z Zhang","year":"2019","unstructured":"Zhang, Z., Chen, X., Li, J., Tao, X., Ma, J.: Hvdb: a hierarchical verifiable database scheme with scalable updates. J. Ambient. Intell. Humaniz. Comput 10, 3045\u20133057 (2019)","journal-title":"J. Ambient. Intell. Humaniz. Comput"},{"issue":"6","key":"5930_CR6","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.14778\/3583140.3583152","volume":"16","author":"C Yue","year":"2023","unstructured":"Yue, C., Dinh, T.T.A., Xie, Z., Zhang, M., Chen, G., Ooi, B.C., Xiao, X.: Glassdb: an efficient verifiable ledger database system through transparency. Proceedings of the VLDB Endowment 16(6), 1359\u20131371 (2023)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"05","key":"5930_CR7","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1109\/TDSC.2022.3225283","volume":"20","author":"H Yang","year":"2023","unstructured":"Yang, H., Feng, D., Qin, J.: Efficient verifiable unbounded-size database from authenticated matrix commitment. IEEE Trans. Dependable Secure Comput 20(05), 3873\u20133889 (2023)","journal-title":"IEEE Trans. Dependable Secure Comput"},{"key":"5930_CR8","doi-asserted-by":"crossref","unstructured":"Wang, J., Chen, X., Sun, S.-F., Liu, J.K., Au, M.H., Zhan, Z.-H.: Towards efficient verifiable conjunctive keyword search for large encrypted database. In: Computer Security: 23rd European Symposium on Research in Computer Security, ESORICS 2018, Barcelona, Spain, September 3-7, 2018, Proceedings, Part II 23, pp. 83\u2013100 (2018). Springer","DOI":"10.1007\/978-3-319-98989-1_5"},{"key":"5930_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2018.09.067","volume":"475","author":"M Miao","year":"2019","unstructured":"Miao, M., Wang, J., Wen, S., Ma, J.: Publicly verifiable database scheme with efficient keyword search. Information Sciences 475, 18\u201328 (2019)","journal-title":"Information Sciences"},{"key":"5930_CR10","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of $$\\{$$File-Injection$$\\}$$ attacks on searchable encryption. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 707\u2013720 (2016)"},{"key":"5930_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Wang, J., Wang, Y., Su, Y., Chen, X.: Towards efficient verifiable forward secure searchable symmetric encryption. In: Computer Security\u2013ESORICS 2019: 24th European Symposium on Research in Computer Security, Luxembourg, September 23\u201327, 2019, Proceedings, Part II 24, pp. 304\u2013321 (2019). Springer","DOI":"10.1007\/978-3-030-29962-0_15"},{"key":"5930_CR12","doi-asserted-by":"publisher","first-page":"103491","DOI":"10.1016\/j.csi.2020.103491","volume":"77","author":"M Miao","year":"2021","unstructured":"Miao, M., Wang, Y., Wang, J., Huang, X.: Verifiable database supporting keyword searches with forward security. Computer Standards & Interfaces 77, 103491 (2021)","journal-title":"Computer Standards & Interfaces"},{"key":"5930_CR13","doi-asserted-by":"crossref","unstructured":"Zhao, C., Du, R., He, K., Chen, J., Li, J., Liu, X., Ning, J.: Efficient verifiable dynamic searchable symmetric encryption with forward and backward security. IEEE Internet of Things Journal (2024)","DOI":"10.1109\/JIOT.2024.3470772"},{"issue":"5","key":"5930_CR14","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/TDSC.2014.2366471","volume":"12","author":"X Chen","year":"2014","unstructured":"Chen, X., Li, J., Huang, X., Ma, J., Lou, W.: New publicly verifiable databases with efficient updates. IEEE Trans. Dependable Secure Comput. 12(5), 546\u2013556 (2014)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"5930_CR15","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965\u2013976 (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"5930_CR16","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. Cryptology ePrint Archive (2013)","DOI":"10.14722\/ndss.2014.23298"},{"key":"5930_CR17","doi-asserted-by":"crossref","unstructured":"Bost, R.: $$\\sigma$$o$$\\varphi$$o$$\\varsigma$$: Forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1143\u20131154 (2016)","DOI":"10.1145\/2976749.2978303"},{"key":"5930_CR18","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1465\u20131482 (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"5930_CR19","doi-asserted-by":"crossref","unstructured":"Patranabis, S., Mukhopadhyay, D.: Forward and backward private conjunctive searchable symmetric encryption. Cryptology ePrint Archive (2020)","DOI":"10.14722\/ndss.2021.23116"},{"issue":"1","key":"5930_CR20","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TDSC.2020.2994377","volume":"19","author":"C Zuo","year":"2020","unstructured":"Zuo, C., Sun, S.-F., Liu, J.K., Shao, J., Pieprzyk, J., Xu, L.: Forward and backward private dsse for range queries. IEEE Trans. Dependable Secure Comput. 19(1), 328\u2013338 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"5930_CR21","unstructured":"Chamani, J.G., Papadopoulos, D., Karbasforushan, M., Demertzis, I.: Dynamic searchable encryption with optimal search in the presence of deletions. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 2425\u20132442 (2022)"},{"key":"5930_CR22","doi-asserted-by":"crossref","unstructured":"Peng, T., Guo, C., Zheng, G., Gong, M., Zhu, H., Li, Z.: Conjunctive keyword dynamic symmetric searchable encryption with forward privacy. In: 2024 9th International Conference on Computer and Communication Systems (ICCCS), pp. 236\u2013241 (2024). IEEE","DOI":"10.1109\/ICCCS61882.2024.10602805"},{"key":"5930_CR23","doi-asserted-by":"crossref","unstructured":"Bag, A., Patranabis, S., Mukhopadhyay, D.: Tokenised multi-client provisioning for dynamic searchable encryption with forward and backward privacy. In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, pp. 1691\u20131707 (2024)","DOI":"10.1145\/3634737.3657018"},{"key":"5930_CR24","doi-asserted-by":"crossref","unstructured":"Chen, T., Xu, P., Picek, S., Luo, B., Susilo, W., Jin, H., Liang, K.: The power of bamboo: On the post-compromise security for searchable symmetric encryption. arXiv:2403.15052 (2024)","DOI":"10.14722\/ndss.2023.24725"},{"key":"5930_CR25","doi-asserted-by":"crossref","unstructured":"Azraoui, M., Elkhiyaoui, K., \u00d6nen, M., Molva, R.: Publicly verifiable conjunctive keyword search in outsourced databases. In: 2015 IEEE Conference on Communications and Network Security (CNS), pp. 619\u2013627 (2015). IEEE","DOI":"10.1109\/CNS.2015.7346876"},{"key":"5930_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2024.3408812","author":"D Li","year":"2024","unstructured":"Li, D., Zhao, X., Li, H., Fan, K.: Volume-hiding multi-dimensional verifiable dynamic searchable symmetric encryption scheme for cloud computing. IEEE Internet of Things Journal (2024). https:\/\/doi.org\/10.1109\/jiot.2024.3408812","journal-title":"IEEE Internet of Things Journal"},{"key":"5930_CR27","doi-asserted-by":"crossref","unstructured":"Cui, N., Wang, Z., Pei, L., Wang, M., Wang, D., Cui, J., Zhong, H.: Dynamic and verifiable fuzzy keyword search with forward security in cloud environments. IEEE Internet of Things Journal (2024)","DOI":"10.1109\/JIOT.2024.3517165"},{"issue":"02","key":"5930_CR28","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1109\/TDSC.2023.3262060","volume":"21","author":"C Guo","year":"2024","unstructured":"Guo, C., Li, W., Tang, X., Choo, K.-K., Liu, Y.: Forward private verifiable dynamic searchable symmetric encryption with efficient conjunctive query. IEEE Trans. Dependable Secure Comput. 21(02), 746\u2013763 (2024)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"5930_CR29","doi-asserted-by":"crossref","unstructured":"Mihailescu, M.I., Nita, S.L., Marascu, V.: Crane: A genuine framework based on verifiable searchable encryption security and resource constraints balancing on client side. In: 2024 International Conference on Smart Applications, Communications and Networking (SmartNets), pp. 1\u20136 (2024). IEEE","DOI":"10.1109\/SmartNets61466.2024.10577732"},{"key":"5930_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.105025","volume":"197","author":"Y Li","year":"2025","unstructured":"Li, Y., Xu, C., Xu, L., Mei, L., Zhu, Y.: Verifiable searchable encryption scheme with flexible access control in the cloud. Journal of Parallel and Distributed Computing 197, 105025 (2025)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5930_CR31","doi-asserted-by":"crossref","unstructured":"Lai, R.W., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part I 39, pp. 530\u2013560 (2019). Springer","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"5930_CR32","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Reinman, T.: Oblivious ram revisited. In: Advances in Cryptology\u2013CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings 30, pp. 502\u2013519 (2010). Springer","DOI":"10.1007\/978-3-642-14623-7_27"},{"issue":"3","key":"5930_CR33","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM 43(3), 431\u2013473 (1996)","journal-title":"Journal of the ACM"},{"issue":"8","key":"5930_CR34","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1002\/asi.10268","volume":"54","author":"S Heinz","year":"2003","unstructured":"Heinz, S., Zobel, J.: Efficient single-pass index construction for text databases. Journal of the American Society for Information Science and Technology 54(8), 713\u2013729 (2003)","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"5930_CR35","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, pp. 44\u201355 (2000). IEEE"},{"key":"5930_CR36","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Dijk, M., Shi, E., Chan, T.-H.H., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path oram: An extremely simple oblivious ram protocol. Journal of the ACM 65(4), 1\u201326 (2018)","DOI":"10.1145\/3177872"},{"key":"5930_CR37","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Ranjan, D.: Balls and bins: A study in negative dependence. BRICS Report Series 3(25) (1996)","DOI":"10.7146\/brics.v3i25.20006"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05930-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05930-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05930-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:40:42Z","timestamp":1783683642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05930-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,30]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["5930"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05930-9","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,30]]},"assertion":[{"value":"30 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could be perceived to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"226"}}