{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:HKATW2JT2ZPKGDQ5NTHOEYH5C6","short_pith_number":"pith:HKATW2JT","schema_version":"1.0","canonical_sha256":"3a813b6933d65ea30e1d6ccee260fd1783fb64265504dd0c6f8884ab79a73e3a","source":{"kind":"arxiv","id":"quant-ph/0511020","version":1},"attestation_state":"computed","paper":{"title":"Zero-knowledge against quantum attacks","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Watrous","submitted_at":"2005-11-03T19:22:45Z","abstract_excerpt":"This paper proves that several interactive proof systems are zero-knowledge against quantum attacks. This includes a few well-known classical zero-knowledge proof systems as well as quantum interactive proof systems for the complexity class HVQSZK, which comprises all problems having \"honest verifier\" quantum statistical zero-knowledge proofs. It is also proved that zero-knowledge proofs for every language in NP exist that are secure against quantum attacks, assuming the existence of quantum computationally concealing commitment schemes. Previously no non-trivial proof systems were known to be"},"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/0511020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-03T19:22:45Z","cross_cats_sorted":[],"title_canon_sha256":"a8b0d88dc3b49e82ab0aa8250cf59c08781bd71b305b3f0962daba32df4acd1b","abstract_canon_sha256":"f8d94d7cec2faf472b76d22858e32b51c65c4edd2680c4309cb5b5e9fa0c5893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:51:50.376304Z","signature_b64":"qz2lvytR8sspLpK52sujanHFCOMoPaK4ZcwSaS+0T7oR9lMECGu+B2f/h5Sq8JpyVKOwpL9xjjz9fy+Yn5VVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a813b6933d65ea30e1d6ccee260fd1783fb64265504dd0c6f8884ab79a73e3a","last_reissued_at":"2026-07-04T14:51:50.375914Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:51:50.375914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-knowledge against quantum attacks","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Watrous","submitted_at":"2005-11-03T19:22:45Z","abstract_excerpt":"This paper proves that several interactive proof systems are zero-knowledge against quantum attacks. This includes a few well-known classical zero-knowledge proof systems as well as quantum interactive proof systems for the complexity class HVQSZK, which comprises all problems having \"honest verifier\" quantum statistical zero-knowledge proofs. It is also proved that zero-knowledge proofs for every language in NP exist that are secure against quantum attacks, assuming the existence of quantum computationally concealing commitment schemes. Previously no non-trivial proof systems were known to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0511020","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/0511020/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/0511020","created_at":"2026-07-04T14:51:50.375990+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511020v1","created_at":"2026-07-04T14:51:50.375990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511020","created_at":"2026-07-04T14:51:50.375990+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKATW2JT2ZPK","created_at":"2026-07-04T14:51:50.375990+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKATW2JT2ZPKGDQ5","created_at":"2026-07-04T14:51:50.375990+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKATW2JT","created_at":"2026-07-04T14:51:50.375990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.03905","citing_title":"On estimating operator norm distance, with optimal trace distance estimation when one state is pure","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6","json":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6.json","graph_json":"https://pith.science/api/pith-number/HKATW2JT2ZPKGDQ5NTHOEYH5C6/graph.json","events_json":"https://pith.science/api/pith-number/HKATW2JT2ZPKGDQ5NTHOEYH5C6/events.json","paper":"https://pith.science/paper/HKATW2JT"},"agent_actions":{"view_html":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6","download_json":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6.json","view_paper":"https://pith.science/paper/HKATW2JT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0511020&json=true","fetch_graph":"https://pith.science/api/pith-number/HKATW2JT2ZPKGDQ5NTHOEYH5C6/graph.json","fetch_events":"https://pith.science/api/pith-number/HKATW2JT2ZPKGDQ5NTHOEYH5C6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6/action/storage_attestation","attest_author":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6/action/author_attestation","sign_citation":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6/action/citation_signature","submit_replication":"https://pith.science/pith/HKATW2JT2ZPKGDQ5NTHOEYH5C6/action/replication_record"}},"created_at":"2026-07-04T14:51:50.375990+00:00","updated_at":"2026-07-04T14:51:50.375990+00:00"}