{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CU62JVTEIVWWCAQAN4J7QLNXFX","short_pith_number":"pith:CU62JVTE","schema_version":"1.0","canonical_sha256":"153da4d664456d6102006f13f82db72ddd48e2e4c98cf3472dab7a921bacb1e3","source":{"kind":"arxiv","id":"2305.18396","version":3},"attestation_state":"computed","paper":{"title":"LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Xuanqi Liu, Zhuotao Liu","submitted_at":"2023-05-28T13:08:13Z","abstract_excerpt":"The community explored to build private inference frameworks for transformer-based large language models (LLMs) in a server-client setting, where the server holds the model parameters and the client inputs its private data (or prompt) for inference. However, these frameworks impose significant overhead when the private inputs are forward propagated through the original LLMs. In this paper, we show that substituting the computation- and communication-heavy operators in the transformer architecture with privacy-computing friendly approximations can greatly reduce the private inference costs whil"},"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":"2305.18396","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T13:08:13Z","cross_cats_sorted":["cs.CL","cs.CR"],"title_canon_sha256":"2d0a351c2b54dbe945b1c6ef93ad0e4ceaf5302b54cade3a3223a698ca8a4e77","abstract_canon_sha256":"dbe0aaae3549aa0a8d4fd9c999303a7098f40bebdc7b3cc966bb6473b778f966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:24:19.330883Z","signature_b64":"EjQWU84o8n/GtaXdUi/nnsp7aflM8+7mLan3aRvvhP8S3gmYm6j2RUeIS6/nMiNyQD3yh3p7MQdeVelaXMrIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153da4d664456d6102006f13f82db72ddd48e2e4c98cf3472dab7a921bacb1e3","last_reissued_at":"2026-07-05T07:24:19.330402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:24:19.330402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMs Can Understand Encrypted Prompt: Towards Privacy-Computing Friendly Transformers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.CR"],"primary_cat":"cs.LG","authors_text":"Xuanqi Liu, Zhuotao Liu","submitted_at":"2023-05-28T13:08:13Z","abstract_excerpt":"The community explored to build private inference frameworks for transformer-based large language models (LLMs) in a server-client setting, where the server holds the model parameters and the client inputs its private data (or prompt) for inference. However, these frameworks impose significant overhead when the private inputs are forward propagated through the original LLMs. In this paper, we show that substituting the computation- and communication-heavy operators in the transformer architecture with privacy-computing friendly approximations can greatly reduce the private inference costs whil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18396","kind":"arxiv","version":3},"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/2305.18396/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":"2305.18396","created_at":"2026-07-05T07:24:19.330456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18396v3","created_at":"2026-07-05T07:24:19.330456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18396","created_at":"2026-07-05T07:24:19.330456+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU62JVTEIVWW","created_at":"2026-07-05T07:24:19.330456+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU62JVTEIVWWCAQA","created_at":"2026-07-05T07:24:19.330456+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU62JVTE","created_at":"2026-07-05T07:24:19.330456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05004","citing_title":"SharedRequest: Privacy-Preserving Model-Agnostic Inference for Large Language Models","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2401.00870","citing_title":"ConfusionPrompt: Practical Private Inference for Online Large Language Models","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2410.09457","citing_title":"Power-Softmax: Towards Secure LLM Inference over Encrypted Data","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX","json":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX.json","graph_json":"https://pith.science/api/pith-number/CU62JVTEIVWWCAQAN4J7QLNXFX/graph.json","events_json":"https://pith.science/api/pith-number/CU62JVTEIVWWCAQAN4J7QLNXFX/events.json","paper":"https://pith.science/paper/CU62JVTE"},"agent_actions":{"view_html":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX","download_json":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX.json","view_paper":"https://pith.science/paper/CU62JVTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18396&json=true","fetch_graph":"https://pith.science/api/pith-number/CU62JVTEIVWWCAQAN4J7QLNXFX/graph.json","fetch_events":"https://pith.science/api/pith-number/CU62JVTEIVWWCAQAN4J7QLNXFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX/action/storage_attestation","attest_author":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX/action/author_attestation","sign_citation":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX/action/citation_signature","submit_replication":"https://pith.science/pith/CU62JVTEIVWWCAQAN4J7QLNXFX/action/replication_record"}},"created_at":"2026-07-05T07:24:19.330456+00:00","updated_at":"2026-07-05T07:24:19.330456+00:00"}