{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:U3MIRII3EBMFMIZCNW6LOUYGLH","short_pith_number":"pith:U3MIRII3","schema_version":"1.0","canonical_sha256":"a6d888a11b20585623226dbcb7530659f18f340e552b781d044ca99f792a16ee","source":{"kind":"arxiv","id":"1310.3902","version":2},"attestation_state":"computed","paper":{"title":"Message Authentication Code over a Wiretap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Dajiang Chen, Shaoquan Jiang, Zhiguang Qin","submitted_at":"2013-10-15T02:46:58Z","abstract_excerpt":"Message Authentication Code (MAC) is a keyed function $f_K$ such that when Alice, who shares the secret $K$ with Bob, sends $f_K(M)$ to the latter, Bob will be assured of the integrity and authenticity of $M$. Traditionally, it is assumed that the channel is noiseless. However, Maurer showed that in this case an attacker can succeed with probability $2^{-\\frac{H(K)}{\\ell+1}}$ after authenticating $\\ell$ messages. In this paper, we consider the setting where the channel is noisy. Specifically, Alice and Bob are connected by a discrete memoryless channel (DMC) $W_1$ and a noiseless but insecure "},"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":"1310.3902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-15T02:46:58Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"437ec9d2a084f30a4682618f99991934561c9bcd52a4b2130efef4e8e98a6019","abstract_canon_sha256":"fd3409cb8885d85cc625433652cd727ada6cb51c3bb045f1c0e9313347ce1952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:02.778396Z","signature_b64":"9YUqwi0nvst0wyZxrmbC1YlnfMRBN+tyBnM4d1agbfeVjtw4HMAah8iUDlpAo/b0cZkXsJUPfTLA2y68GExvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d888a11b20585623226dbcb7530659f18f340e552b781d044ca99f792a16ee","last_reissued_at":"2026-05-18T02:00:02.777709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:02.777709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message Authentication Code over a Wiretap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Dajiang Chen, Shaoquan Jiang, Zhiguang Qin","submitted_at":"2013-10-15T02:46:58Z","abstract_excerpt":"Message Authentication Code (MAC) is a keyed function $f_K$ such that when Alice, who shares the secret $K$ with Bob, sends $f_K(M)$ to the latter, Bob will be assured of the integrity and authenticity of $M$. Traditionally, it is assumed that the channel is noiseless. However, Maurer showed that in this case an attacker can succeed with probability $2^{-\\frac{H(K)}{\\ell+1}}$ after authenticating $\\ell$ messages. In this paper, we consider the setting where the channel is noisy. Specifically, Alice and Bob are connected by a discrete memoryless channel (DMC) $W_1$ and a noiseless but insecure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3902","kind":"arxiv","version":2},"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":"1310.3902","created_at":"2026-05-18T02:00:02.777810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3902v2","created_at":"2026-05-18T02:00:02.777810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3902","created_at":"2026-05-18T02:00:02.777810+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3MIRII3EBMF","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3MIRII3EBMFMIZC","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3MIRII3","created_at":"2026-05-18T12:28:02.375192+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/U3MIRII3EBMFMIZCNW6LOUYGLH","json":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH.json","graph_json":"https://pith.science/api/pith-number/U3MIRII3EBMFMIZCNW6LOUYGLH/graph.json","events_json":"https://pith.science/api/pith-number/U3MIRII3EBMFMIZCNW6LOUYGLH/events.json","paper":"https://pith.science/paper/U3MIRII3"},"agent_actions":{"view_html":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH","download_json":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH.json","view_paper":"https://pith.science/paper/U3MIRII3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3902&json=true","fetch_graph":"https://pith.science/api/pith-number/U3MIRII3EBMFMIZCNW6LOUYGLH/graph.json","fetch_events":"https://pith.science/api/pith-number/U3MIRII3EBMFMIZCNW6LOUYGLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH/action/storage_attestation","attest_author":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH/action/author_attestation","sign_citation":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH/action/citation_signature","submit_replication":"https://pith.science/pith/U3MIRII3EBMFMIZCNW6LOUYGLH/action/replication_record"}},"created_at":"2026-05-18T02:00:02.777810+00:00","updated_at":"2026-05-18T02:00:02.777810+00:00"}