{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:SPSLB225CRIHPBDKJ223JONW5G","short_pith_number":"pith:SPSLB225","schema_version":"1.0","canonical_sha256":"93e4b0eb5d145077846a4eb5b4b9b6e980d1f69754a8f39c313e9070e84f7a0b","source":{"kind":"arxiv","id":"quant-ph/0207158","version":1},"attestation_state":"computed","paper":{"title":"Non-Interactive Quantum Statistical and Perfect Zero-Knowledge","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Hirotada Kobayashi","submitted_at":"2002-07-29T10:22:34Z","abstract_excerpt":"This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph"},"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/0207158","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-29T10:22:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b9f8c5568ff7231d93ad169f01c842415128cb6b9686ba2cab72a43edcc6b962","abstract_canon_sha256":"6c326bff3716510ceece7fb785acf104fbae4026e66ce01a378fe17decb85795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:59.319149Z","signature_b64":"6MHlCmgT2LjINiIuXzDSIq2ysYFkWjfSoJ5L0+vj0ANnroLi3qmzC33LSVoCecgCRIIVJe3D8E6J5tv/LbBCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93e4b0eb5d145077846a4eb5b4b9b6e980d1f69754a8f39c313e9070e84f7a0b","last_reissued_at":"2026-07-04T14:45:59.318787Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:59.318787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Interactive Quantum Statistical and Perfect Zero-Knowledge","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Hirotada Kobayashi","submitted_at":"2002-07-29T10:22:34Z","abstract_excerpt":"This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0207158","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0207158/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":"quant-ph/0207158","created_at":"2026-07-04T14:45:59.318834+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0207158v1","created_at":"2026-07-04T14:45:59.318834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0207158","created_at":"2026-07-04T14:45:59.318834+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPSLB225CRIH","created_at":"2026-07-04T14:45:59.318834+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPSLB225CRIHPBDK","created_at":"2026-07-04T14:45:59.318834+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPSLB225","created_at":"2026-07-04T14:45:59.318834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G","json":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G.json","graph_json":"https://pith.science/api/pith-number/SPSLB225CRIHPBDKJ223JONW5G/graph.json","events_json":"https://pith.science/api/pith-number/SPSLB225CRIHPBDKJ223JONW5G/events.json","paper":"https://pith.science/paper/SPSLB225"},"agent_actions":{"view_html":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G","download_json":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G.json","view_paper":"https://pith.science/paper/SPSLB225","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0207158&json=true","fetch_graph":"https://pith.science/api/pith-number/SPSLB225CRIHPBDKJ223JONW5G/graph.json","fetch_events":"https://pith.science/api/pith-number/SPSLB225CRIHPBDKJ223JONW5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G/action/storage_attestation","attest_author":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G/action/author_attestation","sign_citation":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G/action/citation_signature","submit_replication":"https://pith.science/pith/SPSLB225CRIHPBDKJ223JONW5G/action/replication_record"}},"created_at":"2026-07-04T14:45:59.318834+00:00","updated_at":"2026-07-04T14:45:59.318834+00:00"}