{"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031587221"]},"citation":{"apa":"Tairi, E., & Ünal, A. (2024). Lower bounds for lattice-based compact functional encryption. In Advances in Cryptology – EUROCRYPT 2024 (Vol. 14652, pp. 249–279). Zurich, Switzerland: Springer Nature. https://doi.org/10.1007/978-3-031-58723-8_9","short":"E. Tairi, A. Ünal, in:, Advances in Cryptology – EUROCRYPT 2024, Springer Nature, 2024, pp. 249–279.","mla":"Tairi, Erkan, and Akin Ünal. “Lower Bounds for Lattice-Based Compact Functional Encryption.” Advances in Cryptology – EUROCRYPT 2024, vol. 14652, Springer Nature, 2024, pp. 249–79, doi:10.1007/978-3-031-58723-8_9.","ista":"Tairi E, Ünal A. 2024. Lower bounds for lattice-based compact functional encryption. Advances in Cryptology – EUROCRYPT 2024. EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 14652, 249–279.","chicago":"Tairi, Erkan, and Akin Ünal. “Lower Bounds for Lattice-Based Compact Functional Encryption.” In Advances in Cryptology – EUROCRYPT 2024, 14652:249–79. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-58723-8_9.","ieee":"E. Tairi and A. Ünal, “Lower bounds for lattice-based compact functional encryption,” in Advances in Cryptology – EUROCRYPT 2024, Zurich, Switzerland, 2024, vol. 14652, pp. 249–279.","ama":"Tairi E, Ünal A. Lower bounds for lattice-based compact functional encryption. In: Advances in Cryptology – EUROCRYPT 2024. Vol 14652. Springer Nature; 2024:249-279. doi:10.1007/978-3-031-58723-8_9"},"date_updated":"2024-06-10T10:05:30Z","language":[{"iso":"eng"}],"type":"conference","intvolume":" 14652","day":"08","oa_version":"Submitted Version","oa":1,"author":[{"first_name":"Erkan","last_name":"Tairi","full_name":"Tairi, Erkan"},{"orcid":"0000-0002-8929-0221","full_name":"Ünal, Akin","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","last_name":"Ünal"}],"date_created":"2024-06-09T22:01:03Z","_id":"17126","status":"public","volume":14652,"main_file_link":[{"url":"https://eprint.iacr.org/2023/719.pdf","open_access":"1"}],"page":"249-279","abstract":[{"text":"Functional encryption (FE) is a primitive where the holder of a master secret key can control which functions a user can evaluate on encrypted data. It is a powerful primitive that even implies indistinguishability obfuscation (iO), given sufficiently compact ciphertexts (Ananth-Jain, CRYPTO’15 and Bitansky-Vaikuntanathan, FOCS’15). However, despite being extensively studied, there are FE schemes, such as function-hiding inner-product FE (Bishop-Jain-Kowalczyk, AC’15, Abdalla-Catalano-Fiore-Gay-Ursu, CRYPTO’18) and compact quadratic FE (Baltico-Catalano-Fiore-Gay, Lin, CRYPTO’17), that can be only realized using pairings. This raises the question if there are some mathematical barriers that hinder us from realizing these FE schemes from other assumptions.\r\n\r\nIn this paper, we study the difficulty of constructing lattice-based compact FE. We generalize the impossibility results of Ünal (EC’20) for lattice-based function-hiding FE, and extend it to the case of compact FE. Concretely, we prove lower bounds for lattice-based compact FE schemes which meet some (natural) algebraic restrictions at encryption and decryption, and have ciphertexts of linear size and secret keys of minimal degree. We see our results as important indications of why it is hard to construct lattice-based FE schemes for new functionalities, and which mathematical barriers have to be overcome.","lang":"eng"}],"date_published":"2024-05-08T00:00:00Z","acknowledgement":"We want to thank the anonymous reviewers of TCC and Eurocrypt for their very helpful comments and suggestions. This work has received funding from the Austrian Science Fund (FWF) and netidee SCIENCE via grant P31621-N38 (PROFET).","publication":"Advances in Cryptology – EUROCRYPT 2024","doi":"10.1007/978-3-031-58723-8_9","article_processing_charge":"No","conference":{"start_date":"2024-05-26","location":"Zurich, Switzerland","end_date":"2024-05-30","name":"EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques"},"quality_controlled":"1","publisher":"Springer Nature","month":"05","title":"Lower bounds for lattice-based compact functional encryption","scopus_import":"1","department":[{"_id":"KrPi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2024","alternative_title":["LNCS"]}