{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:11:22Z","timestamp":1761397882119,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018052"},{"type":"electronic","value":"9783032018069"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-01806-9_15","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:06:07Z","timestamp":1761397567000},"page":"274-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Identity-Based Matchmaking Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4802-8235","authenticated-orcid":false,"given":"Sohto","family":"Chiku","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3598-0988","authenticated-orcid":false,"given":"Keisuke","family":"Hara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2861-359X","authenticated-orcid":false,"given":"Junji","family":"Shikata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26951-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"G Ateniese","year":"2019","unstructured":"Ateniese, G., Francati, D., Nu\u00f1ez, D., Venturi, D.: Match me if you can: matchmaking encryption and its applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 701\u2013731. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_24"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00145-021-09381-4","volume":"34","author":"G Ateniese","year":"2021","unstructured":"Ateniese, G., Francati, D., Nu\u00f1ez, D., Venturi, D.: Match me if you can: matchmaking encryption and its applications. J. Cryptol. 34(3), 16 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09381-4","journal-title":"J. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Belfiore, R.C., Cosmo, A.D., Ferrara, A.L.: Identity-based matchmaking encryption from standard lattice assumptions. In: P\u00f6pper, C., Batina, L. (eds.) ACNS 2024, Part\u00a0II. LNCS, vol. 14584, pp. 163\u2013188. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-54773-7_7","key":"15_CR4","DOI":"10.1007\/978-3-031-54773-7_7"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-662-44371-2_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"O Blazy","year":"2014","unstructured":"Blazy, O., Kiltz, E., Pan, J.: (Hierarchical) identity-based encryption from affine message authentication. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 408\u2013425. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_23"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"doi-asserted-by":"publisher","unstructured":"Boyen, X., Li, Q.: Identity-based matchmaking encryption with enhanced privacy \u2014 a generic construction with practical instantiations. In: Tsudik, G., Conti, M., Liang, K., Smaragdakis, G. (eds.) ESORICS 2023. LNCS, vol. 14345, pp. 425\u2013445. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-51476-0_21","key":"15_CR7","DOI":"10.1007\/978-3-031-51476-0_21"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/11818175_17","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"X Boyen","year":"2006","unstructured":"Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (without random Oracles). In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290\u2013307. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_17"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-24676-3_13","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207\u2013222. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_13"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4), 601\u2013639 (2012). https:\/\/doi.org\/10.1007\/s00145-011-9105-2","journal-title":"J. Cryptol."},{"doi-asserted-by":"publisher","unstructured":"Chen, J., Li, Y., Wen, J., Weng, J.: Identity-based matchmaking encryption from standard assumptions. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13793, pp. 394\u2013422. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_14","key":"15_CR11","DOI":"10.1007\/978-3-031-22969-5_14"},{"unstructured":"Chiku, S., Hashimoto, K., Hara, K., Shikata, J.: Identity-based matchmaking encryption, revisited: strong security and practical constructions from standard classical and post-quantum assumptions. Cryptology ePrint Archive, Paper 2023\/1435 (2023). https:\/\/eprint.iacr.org\/2023\/1435","key":"15_CR12"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-92518-5_19","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"D Francati","year":"2021","unstructured":"Francati, D., Guidi, A., Russo, L., Venturi, D.: Identity-based matchmaking encryption without random oracles. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 415\u2013435. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_19"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 53\u201368. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_5"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548\u2013566. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_34"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46035-7_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J Horwitz","year":"2002","unstructured":"Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 466\u2013481. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_31"},{"unstructured":"Kiltz, E., Neven, G.: Identity-based signatures. In: Cryptology and Information Security Series on Identity-Based Cryptography, vol. I, pp. 31\u201344, January 2008","key":"15_CR18"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-981-97-0942-7_13","volume-title":"Information Security and Cryptology","author":"S Lin","year":"2024","unstructured":"Lin, S., Li, Y., Chen, J.: CCA-secure identity-based matchmaking encryption from standard assumptions. In: Ge, C., Yung, M. (eds.) Information Security and Cryptology, pp. 253\u2013273. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-97-0942-7_13"},{"unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022","key":"15_CR20"},{"unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: The 2000 Symposium on Cryptography and Information Security, January 2000","key":"15_CR21"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-00468-1_13","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"JH Seo","year":"2009","unstructured":"Seo, J.H., Kobayashi, T., Ohkubo, M., Suzuki, K.: Anonymous hierarchical identity-based encryption with constant size ciphertexts. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 215\u2013234. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_13"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-540-70583-3_46","volume-title":"Automata, Languages and Programming","author":"E Shi","year":"2008","unstructured":"Shi, E., Waters, B.: Delegating capabilities in predicate encryption systems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 560\u2013578. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_46"},{"doi-asserted-by":"publisher","unstructured":"Wang, Y., Wang, B., Lai, Q., Zhan, Y.: Identity-based matchmaking encryption with stronger security and instantiation on lattices. Theoret. Comput. Sci. 1029, 115048 (2025). https:\/\/doi.org\/10.1016\/j.tcs.2024.115048. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397524006650","key":"15_CR24","DOI":"10.1016\/j.tcs.2024.115048"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01806-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:06:09Z","timestamp":1761397569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01806-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032018052","9783032018069"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01806-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}