{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VFHLQNFFGEL5IMKT3XPYXAM43M","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":"82207ed83019f41c6e80dcab849ca1c335d6489320f2c04f736f9b472585da23","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-26T14:03:19Z","title_canon_sha256":"c6180ca847001cc07df7525826936faa8ec7fdf89a3c31ae09cf3d7f70666d5a"},"schema_version":"1.0","source":{"id":"1004.4530","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4530","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4530v3","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4530","created_at":"2026-05-18T02:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"VFHLQNFFGEL5","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VFHLQNFFGEL5IMKT","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VFHLQNFF","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:2bcb28f7eb4bc5080bb51b90a98c07a2498d833ba1e25c7b6d48db7d0ed539d4","target":"graph","created_at":"2026-05-18T02:24:16Z","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 paper, we discuss coding theorems on a $(2, 2)$--threshold scheme in the presence of an opponent who impersonates one of the two shareholders in an asymptotic setup. We consider a situation where $n$ secrets $S^n$ from a memoryless source is blockwisely encoded to two shares and the two shares are decoded to $S^n$ with permitting negligible decoding error. We introduce correlation level of the two shares and characterize the minimum attainable rates of the shares and a uniform random number for realizing a $(2, 2)$--threshold scheme that is secure against the impersonation attack by an","authors_text":"Hiroki Koga, Hirosuke Yamamoto, Mitsugu Iwamoto","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-26T14:03:19Z","title":"Coding Theorems for a (2,2)-Threshold Scheme with Detectability of Impersonation Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4530","kind":"arxiv","version":3},"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:f64ad7082b3d15ca9d1a5f4a8f6d2b38214b705225034d72e82b516b9c2362fa","target":"record","created_at":"2026-05-18T02:24:16Z","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":"82207ed83019f41c6e80dcab849ca1c335d6489320f2c04f736f9b472585da23","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-26T14:03:19Z","title_canon_sha256":"c6180ca847001cc07df7525826936faa8ec7fdf89a3c31ae09cf3d7f70666d5a"},"schema_version":"1.0","source":{"id":"1004.4530","kind":"arxiv","version":3}},"canonical_sha256":"a94eb834a53117d43153dddf8b819cdb32c188d13ad09872954d1e45908271be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a94eb834a53117d43153dddf8b819cdb32c188d13ad09872954d1e45908271be","first_computed_at":"2026-05-18T02:24:16.155370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:16.155370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hzq5zpDJ/a6MdTX/+coisAhs1CyljlDlc/Mej/EcB8bTzCzRLnD0k3QDHkbyrqe5lHE3IsDbT+whg6MHzz4qCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:16.156072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.4530","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f64ad7082b3d15ca9d1a5f4a8f6d2b38214b705225034d72e82b516b9c2362fa","sha256:2bcb28f7eb4bc5080bb51b90a98c07a2498d833ba1e25c7b6d48db7d0ed539d4"],"state_sha256":"cb12c76c43e6d8915f15c7e43653336b297c5a3cdf74ae65f871670fec6ae508"}