{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T15:13:40Z","timestamp":1785510820042,"version":"3.56.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangzhou Key R&D Program Project","award":["2023B01J0002"],"award-info":[{"award-number":["2023B01J0002"]}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB4400703"],"award-info":[{"award-number":["2022YFB4400703"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10586-026-06226-2","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T13:43:18Z","timestamp":1782740598000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["IBMEIL: identity-based matchmaking encryption scheme from ideal lattices for IoT"],"prefix":"10.1007","volume":"29","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jielin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sizhao","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Linfeng","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanjiao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tinghua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,29]]},"reference":[{"key":"6226_CR1","doi-asserted-by":"publisher","first-page":"9910","DOI":"10.1109\/TIFS.2024.3484155","volume":"19","author":"L Chen","year":"2024","unstructured":"Chen, L., Li, J., Li, J., Weng, J.: PAESS: public-key authentication encryption with similar data search for pay-per-query. IEEE Trans. Inf. Forensics Secur. 19, 9910\u20139923 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"6226_CR2","volume":"84","author":"S Liu","year":"2024","unstructured":"Liu, S., Hu, Y., Wang, X.A., Liu, X., Yin, Y., Wang, T.: Puncturable-based broadcast encryption with tracking for preventing malicious encryptors in cloud file sharing. J. Inf. Secur. Appl. 84, 103803 (2024)","journal-title":"J. Inf. Secur. Appl."},{"issue":"3","key":"6226_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10586-024-04928-z","volume":"28","author":"AM Tawfik","year":"2025","unstructured":"Tawfik, A.M., Al-Ahwal, A., Eldien, A.S.T., Zayed, H.H.: Pricollabanalysis: privacy-preserving healthcare collaborative analysis on blockchain using homomorphic encryption and secure multiparty computation. Clust. Comput. 28(3), 191 (2025)","journal-title":"Clust. Comput."},{"key":"6226_CR4","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Francati, D., Nu\u00f1ez, D., Venturi, D.: Match me if you can: matchmaking encryption and its applications. In: Annual International Cryptology Conference, vol. 11693, pp. 701\u2013731 (2019)","DOI":"10.1007\/978-3-030-26951-7_24"},{"key":"6226_CR5","doi-asserted-by":"publisher","first-page":"4345","DOI":"10.1109\/TIFS.2023.3294725","volume":"18","author":"J Sun","year":"2023","unstructured":"Sun, J., Xu, G., Zhang, T., Yang, X., Alazab, M., Deng, R.H.: Privacy-aware and security-enhanced efficient matchmaking encryption. IEEE Transactions on Information Forensics and Security 18, 4345\u20134360 (2023)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"6226_CR6","doi-asserted-by":"crossref","unstructured":"Boyen, X., Li, Q.: Identity-based matchmaking encryption with enhanced privacy - A generic construction with practical instantiations. In: European Symposium on Research in Computer Security, vol. 14345, pp. 425\u2013445 (2023)","DOI":"10.1007\/978-3-031-51476-0_21"},{"issue":"3","key":"6226_CR7","doi-asserted-by":"publisher","first-page":"4381","DOI":"10.1109\/TMC.2025.3623732","volume":"25","author":"J Yan","year":"2026","unstructured":"Yan, J., Chen, J., Qian, H., Ning, J., He, D.: Decentralized multi-authority accurate matchmaking encryption scheme for mobile social networks. IEEE Trans. Mob. Comput. 25(3), 4381\u20134392 (2026)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"6226_CR8","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 6110, pp. 523\u2013552 (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"6226_CR9","doi-asserted-by":"crossref","unstructured":"Genise, N., Micciancio, D., Polyakov, Y.: Building an efficient lattice gadget toolkit: Subgaussian sampling and more. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 11477, pp. 655\u2013684 (2019)","DOI":"10.1007\/978-3-030-17656-3_23"},{"key":"6226_CR10","doi-asserted-by":"crossref","unstructured":"Genise, N., Micciancio, D.: Faster gaussian sampling for trapdoor lattices with arbitrary modulus. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 174\u2013203 (2018)","DOI":"10.1007\/978-3-319-78381-9_7"},{"issue":"4","key":"6226_CR11","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/TC.2018.2874479","volume":"68","author":"KD G\u00fcr","year":"2019","unstructured":"G\u00fcr, K.D., Polyakov, Y., Rohloff, K., Ryan, G.W., Sajjadpour, H., Savas, E.: Practical applications of improved gaussian sampling for trapdoor lattices. IEEE Transactions on Computers 68(4), 570\u2013584 (2019)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"6226_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-3128-3","volume":"18","author":"Y Yang","year":"2024","unstructured":"Yang, Y., Zhang, G., Li, S., Liu, Z.: Offline\/online attribute-based searchable encryption scheme from ideal lattices for iot. Frontiers Comput. Sci. 18(3), 183817 (2024)","journal-title":"Frontiers Comput. Sci."},{"key":"6226_CR13","doi-asserted-by":"publisher","first-page":"8644","DOI":"10.1109\/TIFS.2024.3459646","volume":"19","author":"Z Lin","year":"2024","unstructured":"Lin, Z., Li, H., Chen, X., Xiao, M., Huang, Q.: Identity-based encryption with disjunctive, conjunctive and range keyword search from lattices. IEEE Trans. Inf. Forensics Secur. 19, 8644\u20138657 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"6226_CR14","doi-asserted-by":"crossref","unstructured":"Francati, D., Guidi, A., Russo, L., Venturi, D.: Identity-based matchmaking encryption without random oracles. In: International Conference on Cryptology in India, vol. 13143, pp. 415\u2013435 (2021)","DOI":"10.1007\/978-3-030-92518-5_19"},{"key":"6226_CR15","doi-asserted-by":"publisher","first-page":"5592","DOI":"10.1109\/TIFS.2023.3310663","volume":"18","author":"A Wu","year":"2023","unstructured":"Wu, A., Luo, W., Weng, J., Yang, A., Wen, J.: Fuzzy identity-based matchmaking encryption and its application. IEEE Trans. Inf. Forensics Secur. 18, 5592\u20135607 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"6226_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2023.102950","volume":"142","author":"Z Yan","year":"2023","unstructured":"Yan, Z., Qu, H., Zhang, X., Xu, J., Lin, X.J.: Identity-based proxy matchmaking encryption for cloud-based anonymous messaging systems. J. Syst. Archit. 142, 102950 (2023)","journal-title":"J. Syst. Archit."},{"issue":"22","key":"6226_CR17","doi-asserted-by":"publisher","first-page":"36748","DOI":"10.1109\/JIOT.2024.3420176","volume":"11","author":"X Hu","year":"2024","unstructured":"Hu, X., Wang, L., Gu, L., Ning, Y.: A bilateral access control data sharing scheme for internet of vehicles. IEEE Internet Things J. 11(22), 36748\u201336762 (2024)","journal-title":"IEEE Internet Things J."},{"issue":"2","key":"6226_CR18","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TCC.2024.3386126","volume":"12","author":"A Wu","year":"2024","unstructured":"Wu, A., Zhang, Y., Zhu, J., Zhao, Q., Zhang, Y.: Hierarchal bilateral access control with constant size ciphertexts for mobile cloud computing. IEEE Trans. Cloud Comput. 12(2), 659\u2013670 (2024)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"6226_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TIFS.2023.3321961","volume":"19","author":"N Yang","year":"2024","unstructured":"Yang, N., Tang, C., He, D.: A lightweight certificateless multi-user matchmaking encryption for mobile devices: enhancing security and performance. IEEE Trans. Inf. Forensics Secur. 19, 251\u2013264 (2024)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"5","key":"6226_CR20","doi-asserted-by":"publisher","first-page":"2790","DOI":"10.1109\/TSC.2024.3387691","volume":"17","author":"N Yang","year":"2024","unstructured":"Yang, N., Tang, C., Xiong, Z., He, D.: RCME: a reputation incentive committee consensus-based for matchmaking encryption in iot healthcare. IEEE Trans. Serv. Comput. 17(5), 2790\u20132806 (2024)","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"7","key":"6226_CR21","doi-asserted-by":"publisher","first-page":"7736","DOI":"10.1109\/JIOT.2024.3476669","volume":"12","author":"Z Peng","year":"2025","unstructured":"Peng, Z., Peng, C., Tian, Y., Ding, H.: Securing intelligent vehicles: authentication and bilateral control via inner product matchmaking encryption. IEEE Internet of Things Journal 12(7), 7736\u20137748 (2025)","journal-title":"IEEE Internet of Things Journal"},{"key":"6226_CR22","doi-asserted-by":"publisher","first-page":"9084","DOI":"10.1109\/TIFS.2025.3601539","volume":"20","author":"J Yan","year":"2025","unstructured":"Yan, J., Ling, Y., Chen, J., Qian, H.: Museme: multi-user secure and efficient matchmaking encryption for mobile devices. IEEE Transactions on Information Forensics and Security 20, 9084\u20139098 (2025)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"3","key":"6226_CR23","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1109\/TDSC.2024.3479236","volume":"22","author":"Y Cao","year":"2025","unstructured":"Cao, Y., Wei, J., Huang, X., Chen, X., Xiang, Y.: Deniable identity-based matchmaking encryption for anonymous messaging. IEEE Trans. Dependable Secur. Comput. 22(3), 2197\u20132210 (2025)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"6226_CR24","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2020.10.010","volume":"849","author":"A Takayasu","year":"2021","unstructured":"Takayasu, A., Watanabe, Y.: Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more. Theoretical Computer Science 849, 64\u201398 (2021)","journal-title":"Theoretical Computer Science"},{"key":"6226_CR25","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2022.06.028","volume":"929","author":"P Dutta","year":"2022","unstructured":"Dutta, P., Susilo, W., Duong, D.H., Roy, P.S.: Puncturable identity-based and attribute-based encryption from lattices. Theor. Comput. Sci. 929, 18\u201338 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"6226_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2022.103695","volume":"84","author":"NAV Nguyen","year":"2023","unstructured":"Nguyen, N.A.V., Pham, M.T.T.: Quantum-safe anonymous hierarchical identity-based encryption with traceable identities. Computer Standards & Interfaces 84, 103695 (2023)","journal-title":"Computer Standards & Interfaces"},{"key":"6226_CR27","doi-asserted-by":"publisher","first-page":"9851","DOI":"10.1109\/ACCESS.2023.3240304","volume":"11","author":"X Tao","year":"2023","unstructured":"Tao, X., Qiang, Y., Wang, P., Wang, Y.: LMIBE: lattice-based matchmaking identity-based encryption for internet of things. IEEE Access 11, 9851\u20139858 (2023)","journal-title":"IEEE Access"},{"key":"6226_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.115048","volume":"1029","author":"Y Wang","year":"2025","unstructured":"Wang, Y., Wang, B., Lai, Q., Zhan, Y.: Identity-based matchmaking encryption with stronger security and instantiation on lattices. Theor. Comput. Sci. 1029, 115048 (2025)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6226_CR29","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TDSC.2024.3418984","volume":"22","author":"H Wang","year":"2025","unstructured":"Wang, H., Chen, K., Xie, Q., Meng, Q.: Post-quantum secure identity-based matchmaking encryption. IEEE Trans. Dependable Secur. Comput. 22(1), 833\u2013844 (2025)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"6226_CR30","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 6110, pp. 1\u201323 (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"6226_CR31","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Automata, Languages and Programming, International Colloquium, vol. 4052, pp. 144\u2013155 (2006)","DOI":"10.1007\/11787006_13"},{"key":"6226_CR32","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Annual Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"6226_CR33","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 6110, pp. 553\u2013572 (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"6226_CR34","doi-asserted-by":"crossref","unstructured":"Bert, P., Fouque, P., Roux-Langlois, A., Sabt, M.: Practical implementation of ring-sis\/lwe based signature and IBE. In: International Conference, PQCrypto, vol. 10786, pp. 271\u2013291 (2018)","DOI":"10.1007\/978-3-319-79063-3_13"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06226-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-026-06226-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06226-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T14:46:14Z","timestamp":1785509174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-026-06226-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,29]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["6226"],"URL":"https:\/\/doi.org\/10.1007\/s10586-026-06226-2","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,29]]},"assertion":[{"value":"19 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"405"}}