{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:12:40Z","timestamp":1743106360376,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609536"},{"type":"electronic","value":"9789819609543"}],"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-981-96-0954-3_9","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:51:01Z","timestamp":1738345861000},"page":"168-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simple Construction of\u00a0PEKS from\u00a0LWE-Based IBE in\u00a0the\u00a0Standard Model"],"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,2,1]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searchable encryption revisited:\u00a0consistency properties, relation to anonymous ibe, and extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205\u2013222. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_13"},{"key":"9_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-031-58868-6_13","volume-title":"CT-RSA 2024","author":"P Abla","year":"2024","unstructured":"Abla, P.: Identity-based encryption from LWE with more compact master public key. In: Oswald, E. (ed.) CT-RSA 2024. LNCS, vol. 14643, pp. 319\u2013353. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_13"},{"key":"9_CR3","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":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98\u2013115. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_6"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","volume":"48","author":"J Alwen","year":"2011","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. Theory Comput. Syst. 48, 535\u2013553 (2011)","journal-title":"Theory Comput. Syst."},{"key":"9_CR6","unstructured":"Apon, D., Fan, X., Liu, F.: Compact identity based encryption from LWE. Cryptology ePrint Archive, 2016\/125 (2016)"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TDSC.2018.2867462","volume":"17","author":"R Behnia","year":"2018","unstructured":"Behnia, R., Ozmen, M.O., Yavuz, A.A.: Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans. Dependable Secure Comput. 17(6), 1269\u20131282 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"9_CR8","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":"9_CR9","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"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E.: How to delegate a lattice basis. Cryptology ePrint Archive, 2009\/351 (2009)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. Cryptology ePrint Archive, 2007\/432 (2007)","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-030-75245-3_22","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"T Jager","year":"2021","unstructured":"Jager, T., Kurek, R., Niehues, D.: Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 596\u2013626. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_22"},{"key":"9_CR15","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"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 145\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_8"},{"issue":"6","key":"9_CR18","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"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1007\/s10586-021-03488-w","volume":"25","author":"Y Tang","year":"2022","unstructured":"Tang, Y., Ba, Y., Li, L., Wang, X., Yan, X.: Lattice-based public-key encryption with conjunctive keyword search in multi-user setting for IIoT. Clust. Comput. 25(4), 2305\u20132316 (2022)","journal-title":"Clust. Comput."},{"key":"9_CR20","first-page":"102433","volume":"51","author":"P Wang","year":"2020","unstructured":"Wang, P., Xiang, T., Li, X., Xiang, H.: Public key encryption with conjunctive keyword search on lattice. J. Inf. Secur. Appl. 51, 102433 (2020)","journal-title":"J. Inf. Secur. Appl."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Xu, L., Yuan, X., Steinfeld, R., Wang, C., Xu, C.: Multi-writer searchable encryption: an LWE-based realization and implementation. In: ASIACCS 2019, pp. 122-133 (2019)","DOI":"10.1145\/3321705.3329814"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-49896-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Yamada","year":"2016","unstructured":"Yamada, S.: Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 32\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_2"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Yamada","year":"2017","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 161\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_6"},{"key":"9_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2023.103732","volume":"86","author":"X Yang","year":"2023","unstructured":"Yang, X., Chen, X., Huang, J., Li, H., Huang, Q.: FS-IBEKS: forward secure identity-based encryption with keyword search from lattice. Comput. Stand. Interfaces 86, 103732 (2023)","journal-title":"Comput. Stand. Interfaces"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"9927","DOI":"10.1007\/s11042-017-4560-x","volume":"77","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Zheng, X., Chang, V., Ye, S., Tang, C.: Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimed. Tools Appl. 77, 9927\u20139941 (2018)","journal-title":"Multimed. Tools Appl."},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Yamada","year":"2017","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 161\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_6"},{"issue":"3","key":"9_CR27","first-page":"1019","volume":"18","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Xu, C., Wang, H., Zhang, Y., Wang, S.: FS-PEKS: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans. Dependable Secure Comput. 18(3), 1019\u20131032 (2019)","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0954-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:51:07Z","timestamp":1738345867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0954-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609536","9789819609543"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0954-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2024.github.io\/ProvSec2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}