{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T16:22:32Z","timestamp":1770481352138,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006116","name":"School of Mathematics, Institute for Research in Fundamental Sciences","doi-asserted-by":"crossref","award":["No.1404940042"],"award-info":[{"award-number":["No.1404940042"]}],"id":[{"id":"10.13039\/501100006116","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-08210-w","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T09:43:02Z","timestamp":1770370982000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Toward more secure constructions of private set operation schemes"],"prefix":"10.1007","volume":"82","author":[{"given":"Mojtaba","family":"Rafiee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,6]]},"reference":[{"key":"8210_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.future.2022.03.031","volume":"133","author":"M Awais","year":"2022","unstructured":"Awais M, Tahir S, Khan F, Tahir H, Tahir R, Latif R, Umair MY (2022) A novel searchable encryption scheme to reduce the access pattern leakage. Futur Gener Comput Syst 133:338\u2013350","journal-title":"Futur Gener Comput Syst"},{"key":"8210_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.future.2018.05.048","volume":"109","author":"S Tahir","year":"2020","unstructured":"Tahir S, Steponkus L, Ruj S, Rajarajan M, Sajjad A (2020) A parallelized disjunctive query based searchable encryption scheme for big data. Futur Gener Comput Syst 109:583\u2013592","journal-title":"Futur Gener Comput Syst"},{"issue":"8042","key":"8210_CR3","first-page":"353","volume":"2013","author":"D Cash","year":"2013","unstructured":"Cash D, Jarecki S, Jutla C, Krawczyk H, Ro\u015fu M-C, Steiner M (2013) Highly-scalable searchable symmetric encryption with support for boolean queries. Adv Cryptology-CRYPTO 2013(8042):353\u2013373","journal-title":"Adv Cryptology-CRYPTO"},{"issue":"4","key":"8210_CR4","doi-asserted-by":"publisher","first-page":"4024","DOI":"10.1109\/TDSC.2023.3343872","volume":"21","author":"M Rafiee","year":"2023","unstructured":"Rafiee M (2023) Multi-adjustable join schemes with adaptive indistinguishably security. IEEE Trans Dependable Secure Comput 21(4):4024\u20134034","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"8","key":"8210_CR5","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1093\/comjnl\/bxaa123","volume":"64","author":"M Rafiee","year":"2021","unstructured":"Rafiee M, Khazaei S (2021) Private set operations over encrypted cloud dataset and applications. Comput J 64(8):1145\u20131162","journal-title":"Comput J"},{"key":"8210_CR6","doi-asserted-by":"crossref","unstructured":"Mironov I, Segev G, Shahaf I (2017) Strengthening the security of encrypted databases: Non-transitive joins. In: Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, Proceedings, Part II 15, Springer, pp 631\u2013661","DOI":"10.1007\/978-3-319-70503-3_21"},{"key":"8210_CR7","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","volume":"30","author":"A Escala","year":"2017","unstructured":"Escala A, Herold G, Kiltz E, R\u00e0fols C, Villar J (2017) An algebraic framework for diffie-hellman assumptions. J Cryptol 30:242\u2013288","journal-title":"J Cryptol"},{"key":"8210_CR8","unstructured":"Scott M (2002) Authenticated id-based key exchange and remote log-in with simple token and pin number. Cryptology ePrint Archive"},{"key":"8210_CR9","unstructured":"Rafiee M (2025) Security of private set operation schemes: separations and implications. Cryptology ePrint Archive, Paper 2025\/2064 https:\/\/eprint.iacr.org\/2025\/2064"},{"key":"8210_CR10","doi-asserted-by":"crossref","unstructured":"Katz J, Lindell Y (2007) Introduction to modern cryptography: principles and protocols. Chapman and hall\/CRC","DOI":"10.1201\/9781420010756"},{"key":"8210_CR11","unstructured":"Popa RA, Zeldovich N (2025) Cryptographic treatment of CryptDB\u2019s adjustable join, http:\/\/people.csail.mit.edu\/nickolai\/papers\/popa-join-tr.pdf. Accessed 13 Nov 2025"},{"key":"8210_CR12","doi-asserted-by":"crossref","unstructured":"Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp 79\u201388","DOI":"10.1145\/1180405.1180417"},{"key":"8210_CR13","doi-asserted-by":"crossref","unstructured":"De\u00a0Caro A, Iovino V (2011) jpbc: java pairing based cryptography. In: 2011 IEEE Symposium on Computers and Communications (ISCC), IEEE, pp 850\u2013855","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"8210_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.future.2022.01.021","volume":"132","author":"J Su","year":"2022","unstructured":"Su J, Zhang L, Mu Y (2022) Ba-rmkabse: blockchain-aided ranked multi-keyword attribute-based searchable encryption with hiding policy for smart health system. Futur Gener Comput Syst 132:299\u2013309","journal-title":"Futur Gener Comput Syst"},{"key":"8210_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.future.2021.09.012","volume":"127","author":"P Wang","year":"2022","unstructured":"Wang P, Chen B, Xiang T, Wang Z (2022) Lattice-based public key searchable encryption with fine-grained access control for edge computing. Futur Gener Comput Syst 127:373\u2013383","journal-title":"Futur Gener Comput Syst"},{"key":"8210_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.future.2023.11.017","volume":"153","author":"M Xie","year":"2024","unstructured":"Xie M, Yang X, Hong H, Wei G, Zhang Z (2024) A novel verifiable Chinese multi-keyword fuzzy rank searchable encryption scheme in cloud environments. Futur Gener Comput Syst 153:287\u2013300","journal-title":"Futur Gener Comput Syst"},{"key":"8210_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.107701","volume":"166","author":"Z Xu","year":"2025","unstructured":"Xu Z, Tian C, Zhang G, Tian W, Han L (2025) Forward-secure multi-user and verifiable dynamic searchable encryption scheme within a zero-trust environment. Futur Gener Comput Syst 166:107701","journal-title":"Futur Gener Comput Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08210-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-08210-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-08210-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T09:43:06Z","timestamp":1770370986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-08210-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,6]]},"references-count":17,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["8210"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-08210-w","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,6]]},"assertion":[{"value":"3 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"133"}}