{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:V2J3LSMMOPXJQFU3MURP43FJII","short_pith_number":"pith:V2J3LSMM","canonical_record":{"source":{"id":"1210.3719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-13T16:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"5710c98c50e8505fd52ad131d61df2e903982e97ed1a2c172b18225f3a8c7dd2","abstract_canon_sha256":"fe4b6570c1d22982605215f47780b312364d7784d7e9dc6ecb0a42777675892c"},"schema_version":"1.0"},"canonical_sha256":"ae93b5c98c73ee98169b6522fe6ca9422593b2436c5bbcfc107bb913c3838036","source":{"kind":"arxiv","id":"1210.3719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3719","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3719v1","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3719","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"V2J3LSMMOPXJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2J3LSMMOPXJQFU3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2J3LSMM","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:V2J3LSMMOPXJQFU3MURP43FJII","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-13T16:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"5710c98c50e8505fd52ad131d61df2e903982e97ed1a2c172b18225f3a8c7dd2","abstract_canon_sha256":"fe4b6570c1d22982605215f47780b312364d7784d7e9dc6ecb0a42777675892c"},"schema_version":"1.0"},"canonical_sha256":"ae93b5c98c73ee98169b6522fe6ca9422593b2436c5bbcfc107bb913c3838036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:17.280051Z","signature_b64":"h15x5YMLSuhmElIaABZNTcIEtQZFbdxsr84FMGs7sioUj2c8Bwu6SsU1HCgtWVLnInYZmG5BsaEacHkxGp/DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae93b5c98c73ee98169b6522fe6ca9422593b2436c5bbcfc107bb913c3838036","last_reissued_at":"2026-05-18T03:43:17.279377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:17.279377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3719","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+6BG+xJ+wR+rx14HQLDiKSqqmPW62Bxq2ooqyKTPcDdFVdtccrvYGCmh6YjrFET1FNxKHBkSz4NJyrqv0pdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:46:11.413125Z"},"content_sha256":"7c7326ae9b176da670cc8b25e2d38ad404269de49fb696a9c9cf76de18b55791","schema_version":"1.0","event_id":"sha256:7c7326ae9b176da670cc8b25e2d38ad404269de49fb696a9c9cf76de18b55791"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:V2J3LSMMOPXJQFU3MURP43FJII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Amit Sahai, Divya Gupta","submitted_at":"2012-10-13T16:32:40Z","abstract_excerpt":"In this work, we consider the long-standing open question of constructing constant-round concurrent zero-knowledge protocols in the plain model. Resolving this question is known to require non-black-box techniques.\n  We consider non-black-box techniques for zero-knowledge based on knowledge assumptions, a line of thinking initiated by the work of Hada and Tanaka (CRYPTO 1998). Prior to our work, it was not known whether knowledge assumptions could be used for achieving security in the concurrent setting, due to a number of significant limitations that we discuss here. Nevertheless, we obtain t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3719","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2zFv7a07y9i9R6+iOuzep+uMfjP6Gj0AIN9BMeTSEj16DjCihbQK1owNChsbyuJ4PDiskTU6YbIvt/4LPFyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:46:11.413826Z"},"content_sha256":"01137f1d0358efde9197fb8a6cbbab1c4721556b532889445fae580740869417","schema_version":"1.0","event_id":"sha256:01137f1d0358efde9197fb8a6cbbab1c4721556b532889445fae580740869417"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2J3LSMMOPXJQFU3MURP43FJII/bundle.json","state_url":"https://pith.science/pith/V2J3LSMMOPXJQFU3MURP43FJII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2J3LSMMOPXJQFU3MURP43FJII/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T18:46:11Z","links":{"resolver":"https://pith.science/pith/V2J3LSMMOPXJQFU3MURP43FJII","bundle":"https://pith.science/pith/V2J3LSMMOPXJQFU3MURP43FJII/bundle.json","state":"https://pith.science/pith/V2J3LSMMOPXJQFU3MURP43FJII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2J3LSMMOPXJQFU3MURP43FJII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V2J3LSMMOPXJQFU3MURP43FJII","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fe4b6570c1d22982605215f47780b312364d7784d7e9dc6ecb0a42777675892c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-13T16:32:40Z","title_canon_sha256":"5710c98c50e8505fd52ad131d61df2e903982e97ed1a2c172b18225f3a8c7dd2"},"schema_version":"1.0","source":{"id":"1210.3719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3719","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3719v1","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3719","created_at":"2026-05-18T03:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"V2J3LSMMOPXJ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V2J3LSMMOPXJQFU3","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V2J3LSMM","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:01137f1d0358efde9197fb8a6cbbab1c4721556b532889445fae580740869417","target":"graph","created_at":"2026-05-18T03:43:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this work, we consider the long-standing open question of constructing constant-round concurrent zero-knowledge protocols in the plain model. Resolving this question is known to require non-black-box techniques.\n  We consider non-black-box techniques for zero-knowledge based on knowledge assumptions, a line of thinking initiated by the work of Hada and Tanaka (CRYPTO 1998). Prior to our work, it was not known whether knowledge assumptions could be used for achieving security in the concurrent setting, due to a number of significant limitations that we discuss here. Nevertheless, we obtain t","authors_text":"Amit Sahai, Divya Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-13T16:32:40Z","title":"On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3719","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c7326ae9b176da670cc8b25e2d38ad404269de49fb696a9c9cf76de18b55791","target":"record","created_at":"2026-05-18T03:43:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fe4b6570c1d22982605215f47780b312364d7784d7e9dc6ecb0a42777675892c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-10-13T16:32:40Z","title_canon_sha256":"5710c98c50e8505fd52ad131d61df2e903982e97ed1a2c172b18225f3a8c7dd2"},"schema_version":"1.0","source":{"id":"1210.3719","kind":"arxiv","version":1}},"canonical_sha256":"ae93b5c98c73ee98169b6522fe6ca9422593b2436c5bbcfc107bb913c3838036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae93b5c98c73ee98169b6522fe6ca9422593b2436c5bbcfc107bb913c3838036","first_computed_at":"2026-05-18T03:43:17.279377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:17.279377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h15x5YMLSuhmElIaABZNTcIEtQZFbdxsr84FMGs7sioUj2c8Bwu6SsU1HCgtWVLnInYZmG5BsaEacHkxGp/DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:17.280051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c7326ae9b176da670cc8b25e2d38ad404269de49fb696a9c9cf76de18b55791","sha256:01137f1d0358efde9197fb8a6cbbab1c4721556b532889445fae580740869417"],"state_sha256":"9d86743b6428a57a1cb27a42f8c8270dbe34a605c799869e2d07b7c4036171c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOeX0O46LBAMkWCeA0fCJQ4usaIRm+1ktzufFugusswL+r32awZ4AzFqfl2BJZlqNyomMV0J9R8sVOwwG3/OAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:46:11.417595Z","bundle_sha256":"490601e74f5cb965f87557d80c6eff529df958e5141b5cdb26068ee4914cb02e"}}