{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:OAK6IQX5FFETS7TFF44KSL6DFJ","short_pith_number":"pith:OAK6IQX5","schema_version":"1.0","canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","source":{"kind":"arxiv","id":"quant-ph/0403069","version":6},"attestation_state":"computed","paper":{"title":"Computational Indistinguishability between Quantum States and Its Cryptographic Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Harumichi Nishimura, Takeshi Koshiba, Tomoyuki Yamakami","submitted_at":"2004-03-09T09:58:11Z","abstract_excerpt":"We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is \"secure\" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic inter"},"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":"quant-ph/0403069","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0c05892949fc438ae662a4d3cc11a6c588f55bb64195f4ed63bb3f1549331b62","abstract_canon_sha256":"88d202dc3774d79584e418fb764b2fbf3423d0e0ff40d5d6602bdc28e75efe20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.605796Z","signature_b64":"icyxTmlYCynBGUq24p+AXvPNwGoHtz3/J6AU/jSXgoF9OtPsv2mb7BSz6CCWZUBmmNlVHkbwhjyVStcMdZblAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","last_reissued_at":"2026-05-18T01:13:45.605066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.605066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Indistinguishability between Quantum States and Its Cryptographic Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Harumichi Nishimura, Takeshi Koshiba, Tomoyuki Yamakami","submitted_at":"2004-03-09T09:58:11Z","abstract_excerpt":"We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is \"secure\" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403069","kind":"arxiv","version":6},"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":"quant-ph/0403069","created_at":"2026-05-18T01:13:45.605177+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403069v6","created_at":"2026-05-18T01:13:45.605177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403069","created_at":"2026-05-18T01:13:45.605177+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAK6IQX5FFET","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAK6IQX5FFETS7TF","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAK6IQX5","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ","json":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ.json","graph_json":"https://pith.science/api/pith-number/OAK6IQX5FFETS7TFF44KSL6DFJ/graph.json","events_json":"https://pith.science/api/pith-number/OAK6IQX5FFETS7TFF44KSL6DFJ/events.json","paper":"https://pith.science/paper/OAK6IQX5"},"agent_actions":{"view_html":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ","download_json":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ.json","view_paper":"https://pith.science/paper/OAK6IQX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0403069&json=true","fetch_graph":"https://pith.science/api/pith-number/OAK6IQX5FFETS7TFF44KSL6DFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OAK6IQX5FFETS7TFF44KSL6DFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/action/storage_attestation","attest_author":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/action/author_attestation","sign_citation":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/action/citation_signature","submit_replication":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/action/replication_record"}},"created_at":"2026-05-18T01:13:45.605177+00:00","updated_at":"2026-05-18T01:13:45.605177+00:00"}