{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ATDBNGD6VRJXLFWIDOB4CCVGK6","short_pith_number":"pith:ATDBNGD6","schema_version":"1.0","canonical_sha256":"04c616987eac537596c81b83c10aa657b572625eda789a8544fb005ced3d0b6b","source":{"kind":"arxiv","id":"2201.13445","version":2},"attestation_state":"computed","paper":{"title":"Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Alexandru Gheorghiu, Tony Metger","submitted_at":"2022-01-31T18:56:31Z","abstract_excerpt":"Quantum mechanical effects have enabled the construction of cryptographic primitives that are impossible classically. For example, quantum copy-protection allows for a program to be encoded in a quantum state in such a way that the program can be evaluated, but not copied. Many of these cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. In this work, we show how such protocols can generically be converted to ones where Alice is fully classical, assum"},"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":"2201.13445","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-01-31T18:56:31Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"32ad3a0066ccc80bf947a96a624b0134e3cc6eafb13cf51786202af49f429772","abstract_canon_sha256":"4868ef4760de93b60cf20338b5270cc5487c422f8bb9596999ba2a2b509d6d58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:54:50.735888Z","signature_b64":"uJ0ZCO0Zb6GenZNaDCGic1mgn2PRBHgN5xFY8ChczVkkH5WYCrVc0OHu8MMJk06ub6lv7G3mQ3IvO8Eq3Ht4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c616987eac537596c81b83c10aa657b572625eda789a8544fb005ced3d0b6b","last_reissued_at":"2026-07-05T04:54:50.735452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:54:50.735452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Alexandru Gheorghiu, Tony Metger","submitted_at":"2022-01-31T18:56:31Z","abstract_excerpt":"Quantum mechanical effects have enabled the construction of cryptographic primitives that are impossible classically. For example, quantum copy-protection allows for a program to be encoded in a quantum state in such a way that the program can be evaluated, but not copied. Many of these cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. In this work, we show how such protocols can generically be converted to ones where Alice is fully classical, assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13445","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/2201.13445/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":"2201.13445","created_at":"2026-07-05T04:54:50.735507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.13445v2","created_at":"2026-07-05T04:54:50.735507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13445","created_at":"2026-07-05T04:54:50.735507+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATDBNGD6VRJX","created_at":"2026-07-05T04:54:50.735507+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATDBNGD6VRJXLFWI","created_at":"2026-07-05T04:54:50.735507+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATDBNGD6","created_at":"2026-07-05T04:54:50.735507+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02986","citing_title":"Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02986","citing_title":"Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6","json":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6.json","graph_json":"https://pith.science/api/pith-number/ATDBNGD6VRJXLFWIDOB4CCVGK6/graph.json","events_json":"https://pith.science/api/pith-number/ATDBNGD6VRJXLFWIDOB4CCVGK6/events.json","paper":"https://pith.science/paper/ATDBNGD6"},"agent_actions":{"view_html":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6","download_json":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6.json","view_paper":"https://pith.science/paper/ATDBNGD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.13445&json=true","fetch_graph":"https://pith.science/api/pith-number/ATDBNGD6VRJXLFWIDOB4CCVGK6/graph.json","fetch_events":"https://pith.science/api/pith-number/ATDBNGD6VRJXLFWIDOB4CCVGK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6/action/storage_attestation","attest_author":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6/action/author_attestation","sign_citation":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6/action/citation_signature","submit_replication":"https://pith.science/pith/ATDBNGD6VRJXLFWIDOB4CCVGK6/action/replication_record"}},"created_at":"2026-07-05T04:54:50.735507+00:00","updated_at":"2026-07-05T04:54:50.735507+00:00"}