{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C77LSJ337PSG3RHMQDTC3JCHL6","short_pith_number":"pith:C77LSJ33","schema_version":"1.0","canonical_sha256":"17feb9277bfbe46dc4ec80e62da4475f9dd43474437cadc8b37fcbc988673ce0","source":{"kind":"arxiv","id":"1703.03754","version":1},"attestation_state":"computed","paper":{"title":"The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Luka Music, Petros Wallden","submitted_at":"2017-03-10T16:37:24Z","abstract_excerpt":"The application and analysis of the Cut-and-Choose technique in protocols secure against quantum adversaries is not a straightforward transposition of the classical case, among other reasons due to the difficulty to use rewinding in the quantum realm. We introduce a Quantum Computation Cut-and-Choose (QC-CC) technique which is a generalisation of the classical Cut-and-Choose in order to build quantum protocols secure against quantum covert adversaries. Such adversaries can deviate arbitrarily provided that their deviation is not detected. As an application of the QC-CC we give a protocol for s"},"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":"1703.03754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-03-10T16:37:24Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e3b438eb8876021a3c7c0e48250a129b356bfa06b7e1e7da69366c97c63172ac","abstract_canon_sha256":"37c75c3a24a34b1e9a3d347f787b062efc86ae58a77979d143639413fff2411b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:53.052894Z","signature_b64":"xMd5IlwRH0/Iug/isMHUb1nwnA7kZscy9Gl+L/gF+9I0R7KAbyfJM0yU6q8Jh89q8Ac5T6MyiXfRhJ8zYNWwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17feb9277bfbe46dc4ec80e62da4475f9dd43474437cadc8b37fcbc988673ce0","last_reissued_at":"2026-05-18T00:48:53.052297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:53.052297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Luka Music, Petros Wallden","submitted_at":"2017-03-10T16:37:24Z","abstract_excerpt":"The application and analysis of the Cut-and-Choose technique in protocols secure against quantum adversaries is not a straightforward transposition of the classical case, among other reasons due to the difficulty to use rewinding in the quantum realm. We introduce a Quantum Computation Cut-and-Choose (QC-CC) technique which is a generalisation of the classical Cut-and-Choose in order to build quantum protocols secure against quantum covert adversaries. Such adversaries can deviate arbitrarily provided that their deviation is not detected. As an application of the QC-CC we give a protocol for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03754","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":"1703.03754","created_at":"2026-05-18T00:48:53.052412+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03754v1","created_at":"2026-05-18T00:48:53.052412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03754","created_at":"2026-05-18T00:48:53.052412+00:00"},{"alias_kind":"pith_short_12","alias_value":"C77LSJ337PSG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C77LSJ337PSG3RHM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C77LSJ33","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21988","citing_title":"Unifying communication paradigms in measurement-based delegated quantum computing","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6","json":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6.json","graph_json":"https://pith.science/api/pith-number/C77LSJ337PSG3RHMQDTC3JCHL6/graph.json","events_json":"https://pith.science/api/pith-number/C77LSJ337PSG3RHMQDTC3JCHL6/events.json","paper":"https://pith.science/paper/C77LSJ33"},"agent_actions":{"view_html":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6","download_json":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6.json","view_paper":"https://pith.science/paper/C77LSJ33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03754&json=true","fetch_graph":"https://pith.science/api/pith-number/C77LSJ337PSG3RHMQDTC3JCHL6/graph.json","fetch_events":"https://pith.science/api/pith-number/C77LSJ337PSG3RHMQDTC3JCHL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6/action/storage_attestation","attest_author":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6/action/author_attestation","sign_citation":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6/action/citation_signature","submit_replication":"https://pith.science/pith/C77LSJ337PSG3RHMQDTC3JCHL6/action/replication_record"}},"created_at":"2026-05-18T00:48:53.052412+00:00","updated_at":"2026-05-18T00:48:53.052412+00:00"}