{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YOO2TKHSCUBKRVCJF3L7RRVZEK","short_pith_number":"pith:YOO2TKHS","schema_version":"1.0","canonical_sha256":"c39da9a8f21502a8d4492ed7f8c6b922a5f6232bb58d48ee6b96437ba4e181c5","source":{"kind":"arxiv","id":"2412.03550","version":2},"attestation_state":"computed","paper":{"title":"Teaching an Old Dog New Tricks: Verifiable FHE Using Commodity Hardware","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Aamer Jaleel, Edward Suh, Fisher Jepsen, Gururaj Saileshwar, Jules Drean, Srini Devadas","submitted_at":"2024-12-04T18:47:11Z","abstract_excerpt":"We present Argos, a simple approach for adding verifiability to fully homomorphic encryption (FHE) schemes using trusted hardware. Traditional approaches to verifiable FHE require expensive cryptographic proofs, which incur an overhead of up to seven orders of magnitude on top of FHE, making them impractical.\n  With Argos, we show that trusted hardware can be securely used to provide verifiability for FHE computations, with minimal overhead relative to the baseline FHE computation. An important contribution of Argos is showing that the major security pitfall associated with trusted hardware, m"},"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":"2412.03550","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-12-04T18:47:11Z","cross_cats_sorted":[],"title_canon_sha256":"d3c9580ded3edba4bff92007caae77af6374adfd6c8cd1a464b9c3fa86f8a9f4","abstract_canon_sha256":"edc07b66b50d467e3e1ee66511e23b62e52ccfeac08d65141ccafc5149a2c936"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:22.169603Z","signature_b64":"cZgExb1Z0i9lUjOnbwBvBVL2ZN1On4YrLNgxodP2Re5pAi5r3YOYhs1Pv1iCaERXHsy5aWAPw+Jp1w1s8UcdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c39da9a8f21502a8d4492ed7f8c6b922a5f6232bb58d48ee6b96437ba4e181c5","last_reissued_at":"2026-07-05T10:38:22.169148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:22.169148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Teaching an Old Dog New Tricks: Verifiable FHE Using Commodity Hardware","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Aamer Jaleel, Edward Suh, Fisher Jepsen, Gururaj Saileshwar, Jules Drean, Srini Devadas","submitted_at":"2024-12-04T18:47:11Z","abstract_excerpt":"We present Argos, a simple approach for adding verifiability to fully homomorphic encryption (FHE) schemes using trusted hardware. Traditional approaches to verifiable FHE require expensive cryptographic proofs, which incur an overhead of up to seven orders of magnitude on top of FHE, making them impractical.\n  With Argos, we show that trusted hardware can be securely used to provide verifiability for FHE computations, with minimal overhead relative to the baseline FHE computation. An important contribution of Argos is showing that the major security pitfall associated with trusted hardware, m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03550","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/2412.03550/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":"2412.03550","created_at":"2026-07-05T10:38:22.169204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03550v2","created_at":"2026-07-05T10:38:22.169204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03550","created_at":"2026-07-05T10:38:22.169204+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOO2TKHSCUBK","created_at":"2026-07-05T10:38:22.169204+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOO2TKHSCUBKRVCJ","created_at":"2026-07-05T10:38:22.169204+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOO2TKHS","created_at":"2026-07-05T10:38:22.169204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.12364","citing_title":"Tyche: Composable Isolation as a Foundation to Manage Trust in the Cloud","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK","json":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK.json","graph_json":"https://pith.science/api/pith-number/YOO2TKHSCUBKRVCJF3L7RRVZEK/graph.json","events_json":"https://pith.science/api/pith-number/YOO2TKHSCUBKRVCJF3L7RRVZEK/events.json","paper":"https://pith.science/paper/YOO2TKHS"},"agent_actions":{"view_html":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK","download_json":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK.json","view_paper":"https://pith.science/paper/YOO2TKHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03550&json=true","fetch_graph":"https://pith.science/api/pith-number/YOO2TKHSCUBKRVCJF3L7RRVZEK/graph.json","fetch_events":"https://pith.science/api/pith-number/YOO2TKHSCUBKRVCJF3L7RRVZEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK/action/storage_attestation","attest_author":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK/action/author_attestation","sign_citation":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK/action/citation_signature","submit_replication":"https://pith.science/pith/YOO2TKHSCUBKRVCJF3L7RRVZEK/action/replication_record"}},"created_at":"2026-07-05T10:38:22.169204+00:00","updated_at":"2026-07-05T10:38:22.169204+00:00"}