{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T19:44:43Z","timestamp":1776714283824,"version":"3.51.2"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202437"],"award-info":[{"award-number":["62202437"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271306"],"award-info":[{"award-number":["12271306"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302467"],"award-info":[{"award-number":["62302467"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62201525"],"award-info":[{"award-number":["62201525"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Cryptologic Science Fund of China","doi-asserted-by":"publisher","award":["2025NCSF02018"],"award-info":[{"award-number":["2025NCSF02018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tifs.2025.3639994","type":"journal-article","created":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:41:05Z","timestamp":1764787265000},"page":"17-29","source":"Crossref","is-referenced-by-count":2,"title":["Practical Secure Inference Algorithm for a Fine-Tuned Large Language Model Based on Fully Homomorphic Encryption"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2948-5832","authenticated-orcid":false,"given":"Ruoyan","family":"Zhang","sequence":"first","affiliation":[{"name":"Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6028-1812","authenticated-orcid":false,"given":"Zhongxiang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wankang","family":"Bao","sequence":"additional","affiliation":[{"name":"Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"267","article-title":"The secret sharer: Evaluating and testing unintended memorization in neural networks","volume-title":"Proc. 28th USENIX Secur. Symp.","author":"Carlini"},{"key":"ref2","first-page":"2633","article-title":"Extracting training data from large language models","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Carlini"},{"key":"ref3","volume-title":"Privacy Policy","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2020.3014636"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-acl.277"},{"key":"ref7","first-page":"15718","article-title":"Iron: Private inference on transformers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Hao"},{"key":"ref8","article-title":"BumbleBee: Secure two-party inference framework for large transformers","author":"Lu","year":"2023"},{"issue":"372","key":"ref9","first-page":"1","article-title":"Ciphergpt: Secure two-party gpt inference","volume":"2023","author":"Hou","year":"2023","journal-title":"Cryptol. ePrint Arch."},{"key":"ref10","article-title":"Concrete ML: A privacy-preserving machine learning library using fully homomorphic encryption for data scientists","author":"Meyre","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3340994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3461408"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3643651.3659893"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3455775"},{"key":"ref15","article-title":"PUMA: Secure inference of LLaMA-7B in five minutes","author":"Dong","year":"2023","journal-title":"arXiv:2307.12533"},{"key":"ref16","article-title":"MPC-minimized secure LLM inference","author":"Rathee","year":"2024","journal-title":"arXiv:2408.03561"},{"issue":"503","key":"ref17","first-page":"1","article-title":"Efficient fhe-based privacy-enhanced neural network for AI-as-a-service","volume":"2023","author":"Lam","year":"2023","journal-title":"Cryptol. ePrint Arch."},{"key":"ref18","first-page":"3","article-title":"LoRA: Low-rank adaptation of large language models","volume-title":"Proc. ICLR","author":"Hu"},{"key":"ref19","first-page":"10088","article-title":"Qlora: Efficient finetuning of quantized llms","volume-title":"Proc. 40th Int. Conf. Mach. Learn. (ICML)","author":"Dettmers"},{"key":"ref20","article-title":"Platypus: Quick, cheap, and powerful refinement of LLMs","author":"Lee","year":"2023","journal-title":"arXiv:2308.07317"},{"key":"ref21","article-title":"TX-LLM: A large language model for therapeutics","author":"Chaves","year":"2024","journal-title":"arXiv:2406.06316"},{"key":"ref22","article-title":"Prefix-tuning: Optimizing continuous prompts for generation","author":"Lisa Li","year":"2021","journal-title":"arXiv:2101.00190"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.243"},{"key":"ref24","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Sutskever"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-4012"},{"key":"ref26","article-title":"On databanks and privacy homomorphism","author":"Rivest","year":"1978","journal-title":"Foundations of Secure Computation"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref29","volume-title":"Microsoft SEAL (Release 4.1)","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451000"},{"key":"ref32","article-title":"Improving neural networks by preventing co-adaptation of feature detectors","author":"Hinton","year":"2012","journal-title":"arXiv:1207.0580"},{"key":"ref33","volume-title":"ChatGLM2-6b: An Open Bilingual Chat LLM","year":"2023"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.26"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-demos.38"},{"key":"ref36","volume-title":"Protocol Buffers: Google\u2019s Data Interchange Format","author":"Varda","year":"2008"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3387108"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91107-1_13"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11275869.pdf?arnumber=11275869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:44:56Z","timestamp":1766601896000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11275869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3639994","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}