{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:38:49Z","timestamp":1775817529207,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031957604","type":"print"},{"value":"9783031957611","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95761-1_3","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:30:31Z","timestamp":1750498231000},"page":"62-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fully Secure Searchable Encryption from\u00a0PRFs, Pairings, and\u00a0Lattices"],"prefix":"10.1007","author":[{"given":"Hirotomo","family":"Shinoki","sequence":"first","affiliation":[]},{"given":"Hisayoshi","family":"Sato","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Yoshino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"3_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205\u2013222. Springer, Heidelberg (2005)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-319-96884-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"M Abdalla","year":"2018","unstructured":"Abdalla, M., Catalano, D., Fiore, D., Gay, R., Ursu, B.: Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 597\u2013627. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_20"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/978-3-662-46447-2_35","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"S Agrawal","year":"2015","unstructured":"Agrawal, S., Agrawal, S., Badrinarayanan, S., Kumarasubramanian, A., Prabhakaran, M., Sahai, A.: On the practical security of inner product functional encryption. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 777\u2013798. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_35"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-84259-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., Maitra, M., Vempati, N.S., Yamada, S.: Functional encryption for Turing machines with dynamic bounded collusion from LWE. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 239\u2013269. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_9"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-64375-1_5","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Yamada, S.: CP-ABE for circuits (and more) in the symmetric key setting. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 117\u2013148. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_5"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: Theory of Computing Systems, vol. 48, pp. 535\u2013553 (2011)","DOI":"10.1007\/s00224-010-9278-3"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-36030-6_8","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Vaikuntanathan, V.: Optimal bounded-collusion secure functional encryption. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 174\u2013198. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_8"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"3895","DOI":"10.1007\/s10623-024-01473-z","volume":"92","author":"S Bai","year":"2024","unstructured":"Bai, S., Jangir, H., Ngo, T., Youmans, W.: An algebraic algorithm for breaking NTRU with multiple keys. Des. Codes Cryptogr. 92, 3895\u20133918 (2024)","journal-title":"Des. Codes Cryptogr."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bishop, A., Jain, A., Kowalczyk, L.: Function-hiding inner product encryption. In: Iwata, T., Cheon, J. (eds) ASIACRYPT 2015. LNCS, vol. 9452, pp. 470\u2013491. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-48797-6_20"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Segev, G.: Function-private functional encryption in the private-key setting. J. Cryptol. 31, 202\u2013225 (2018)","DOI":"10.1007\/s00145-017-9255-y"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11844662_6","volume-title":"Secure Data Management","author":"JW Byun","year":"2006","unstructured":"Byun, J.W., Rhee, H.S., Park, H.-A., Lee, D.H.: Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2006. LNCS, vol. 4165, pp. 75\u201383. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11844662_6"},{"key":"3_CR14","series-title":"LNCS","first-page":"303","volume-title":"ESORICS 2022","author":"L Cheng","year":"2022","unstructured":"Cheng, L., Meng, F.: Public key authenticated encryption with keyword search from LWE. In: Atluri, V., Di Pietro, R., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13554, pp. 303\u2013324. Springer, Cham (2022)"},{"key":"3_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119454","volume":"647","author":"L Cheng","year":"2023","unstructured":"Cheng, L., Qin, J., Feng, F., Meng, F.: Security-enhanced public-key authenticated searchable encryption. Inf. Sci. 647, 119454 (2023)","journal-title":"Inf. Sci."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Datta, P., Dutta, R., Mukhopadhyay, S.: Functional encryption for inner product with full function privacy. In: Cheng, C.M., Chung, K.M., Persiano, G., Yang, B.Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 164-195. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49384-7_7"},{"key":"3_CR17","series-title":"LNCS","first-page":"347","volume-title":"Pairing 2010","author":"A De Caro","year":"2010","unstructured":"De Caro, A., Iovino, V., Persiano, G.: Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 347\u2013366. Springer, Heidelberg (2010)"},{"key":"3_CR18","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":"3_CR19","doi-asserted-by":"crossref","unstructured":"Emura, K.: Generic construction of public-key authenticated encryption with keyword search revisited: stronger security and efficient construction. In: ACM APKC 2022, pp. 39\u201349 (2022)","DOI":"10.1145\/3494105.3526237"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie\u2013Hellman assumptions. J. Cryptol. 30, 242\u2013288 (2017)","DOI":"10.1007\/s00145-015-9220-6"},{"key":"3_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-031-07085-3_25","volume-title":"EUROCRYPT 2022","author":"R Garg","year":"2022","unstructured":"Garg, R., Goyal, R., Lu, G., Waters, B.: Dynamic collusion bounded functional encryption from identity-based encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 736\u2013763. Springer, Cham (2022)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: ACM STOC 2008, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 162\u2013179. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_11"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","volume":"403","author":"Q Huang","year":"2017","unstructured":"Huang, Q., Li, H.: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf. Sci. 403, 1\u201314 (2017)","journal-title":"Inf. Sci."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-98113-0_29","volume-title":"Security and Cryptography for Networks","author":"S Kim","year":"2018","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 544\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_29"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Li, Q., Boyen, X.: Public-key authenticated encryption with keyword search made easy. In: IACR Communications in Cryptology, vol. 1, no. 2 (2024)","DOI":"10.62056\/a63z11zn4"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: IEEE FOCS 2016, pp. 11\u201320 (2016)","DOI":"10.1109\/FOCS.2016.11"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Liu, ZY., Tseng, YF., Tso, R., Mambo, M., Chen, YC.: Public-key authenticated encryption with keyword search: cryptanalysis, enhanced security, and quantum-resistant instantiation. In: ACM ASIACCS, pp. 423\u2013436 (2022)","DOI":"10.1145\/3488932.3497760"},{"key":"3_CR30","unstructured":"Maples, K.: Singularity of random matrices over finite fields. arXiv preprint arXiv:1012.2372 (2010)"},{"key":"3_CR31","unstructured":"Meng, L., Chen, L., Tian, Y., Manulis, M., Liu, S.: FEASE: fast and expressive asymmetric searchable encryption. In: USENIX Security 2024, pp. 2545\u20132562 (2024)"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"3_CR33","series-title":"LNCS","first-page":"523","volume-title":"ACISP 2023","author":"S Mukherjee","year":"2023","unstructured":"Mukherjee, S.: Statistically consistent broadcast authenticated encryption with keyword search. In: Simpson, L., Rezazadeh Baee, M.A. (eds.) ACISP 2023. LNCS, vol. 13915, pp. 523\u2013552. Springer, Cham (2023)"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Nguyen, H.H., Paquette, E.: Surjectivity of near-square random matrices. Comb. Probab. Comput. 29(2), 267\u2013292 (2020)","DOI":"10.1017\/S0963548319000348"},{"issue":"4","key":"3_CR35","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1049\/iet-ifs.2018.5315","volume":"13","author":"M Noroozi","year":"2019","unstructured":"Noroozi, M., Eslami, Z.: Public key authenticated encryption with keyword search: revisited. IET Inf. Secur. 13(4), 336\u2013342 (2019)","journal-title":"IET Inf. Secur."},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ins.2019.12.063","volume":"516","author":"B Qin","year":"2020","unstructured":"Qin, B., Chen, Y., Huang, Q., Liu, X., Zheng, D.: Public-key authenticated encryption with keyword search revisited: security model and constructions. Inf. Sci. 516, 515\u2013528 (2020)","journal-title":"Inf. Sci."},{"key":"3_CR37","series-title":"LNCS","first-page":"19","volume-title":"ProvSec 2021","author":"B Qin","year":"2021","unstructured":"Qin, B., Cui, H., Zheng, X., Zheng, D.: Improved security model for public-key authenticated encryption with keyword search. In: Huang, Q., Yu, Y. (eds.) ProvSec 2021. LNCS, vol. 13059, pp. 19\u201338. Springer, Cham (2021)"},{"issue":"6","key":"3_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-00457-5_27","volume-title":"Theory of Cryptography","author":"E Shen","year":"2009","unstructured":"Shen, E., Shi, E., Waters, B.: Predicate privacy in encryption systems. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 457\u2013473. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_27"},{"key":"3_CR40","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE S &P 2000, pp. 44\u201355 (2000)"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-45871-7_24","volume-title":"Information Security","author":"J Tomida","year":"2016","unstructured":"Tomida, J., Abe, M., Okamoto, T.: Efficient functional encryption for inner-product values with full-hiding security. In: Bishop, M., Nascimento, A. (eds.) ISC 2016. LNCS, vol. 9866, pp. 408\u2013425. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45871-7_24"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95761-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T21:19:07Z","timestamp":1757193547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 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"}}]}}