{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CY2LJMK46WUHDVM2742IZOGNDG","short_pith_number":"pith:CY2LJMK4","schema_version":"1.0","canonical_sha256":"1634b4b15cf5a871d59aff348cb8cd198d4de2075494def5f17c02c0db95f979","source":{"kind":"arxiv","id":"1809.08719","version":1},"attestation_state":"computed","paper":{"title":"Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael Newman","submitted_at":"2018-09-24T01:47:03Z","abstract_excerpt":"In this brief note, we review and extend existing limitations on information-theoretically (IT) secure quantum fully homomorphic encryption (QFHE). The essential ingredient remains Nayak's bound, which provides a tradeoff between the number of homomorphically implementable functions of an IT-secure QHE scheme and its efficiency. Importantly, the bound is robust to imperfect IT-security guarantees. We summarize these bounds in the context of existing QHE schemes, and discuss subtleties of the imposed restrictions."},"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":"1809.08719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-09-24T01:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"6ab320d8c2960223e404c8a81b2ec2d07e78b04a8a009f6b484a38c6aceccea4","abstract_canon_sha256":"95ac6356fcf78a1b1bd7961d72ab8934299148a92a371689883ec0575ab25895"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:03.755537Z","signature_b64":"hC46pGxWguDzWtq8TZxMnjOC05NbtPq4wAs7qUcIlnrhdEbOgk3vZx/uS8cyjUNxrLauxz9RNzaIrMeeSpF5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1634b4b15cf5a871d59aff348cb8cd198d4de2075494def5f17c02c0db95f979","last_reissued_at":"2026-05-18T00:05:03.755132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:03.755132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael Newman","submitted_at":"2018-09-24T01:47:03Z","abstract_excerpt":"In this brief note, we review and extend existing limitations on information-theoretically (IT) secure quantum fully homomorphic encryption (QFHE). The essential ingredient remains Nayak's bound, which provides a tradeoff between the number of homomorphically implementable functions of an IT-secure QHE scheme and its efficiency. Importantly, the bound is robust to imperfect IT-security guarantees. We summarize these bounds in the context of existing QHE schemes, and discuss subtleties of the imposed restrictions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08719","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1809.08719","created_at":"2026-05-18T00:05:03.755197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08719v1","created_at":"2026-05-18T00:05:03.755197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08719","created_at":"2026-05-18T00:05:03.755197+00:00"},{"alias_kind":"pith_short_12","alias_value":"CY2LJMK46WUH","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CY2LJMK46WUHDVM2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CY2LJMK4","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05584","citing_title":"Quantum preprocessing for information-theoretic security in two-party computation","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG","json":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG.json","graph_json":"https://pith.science/api/pith-number/CY2LJMK46WUHDVM2742IZOGNDG/graph.json","events_json":"https://pith.science/api/pith-number/CY2LJMK46WUHDVM2742IZOGNDG/events.json","paper":"https://pith.science/paper/CY2LJMK4"},"agent_actions":{"view_html":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG","download_json":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG.json","view_paper":"https://pith.science/paper/CY2LJMK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08719&json=true","fetch_graph":"https://pith.science/api/pith-number/CY2LJMK46WUHDVM2742IZOGNDG/graph.json","fetch_events":"https://pith.science/api/pith-number/CY2LJMK46WUHDVM2742IZOGNDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG/action/storage_attestation","attest_author":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG/action/author_attestation","sign_citation":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG/action/citation_signature","submit_replication":"https://pith.science/pith/CY2LJMK46WUHDVM2742IZOGNDG/action/replication_record"}},"created_at":"2026-05-18T00:05:03.755197+00:00","updated_at":"2026-05-18T00:05:03.755197+00:00"}