{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TZLENI2S4Q3J3XZKV5HXLKYRSO","short_pith_number":"pith:TZLENI2S","schema_version":"1.0","canonical_sha256":"9e5646a352e4369ddf2aaf4f75ab1193808f494045735b9795f2e3d55e706df3","source":{"kind":"arxiv","id":"1301.3662","version":3},"attestation_state":"computed","paper":{"title":"Composable security of delegated quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher Portmann, Joseph F. Fitzsimons, Renato Renner, Vedran Dunjko","submitted_at":"2013-01-16T11:44:30Z","abstract_excerpt":"Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness---the computation is hidden from the server---and those that are also verifiable---the client can check"},"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":"1301.3662","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-16T11:44:30Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"f9606e1e5d8b35a75b5c7bad65398e390772c507af1b4edd607f7aaee756d607","abstract_canon_sha256":"796ccddbd0d9a5ecf5d223ea1e183a1bbcf502b99a41a29ae7a40c2a16e1a6ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:59.518341Z","signature_b64":"VhauxYqe6H2755viqxa31j9y6cnKW+oidopErkEyL1ZvOrpFUw2qzKVTfd4g3mcQSOE4WqSrrstJvZpUzYx6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5646a352e4369ddf2aaf4f75ab1193808f494045735b9795f2e3d55e706df3","last_reissued_at":"2026-05-18T01:34:59.517754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:59.517754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composable security of delegated quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher Portmann, Joseph F. Fitzsimons, Renato Renner, Vedran Dunjko","submitted_at":"2013-01-16T11:44:30Z","abstract_excerpt":"Delegating difficult computations to remote large computation facilities, with appropriate security guarantees, is a possible solution for the ever-growing needs of personal computing power. For delegated computation protocols to be usable in a larger context---or simply to securely run two protocols in parallel---the security definitions need to be composable. Here, we define composable security for delegated quantum computation. We distinguish between protocols which provide only blindness---the computation is hidden from the server---and those that are also verifiable---the client can check"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3662","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":"1301.3662","created_at":"2026-05-18T01:34:59.517844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3662v3","created_at":"2026-05-18T01:34:59.517844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3662","created_at":"2026-05-18T01:34:59.517844+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZLENI2S4Q3J","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZLENI2S4Q3J3XZK","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZLENI2S","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.01998","citing_title":"Partially-Blind Single-Qubit Classification over a Prototype Hybrid Quantum Network","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO","json":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO.json","graph_json":"https://pith.science/api/pith-number/TZLENI2S4Q3J3XZKV5HXLKYRSO/graph.json","events_json":"https://pith.science/api/pith-number/TZLENI2S4Q3J3XZKV5HXLKYRSO/events.json","paper":"https://pith.science/paper/TZLENI2S"},"agent_actions":{"view_html":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO","download_json":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO.json","view_paper":"https://pith.science/paper/TZLENI2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3662&json=true","fetch_graph":"https://pith.science/api/pith-number/TZLENI2S4Q3J3XZKV5HXLKYRSO/graph.json","fetch_events":"https://pith.science/api/pith-number/TZLENI2S4Q3J3XZKV5HXLKYRSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO/action/storage_attestation","attest_author":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO/action/author_attestation","sign_citation":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO/action/citation_signature","submit_replication":"https://pith.science/pith/TZLENI2S4Q3J3XZKV5HXLKYRSO/action/replication_record"}},"created_at":"2026-05-18T01:34:59.517844+00:00","updated_at":"2026-05-18T01:34:59.517844+00:00"}