{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T18:10:18Z","timestamp":1742062218554,"version":"3.38.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T00:00:00Z","timestamp":1741996800000},"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":["1403940041"],"award-info":[{"award-number":["1403940041"]}],"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-07112-1","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T06:15:42Z","timestamp":1742019342000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Toward more secure constructions of flexible multi-client functional encryption schemes"],"prefix":"10.1007","volume":"81","author":[{"given":"Mojtaba","family":"Rafiee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"7112_CR1","doi-asserted-by":"crossref","unstructured":"Kamara S, Mohassel P, Raykova M, Sadeghian S (2014) Scaling private set intersection to billion-element sets. In: Financial Cryptography and Data Security: 18th International Conference, FC 2014, Christ Church, Barbados, March 3-7, 2014, Revised Selected Papers 18, pp. 195\u2013215 Springer","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"7112_CR2","doi-asserted-by":"crossref","unstructured":"Seo JH, Cheon JH, Katz J (2012) Constant-round multi-party private set union using reversed laurent series. In: Public Key Cryptography\u2013PKC 2012: 15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany, May 21-23, 2012. Proceedings 15, pp. 398\u2013412 Springer","DOI":"10.1007\/978-3-642-30057-8_24"},{"key":"7112_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-012-9119-4","volume":"26","author":"J Katz","year":"2013","unstructured":"Katz J, Sahai A, Waters B (2013) Predicate encryption supporting disjunctions, polynomial equations, and inner products. J Cryptol 26:191\u2013224","journal-title":"J Cryptol"},{"key":"7112_CR4","unstructured":"Sahai A, Waters B (2005) Fuzzy identity-based encryption. In: Advances in Cryptology\u2013EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings 24, pp. 457\u2013473 Springer"},{"key":"7112_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D, Sahai A, Waters B (2011) Functional encryption: Definitions and challenges. In: Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings 8, pp. 253\u2013273 Springer","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"7112_CR6","doi-asserted-by":"crossref","unstructured":"Goldwasser S, Gordon SD, Goyal V, Jain A, Katz J, Liu F-H, Sahai A, Shi E, Zhou H-S (2014) Multi-input functional encryption. In: Advances in Cryptology\u2013EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings 33, pp. 578\u2013602 Springer","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"7112_CR7","doi-asserted-by":"crossref","unstructured":"Chotard J, Sans ED, Gay R, Phan DH, Pointcheval D (2018) Decentralized multi-client functional encryption for inner product. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 703\u2013732 Springer","DOI":"10.1007\/978-3-030-03329-3_24"},{"issue":"12","key":"7112_CR8","doi-asserted-by":"publisher","first-page":"13744","DOI":"10.1007\/s11227-023-05129-y","volume":"79","author":"M Rafiee","year":"2023","unstructured":"Rafiee M (2023) Flexible multi-client functional encryption for set intersection. J Supercomput 79(12):13744\u201313765","journal-title":"J Supercomput"},{"issue":"1","key":"7112_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10623-021-00961-w","volume":"90","author":"K Lee","year":"2022","unstructured":"Lee K, Seo M (2022) Functional encryption for set intersection in the multi-client setting. Designs Codes Cryptogr 90(1):17\u201347","journal-title":"Designs Codes Cryptogr"},{"key":"7112_CR10","doi-asserted-by":"crossref","unstructured":"van de Kamp T, Stritzl D, Jonker W, Peter A (2019) Two-client and multi-client functional encryption for set intersection. In: Australasian Conference on Information Security and Privacy, pp. 97\u2013115 Springer","DOI":"10.1007\/978-3-030-21548-4_6"},{"key":"7112_CR11","doi-asserted-by":"crossref","unstructured":"Boneh D (1998) The decision diffie-hellman problem. In: International Algorithmic Number Theory Symposium, pp. 48\u201363 Springer","DOI":"10.1007\/BFb0054851"},{"key":"7112_CR12","unstructured":"SD, L.B.\u0162 R.G, Moriai S (2019) Multi-client functional encryption for linear functions in the standard model from lwe. In: Advances in Cryptology\u2013ASIACRYPT, vol. 2019"},{"issue":"6","key":"7112_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):1\u201340","journal-title":"J ACM (JACM)"},{"key":"7112_CR14","first-page":"164","volume":"2002","author":"M Scott","year":"2002","unstructured":"Scott M (2002) Authenticated id-based key exchange and remote log-in with simple token and PIN number. IACR Cryptol ePrint Arch 2002:164","journal-title":"IACR Cryptol ePrint Arch"},{"issue":"8","key":"7112_CR15","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":"7112_CR16","doi-asserted-by":"crossref","unstructured":"Du K, Wang J, Wu J, Wang Y (2024) Scalable equi-join queries over encrypted database. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4002\u20134016","DOI":"10.1145\/3658644.3690377"},{"key":"7112_CR17","doi-asserted-by":"crossref","unstructured":"Rafiee M (2023) Multi-adjustable join schemes with adaptive indistinguishably security. IEEE Transactions on Dependable and Secure Computing","DOI":"10.1109\/TDSC.2023.3343872"},{"issue":"18","key":"7112_CR18","doi-asserted-by":"publisher","first-page":"20324","DOI":"10.1007\/s11227-023-05416-8","volume":"79","author":"S Bera","year":"2023","unstructured":"Bera S, Prasad S, Rao YS (2023) Verifiable and boolean keyword searchable attribute-based signcryption for electronic medical record storage and retrieval in cloud computing environment. J Supercomput 79(18):20324\u201320382","journal-title":"J Supercomput"},{"key":"7112_CR19","doi-asserted-by":"crossref","unstructured":"Wu J, Zhang K, Wei L, Gong J, Ning J (2024) Practical searchable symmetric encryption for arbitrary boolean query-join in cloud storage. IEEE Trans Inf Forens Sec","DOI":"10.1109\/TIFS.2024.3486002"},{"key":"7112_CR20","first-page":"417","volume":"2005","author":"L Ballard","year":"2005","unstructured":"Ballard L, Green M, de Medeiros B, Monrose F (2005) Correlation-resistant storage via keyword-searchable encryption. IACR Cryptol ePrint Arch 2005:417","journal-title":"IACR Cryptol ePrint Arch"},{"key":"7112_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1112\/S1461157000001108","volume":"7","author":"SD Galbraith","year":"2004","unstructured":"Galbraith SD, Rotger V (2004) Easy decision Diffie-Hellman groups. LMS J Comput Math 7:201\u2013218","journal-title":"LMS J Comput Math"},{"key":"7112_CR22","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X, Shacham H (2004) Short group signatures. In: Annual International Cryptology Conference, pp. 41\u201355 Springer","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"7112_CR23","doi-asserted-by":"crossref","unstructured":"Ateniese G, Camenisch J, De Medeiros B (2005) Untraceable rfid tags via insubvertible encryption. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 92\u2013101","DOI":"10.1145\/1102120.1102134"},{"key":"7112_CR24","doi-asserted-by":"crossref","unstructured":"Camenisch J, Hohenberger S, Lysyanskaya A (2005) Compact e-cash. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 302\u2013321 Springer","DOI":"10.1007\/11426639_18"},{"key":"7112_CR25","unstructured":"Lynn B (2006) The pairing-based cryptography library. https:\/\/crypto.stanford.edu\/pbc\/"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07112-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07112-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07112-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T17:48:58Z","timestamp":1742060938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07112-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,15]]},"references-count":25,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["7112"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07112-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,15]]},"assertion":[{"value":"21 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2025","order":2,"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":"628"}}