{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:24:09Z","timestamp":1760059449494,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T00:00:00Z","timestamp":1749859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>We propose a new framework for compile-time ciphertext synthesis in fully homomorphic encryption (FHE) systems. Instead of invoking encryption algorithms at runtime, our method synthesizes ciphertexts from precomputed encrypted basis vectors using only homomorphic additions, scalar multiplications, and randomized encryptions of zero. This decouples ciphertext generation from encryption and enables efficient batch encoding through algebraic reuse. We formalize this technique as a randomized module morphism and prove that it satisfies IND-CPA security. Our proof uses a hybrid game framework that interpolates between encrypted vector instances and reduces the adversarial advantage to the indistinguishability advantage of the underlying FHE scheme. This reduction structure captures the security implications of ciphertext basis reuse and structured noise injection. The proposed synthesis primitive supports fast, encryption-free ingestion in outsourced database systems and other high-throughput FHE pipelines. It is compatible with standard FHE APIs and preserves layout semantics for downstream homomorphic operations.<\/jats:p>","DOI":"10.3390\/cryptography9020044","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T06:40:27Z","timestamp":1750056027000},"page":"44","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compile-Time Fully Homomorphic Encryption: Eliminating Online Encryption via Algebraic Basis Synthesis"],"prefix":"10.3390","volume":"9","author":[{"given":"Dongfang","family":"Zhao","sequence":"first","affiliation":[{"name":"Tacoma School of Engineering and Technology, University of Washington, Seattle, WA 98195, USA"}]}],"member":"1968","published-online":{"date-parts":[[2025,6,14]]},"reference":[{"key":"ref_1","unstructured":"Gentry, C. (June, January 31). Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing (STOC), Bethesda, MD, USA."},{"key":"ref_2","unstructured":"Fan, J., and Vercauteren, F. (2025, June 10). Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Paper 2012\/144. Available online: https:\/\/eprint.iacr.org\/2012\/144."},{"key":"ref_3","first-page":"409","article-title":"Homomorphic Encryption for Arithmetic of Approximate Numbers","volume":"Volume 10624","author":"Takagi","year":"2017","journal-title":"Advances in Cryptology, Proceedings of the ASIACRYPT 2017\u201423rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, 3\u20137 December 2017"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.14778\/3389133.3389144","article-title":"Efficient Confidentiality-Preserving Data Analytics over Symmetrically Encrypted Datasets","volume":"13","author":"Savvides","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kim, A., Polyakov, Y., and Zucca, V. (2021). Revisiting Homomorphic Encryption Schemes for Finite Fields. Advances in Cryptology, Proceedings of the ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, 6\u201310 December 2021, Springer. Proceedings, Part III.","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"ref_6","unstructured":"Tawose, T.O., Dai, J., Yang, L., and Zhao, D. (2023, January 18\u201323). Toward Efficient Homomorphic Encryption for Outsourced Databases through Parallel Caching. Proceedings of the ACM on Management of Data (SIGMOD), Seattle, WA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., and Vaikuntanathan, V. (2012, January 8\u201310). (Leveled) fully homomorphic encryption without bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, MA, USA.","DOI":"10.1145\/2090236.2090262"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z. (2012). Fully homomorphic encryption without modulus switching from classical GapSVP. Advances in Cryptology\u2014CRYPTO 2012, Proceedings of the 32nd International Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2012, Springer. Annual Cryptology Conference.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"ref_9","unstructured":"(2025, June 10). Microsoft SEAL, Available online: https:\/\/github.com\/Microsoft\/SEAL."},{"key":"ref_10","unstructured":"Badawi, A.A., Bates, J., Bergamaschi, F., Cousins, D.B., Erabelli, S., Genise, N., Halevi, S., Hunt, H., Kim, A., and Lee, Y. (2025, June 10). OpenFHE: Open-Source Fully Homomorphic Encryption Library. Cryptology ePrint Archive, Paper 2022\/915. Available online: https:\/\/eprint.iacr.org\/2022\/915."},{"key":"ref_11","unstructured":"Chillotti, I., Gama, N., Georgieva, M., and Izabach\u00e8ne, M. (2025, June 10). TFHE: Fast Fully Homomorphic Encryption over the Torus. Cryptology ePrint Archive, Paper 2018\/421. Available online: https:\/\/eprint.iacr.org\/2018\/421."},{"key":"ref_12","unstructured":"Takeshita, J., Reis, D., Gong, T., Niemier, M., Hu, X.S., and Jung, T. (2023). Accelerating Finite-Field and Torus FHE via Compute-Enabled (S)RAM. IEEE Trans. Comput., 1\u201314."},{"key":"ref_13","unstructured":"Guimar aes, A., Borin, E., and Aranha, D.F. (2025, June 10). MOSFHET: Optimized Software for FHE over the Torus. Cryptology ePrint Archive, Paper 2022\/515. Available online: https:\/\/eprint.iacr.org\/2022\/515."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Geelen, R., Van Beirendonck, M., Pereira, H.V., Huffman, B., McAuley, T., Selfridge, B., Wagner, D., Dimou, G., Verbauwhede, I., and Vercauteren, F. (2022). BASALISC: Programmable asynchronous hardware accelerator for BGV fully homomorphic encryption. arXiv.","DOI":"10.46586\/tches.v2023.i4.32-57"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Blatt, M., Gusev, A., Polyakov, Y., Rohloff, K., and Vaikuntanathan, V. (2020). Optimized homomorphic encryption solution for secure genome-wide association studies. BMC Med. Genom., 13.","DOI":"10.1186\/s12920-020-0719-9"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Boemer, F., Cammarota, R., Demmler, D., Schneider, T., and Yalame, H. (2020, January 25\u201328). MP2ML: A mixed-protocol machine learning framework for private inference. Proceedings of the 15th International Conference on Availability, Reliability and Security, Virtual.","DOI":"10.1145\/3407023.3407045"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Han, B., Kim, Y., Choi, J., Shin, H., and Lee, Y. (2023, January 26). Fully Homomorphic Privacy-Preserving Naive Bayes Machine Learning and Classification. Proceedings of the 11th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC\u201923, Copenhagen, Denmark.","DOI":"10.1145\/3605759.3625262"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1109\/TCSVT.2023.3234278","article-title":"Secure Decentralized Image Classification With Multiparty Homomorphic Encryption","volume":"33","author":"Xu","year":"2023","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_19","unstructured":"Canteaut, A., and Standaert, F.X. (2021). Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys. Advances in Cryptology\u2014EUROCRYPT 2021, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Van Beirendonck, M., D\u2019Anvers, J.P., Turan, F., and Verbauwhede, I. (2023, January 26\u201330). FPT: A Fixed-Point Accelerator for Torus Fully Homomorphic Encryption. Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201923, Copenhagen, Denmark.","DOI":"10.1145\/3576915.3623159"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"246","DOI":"10.2478\/popets-2021-0046","article-title":"Faster homomorphic comparison operations for BGV and BFV","volume":"2021","author":"Iliashenko","year":"2021","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_22","unstructured":"Albrecht, M., Chase, M., Chen, H., Ding, J., Goldwasser, S., Gorbunov, S., Halevi, S., Hoffstein, J., Laine, K., and Lauter, K. (2025, June 10). Homomorphic Encryption Standard. Cryptology ePrint Archive, Paper 2019\/939. Available online: https:\/\/eprint.iacr.org\/2019\/939."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2535925","article-title":"On Ideal Lattices and Learning with Errors over Rings","volume":"60","author":"Lyubashevsky","year":"2013","journal-title":"J. ACM"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"101300","DOI":"10.1016\/j.iot.2024.101300","article-title":"Deep Image: A precious image based deep learning method for online malware detection in IoT environment","volume":"27","author":"Ghahramani","year":"2024","journal-title":"Internet Things"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"114","DOI":"10.46586\/tches.v2021.i4.114-148","article-title":"Over 100\u00d7 Faster Bootstrapping in Fully Homomorphic Encryption Through Memory-Centric Optimization with GPUs","volume":"2021","author":"Jung","year":"2021","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Tan, S., Knott, B., Tian, Y., and Wu, D.J. (2021, January 24\u201327). CryptGPU: Fast Privacy-Preserving Machine Learning on the GPU. Proceedings of the IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP40001.2021.00098"},{"key":"ref_27","unstructured":"(2025, June 10). cuFHE: CUDA-Accelerated Fully Homomorphic Encryption Library. Available online: https:\/\/github.com\/vernamlab\/cuFHE."},{"key":"ref_28","unstructured":"(2025, June 10). NuFHE, a GPU-Powered Torus FHE Implementation. Available online: https:\/\/nufhe.readthedocs.io\/en\/latest\/."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhang, H., Fan, S., Lu, H., Zhang, M., and Li, X. (March, January 25). Poseidon: Practical Homomorphic Encryption Accelerator. Proceedings of the 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA), Montreal, QC, Canada.","DOI":"10.1109\/HPCA56546.2023.10070984"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Samardzic, N., Feldmann, A., Krastev, A., Devadas, S., Dreslinski, R., Peikert, C., and Sanchez, D. (2021). F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption. MICRO-54, Proceedings of the 54th Annual IEEE\/ACM International Symposium on Microarchitecture, Virtual, 18\u201322 Ocotber 2021, ACM.","DOI":"10.1145\/3466752.3480070"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Kim, S., Kim, J., Kim, M., Jung, W., Kim, J., Rhu, M., and Ahn, J. (2022, January 18\u201322). BTS: An Accelerator for Bootstrappable Fully Homomorphic Encryption. Proceedings of the 49th Annual International Symposium on Computer Architecture (ISCA), New York, NY, USA.","DOI":"10.1145\/3470496.3527415"},{"key":"ref_32","unstructured":"Samardzic, N., Feldmann, A., Krastev, A., Manohar, N., Genise, N., Devadas, S., Eldefrawy, K., Peikert, C., and Sanchez, D. (2022, January 18\u201322). CraterLake: A Hardware Accelerator for Efficient Unbounded Computation on Encrypted Data. Proceedings of the International Symposium on Computer Architecture (ISCA), New York, NY, USA."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/44\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:51:59Z","timestamp":1760032319000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,14]]},"references-count":32,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["cryptography9020044"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9020044","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2025,6,14]]}}}