{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VFHLQNFFGEL5IMKT3XPYXAM43M","short_pith_number":"pith:VFHLQNFF","schema_version":"1.0","canonical_sha256":"a94eb834a53117d43153dddf8b819cdb32c188d13ad09872954d1e45908271be","source":{"kind":"arxiv","id":"1004.4530","version":3},"attestation_state":"computed","paper":{"title":"Coding Theorems for a (2,2)-Threshold Scheme with Detectability of Impersonation Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hiroki Koga, Hirosuke Yamamoto, Mitsugu Iwamoto","submitted_at":"2010-04-26T14:03:19Z","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"},"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":"1004.4530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-26T14:03:19Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"c6180ca847001cc07df7525826936faa8ec7fdf89a3c31ae09cf3d7f70666d5a","abstract_canon_sha256":"82207ed83019f41c6e80dcab849ca1c335d6489320f2c04f736f9b472585da23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.156072Z","signature_b64":"Hzq5zpDJ/a6MdTX/+coisAhs1CyljlDlc/Mej/EcB8bTzCzRLnD0k3QDHkbyrqe5lHE3IsDbT+whg6MHzz4qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94eb834a53117d43153dddf8b819cdb32c188d13ad09872954d1e45908271be","last_reissued_at":"2026-05-18T02:24:16.155370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.155370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding Theorems for a (2,2)-Threshold Scheme with Detectability of Impersonation Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hiroki Koga, Hirosuke Yamamoto, Mitsugu Iwamoto","submitted_at":"2010-04-26T14:03:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4530","kind":"arxiv","version":3},"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":"1004.4530","created_at":"2026-05-18T02:24:16.155500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4530v3","created_at":"2026-05-18T02:24:16.155500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4530","created_at":"2026-05-18T02:24:16.155500+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFHLQNFFGEL5","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFHLQNFFGEL5IMKT","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFHLQNFF","created_at":"2026-05-18T12:26:15.391820+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/VFHLQNFFGEL5IMKT3XPYXAM43M","json":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M.json","graph_json":"https://pith.science/api/pith-number/VFHLQNFFGEL5IMKT3XPYXAM43M/graph.json","events_json":"https://pith.science/api/pith-number/VFHLQNFFGEL5IMKT3XPYXAM43M/events.json","paper":"https://pith.science/paper/VFHLQNFF"},"agent_actions":{"view_html":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M","download_json":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M.json","view_paper":"https://pith.science/paper/VFHLQNFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4530&json=true","fetch_graph":"https://pith.science/api/pith-number/VFHLQNFFGEL5IMKT3XPYXAM43M/graph.json","fetch_events":"https://pith.science/api/pith-number/VFHLQNFFGEL5IMKT3XPYXAM43M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M/action/storage_attestation","attest_author":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M/action/author_attestation","sign_citation":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M/action/citation_signature","submit_replication":"https://pith.science/pith/VFHLQNFFGEL5IMKT3XPYXAM43M/action/replication_record"}},"created_at":"2026-05-18T02:24:16.155500+00:00","updated_at":"2026-05-18T02:24:16.155500+00:00"}