{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LTRWTPIN7P4YIPWJBWNZS4XIRZ","short_pith_number":"pith:LTRWTPIN","schema_version":"1.0","canonical_sha256":"5ce369bd0dfbf9843ec90d9b9972e88e4538e4caee32192f295dd5f806454306","source":{"kind":"arxiv","id":"0807.4154","version":3},"attestation_state":"computed","paper":{"title":"Universal blind quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Elham Kashefi, Joseph Fitzsimons","submitted_at":"2008-07-25T18:35:00Z","abstract_excerpt":"We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory. The client only needs to be able to prepare single qubits randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, the client and server use two-way classical communication which enables the "},"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":"0807.4154","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-07-25T18:35:00Z","cross_cats_sorted":[],"title_canon_sha256":"7d0490ed5dbcda263fbff2ed0bdbdaa60a0c7a6c07610940b5ada9b2e3c6684b","abstract_canon_sha256":"db74df04f0fdfa18f9201dd57512fab92f4f20a0912490545ba5230e086fe39b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:51.444076Z","signature_b64":"d7lf3ic/n3Pdk+tdZjQ8QfIUpvAYmSb+Y045m1kaiddfuoYY7PLvu/FJutmPPKqIx2Vt8Ogun3MzYfkkw8VdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce369bd0dfbf9843ec90d9b9972e88e4538e4caee32192f295dd5f806454306","last_reissued_at":"2026-05-18T04:01:51.443464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:51.443464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal blind quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Broadbent, Elham Kashefi, Joseph Fitzsimons","submitted_at":"2008-07-25T18:35:00Z","abstract_excerpt":"We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory. The client only needs to be able to prepare single qubits randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, the client and server use two-way classical communication which enables the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.4154","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":""},"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":"0807.4154","created_at":"2026-05-18T04:01:51.443524+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.4154v3","created_at":"2026-05-18T04:01:51.443524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.4154","created_at":"2026-05-18T04:01:51.443524+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTRWTPIN7P4Y","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTRWTPIN7P4YIPWJ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTRWTPIN","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30636","citing_title":"Authentication in Quantum Networks","ref_index":190,"is_internal_anchor":true},{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ","json":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ.json","graph_json":"https://pith.science/api/pith-number/LTRWTPIN7P4YIPWJBWNZS4XIRZ/graph.json","events_json":"https://pith.science/api/pith-number/LTRWTPIN7P4YIPWJBWNZS4XIRZ/events.json","paper":"https://pith.science/paper/LTRWTPIN"},"agent_actions":{"view_html":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ","download_json":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ.json","view_paper":"https://pith.science/paper/LTRWTPIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.4154&json=true","fetch_graph":"https://pith.science/api/pith-number/LTRWTPIN7P4YIPWJBWNZS4XIRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LTRWTPIN7P4YIPWJBWNZS4XIRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ/action/storage_attestation","attest_author":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ/action/author_attestation","sign_citation":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ/action/citation_signature","submit_replication":"https://pith.science/pith/LTRWTPIN7P4YIPWJBWNZS4XIRZ/action/replication_record"}},"created_at":"2026-05-18T04:01:51.443524+00:00","updated_at":"2026-05-18T04:01:51.443524+00:00"}