{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:15:24Z","timestamp":1767993324098,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918193","type":"print"},{"value":"9783031918209","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-91820-9_7","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:02:40Z","timestamp":1746597760000},"page":"194-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Registration-Based Encryption in\u00a0the\u00a0Plain Model"],"prefix":"10.1007","author":[{"given":"Jesko","family":"Dujmovic","sequence":"first","affiliation":[]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO\u00a02001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-45146-4_18","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"B Barak","year":"2003","unstructured":"Barak, B., Ong, S.J., Vadhan, S.: Derandomization in cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 299\u2013315. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_18"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-03807-6_8","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2018","unstructured":"Bitansky, N., Lin, H.: One-message zero knowledge and non-malleable commitments. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 209\u2013234. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_8"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46497-7_16","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2015","unstructured":"Bitansky, N., Paneth, O.: ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 401\u2013427. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_16"},{"key":"7_CR5","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":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: 51st FOCS, pp. 541\u2013550. IEEE Computer Society Press, October 2010. https:\/\/doi.org\/10.1109\/FOCS.2010.86","DOI":"10.1109\/FOCS.2010.86"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C Cocks","year":"2001","unstructured":"Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_32"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-63688-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"N D\u00f6ttling","year":"2017","unstructured":"D\u00f6ttling, N., Garg, S.: Identity-based encryption from the Diffie-Hellman assumption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 537\u2013569. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_18"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76578-5_1","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"N D\u00f6ttling","year":"2018","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D.: New constructions of identity-based and key-dependent message secure encryption schemes. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 3\u201331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_1"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: In: Hazay, C., Stam, M. (eds) EUROCRYPT 2023. LNCS, vol. 14006, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Francati, D., Friolo, D., Maitra, M., Malavolta, G., Rahimi, A., Venturi, D.: Registered (inner-product) functional encryption. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-99-8733-7_4"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, October 2013. https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-030-03807-6_25","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A.: Registration-based encryption: removing private-key generator from IBE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 689\u2013718. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_25"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-17259-6_3","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"S Garg","year":"2019","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A., Sekar, S.: Registration-based encryption from standard assumptions. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_3"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11761679_27","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Gentry","year":"2006","unstructured":"Gentry, C.: Practical identity-based encryption without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 445\u2013464. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_27"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Glaeser, N., Kolonelos, D., Malavolta, G., Rahimi, A.: Efficient registration-based encryption. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1065\u20131079 (2023)","DOI":"10.1145\/3576915.3616596"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press, October 1984. https:\/\/doi.org\/10.1109\/SFCS.1984.715949","DOI":"10.1109\/SFCS.1984.715949"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 89\u201398. ACM Press, October\/November 2006. https:\/\/doi.org\/10.1145\/1180405.1180418, available as Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Hohenberger, S., Lu, G., Waters, B., Wu, D.J.: Registered attribute-based encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 511\u2013542. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_17","DOI":"10.1007\/978-3-031-30620-4_17"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-26954-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YT Kalai","year":"2019","unstructured":"Kalai, Y.T., Khurana, D.: Non-interactive non-malleability from quantum supremacy. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 552\u2013582. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_18"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-77883-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"D Khurana","year":"2021","unstructured":"Khurana, D.: Non-interactive Distributional Indistinguishability (NIDI) and\u00a0non-malleable commitments. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 186\u2013215. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_7"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Lin, H., Pass, R., Soni, P.: Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles. In: Umans, C. (ed.) 58th FOCS, pp. 576\u2013587. IEEE Computer Society Press, October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.59","DOI":"10.1109\/FOCS.2017.59"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-031-22318-1_20","volume-title":"Theory of Cryptography","author":"M Mahmoody","year":"2022","unstructured":"Mahmoody, M., Qi, W., Rahimi, A.: Lower bounds for the number of decryption updates in registration-based encryption. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography, pp. 559\u2013587. Springer Nature Switzerland, Cham (2022)"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO\u00a02008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (Aug 2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_4","DOI":"10.1007\/978-3-540-85174-5_4"},{"key":"7_CR29","unstructured":"Rogaway, P.: The moral character of cryptographic work. Cryptology ePrint Archive (2015)"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.R.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT\u00a02005. LNCS, vol.\u00a03494, pp. 457\u2013473. Springer, Heidelberg (May 2005). https:\/\/doi.org\/10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Waters, B.R.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT\u00a02005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (May 2005). https:\/\/doi.org\/10.1007\/11426639_7","DOI":"10.1007\/11426639_7"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91820-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T06:02:46Z","timestamp":1746597766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91820-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918193","9783031918209"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91820-9_7","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":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}