{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YRU4DHEDX3FYCWHZFEFWKMLGOE","short_pith_number":"pith:YRU4DHED","schema_version":"1.0","canonical_sha256":"c469c19c83becb8158f9290b653166710b7e248986d75d53e33cb1e1325683ec","source":{"kind":"arxiv","id":"1602.01771","version":1},"attestation_state":"computed","paper":{"title":"On Quantum Obfuscation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Gorjan Alagic","submitted_at":"2016-02-04T18:10:59Z","abstract_excerpt":"Encryption of data is fundamental to secure communication in the modern world. Beyond encryption of data lies obfuscation, i.e., encryption of functionality. It is well-known that the most powerful means of obfuscating classical programs, so-called ``black-box obfuscation',' is provably impossible [Barak et al '12]. However, several recent results have yielded candidate schemes that satisfy a definition weaker than black-box, and yet still have numerous applications.\n  In this work, we initialize the rigorous study of obfuscating programs via quantum-mechanical means. We define notions of quan"},"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":"1602.01771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-04T18:10:59Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"8e013c901875d27e45232c4e7991664705f44144280131b93660216ae8304346","abstract_canon_sha256":"aaf249c73e18f349d53e069e27aaac66baeab03e2ba82634176320276263abef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.152975Z","signature_b64":"+3EPIQ8PcCZ9oQE5qtf1BZ32YcVd7nvqFdYLB6E1iSiWUK6lEjF4yZaE6lZgODv6fCRaLTkwoYwJ5RU973uNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c469c19c83becb8158f9290b653166710b7e248986d75d53e33cb1e1325683ec","last_reissued_at":"2026-05-18T01:21:18.152454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.152454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quantum Obfuscation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Bill Fefferman, Gorjan Alagic","submitted_at":"2016-02-04T18:10:59Z","abstract_excerpt":"Encryption of data is fundamental to secure communication in the modern world. Beyond encryption of data lies obfuscation, i.e., encryption of functionality. It is well-known that the most powerful means of obfuscating classical programs, so-called ``black-box obfuscation',' is provably impossible [Barak et al '12]. However, several recent results have yielded candidate schemes that satisfy a definition weaker than black-box, and yet still have numerous applications.\n  In this work, we initialize the rigorous study of obfuscating programs via quantum-mechanical means. We define notions of quan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01771","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":"1602.01771","created_at":"2026-05-18T01:21:18.152532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01771v1","created_at":"2026-05-18T01:21:18.152532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01771","created_at":"2026-05-18T01:21:18.152532+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRU4DHEDX3FY","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRU4DHEDX3FYCWHZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRU4DHED","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"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":25,"is_internal_anchor":true},{"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":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE","json":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE.json","graph_json":"https://pith.science/api/pith-number/YRU4DHEDX3FYCWHZFEFWKMLGOE/graph.json","events_json":"https://pith.science/api/pith-number/YRU4DHEDX3FYCWHZFEFWKMLGOE/events.json","paper":"https://pith.science/paper/YRU4DHED"},"agent_actions":{"view_html":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE","download_json":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE.json","view_paper":"https://pith.science/paper/YRU4DHED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01771&json=true","fetch_graph":"https://pith.science/api/pith-number/YRU4DHEDX3FYCWHZFEFWKMLGOE/graph.json","fetch_events":"https://pith.science/api/pith-number/YRU4DHEDX3FYCWHZFEFWKMLGOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE/action/storage_attestation","attest_author":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE/action/author_attestation","sign_citation":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE/action/citation_signature","submit_replication":"https://pith.science/pith/YRU4DHEDX3FYCWHZFEFWKMLGOE/action/replication_record"}},"created_at":"2026-05-18T01:21:18.152532+00:00","updated_at":"2026-05-18T01:21:18.152532+00:00"}