{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CA3AMI7F6PF2XENFHSEYASBC5X","short_pith_number":"pith:CA3AMI7F","schema_version":"1.0","canonical_sha256":"10360623e5f3cbab91a53c89804822edcea4b3f314fa8f2d5ed9f5da3d89ee72","source":{"kind":"arxiv","id":"2501.01672","version":2},"attestation_state":"computed","paper":{"title":"Practical Secure Inference Algorithm for Fine-tuned Large Language Model Based on Fully Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bao Wankang, Zhang Ruoyan, Zheng Zhongxiang","submitted_at":"2025-01-03T07:19:23Z","abstract_excerpt":"Large language models(LLMs) are currently at the forefront of the machine learning field, which show a broad application prospect but at the same time expose some risks of privacy leakage. We combined Fully Homomorphic Encryption(FHE) and provable security theory with Parameter-Efficient Fine-Tuning(PEFT) to propose an efficient and secure inference scheme for LLMs. More specially, we focus on pre-trained LLMs which rely on open-sourced base model and then fine-tuned with the private datasets by LoRA. This is a popular road-map for Vertical Domain Models such as LawGPT and BenTsao. We use two "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.01672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-01-03T07:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"092216bc60bbdcce8de440338b1ed696bffc9bcd4497fca3f842b2e855c7a95b","abstract_canon_sha256":"05b18b4e428b943a983c3b8254fa7575075a666f39bd5c0f11400a80a300e00c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:50.210721Z","signature_b64":"v5oAaL1rNpKPatYr7mNxtB7PqXIxMthmTHcLWiWE+ZAT/RmaIfAfTyxCbubJ5+XUsx2jg1vyatI3/cNfPBEwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10360623e5f3cbab91a53c89804822edcea4b3f314fa8f2d5ed9f5da3d89ee72","last_reissued_at":"2026-07-05T09:57:50.210225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:50.210225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Secure Inference Algorithm for Fine-tuned Large Language Model Based on Fully Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Bao Wankang, Zhang Ruoyan, Zheng Zhongxiang","submitted_at":"2025-01-03T07:19:23Z","abstract_excerpt":"Large language models(LLMs) are currently at the forefront of the machine learning field, which show a broad application prospect but at the same time expose some risks of privacy leakage. We combined Fully Homomorphic Encryption(FHE) and provable security theory with Parameter-Efficient Fine-Tuning(PEFT) to propose an efficient and secure inference scheme for LLMs. More specially, we focus on pre-trained LLMs which rely on open-sourced base model and then fine-tuned with the private datasets by LoRA. This is a popular road-map for Vertical Domain Models such as LawGPT and BenTsao. We use two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01672","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.01672/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.01672","created_at":"2026-07-05T09:57:50.210287+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.01672v2","created_at":"2026-07-05T09:57:50.210287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01672","created_at":"2026-07-05T09:57:50.210287+00:00"},{"alias_kind":"pith_short_12","alias_value":"CA3AMI7F6PF2","created_at":"2026-07-05T09:57:50.210287+00:00"},{"alias_kind":"pith_short_16","alias_value":"CA3AMI7F6PF2XENF","created_at":"2026-07-05T09:57:50.210287+00:00"},{"alias_kind":"pith_short_8","alias_value":"CA3AMI7F","created_at":"2026-07-05T09:57:50.210287+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12699","citing_title":"SoK: The Privacy Paradox of Large Language Models: Advancements, Privacy Risks, and Mitigation","ref_index":100,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X","json":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X.json","graph_json":"https://pith.science/api/pith-number/CA3AMI7F6PF2XENFHSEYASBC5X/graph.json","events_json":"https://pith.science/api/pith-number/CA3AMI7F6PF2XENFHSEYASBC5X/events.json","paper":"https://pith.science/paper/CA3AMI7F"},"agent_actions":{"view_html":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X","download_json":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X.json","view_paper":"https://pith.science/paper/CA3AMI7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.01672&json=true","fetch_graph":"https://pith.science/api/pith-number/CA3AMI7F6PF2XENFHSEYASBC5X/graph.json","fetch_events":"https://pith.science/api/pith-number/CA3AMI7F6PF2XENFHSEYASBC5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X/action/storage_attestation","attest_author":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X/action/author_attestation","sign_citation":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X/action/citation_signature","submit_replication":"https://pith.science/pith/CA3AMI7F6PF2XENFHSEYASBC5X/action/replication_record"}},"created_at":"2026-07-05T09:57:50.210287+00:00","updated_at":"2026-07-05T09:57:50.210287+00:00"}