{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CJ25HW4C5CNDOT63G2QS5R2BNH","short_pith_number":"pith:CJ25HW4C","schema_version":"1.0","canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","source":{"kind":"arxiv","id":"1305.4444","version":1},"attestation_state":"computed","paper":{"title":"Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Fang-Wei Fu, Jun Zhang, Xinran Li","submitted_at":"2013-05-20T06:03:23Z","abstract_excerpt":"In this paper, we construct an authentication scheme for multi-receivers and multiple messages based on a linear code $C$. This construction can be regarded as a generalization of the authentication scheme given by Safavi-Naini and Wang. Actually, we notice that the scheme of Safavi-Naini and Wang is constructed with Reed-Solomon codes. The generalization to linear codes has the similar advantages as generalizing Shamir's secret sharing scheme to linear secret sharing sceme based on linear codes. For a fixed message base field $\\f$, our scheme allows arbitrarily many receivers to check the int"},"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":"1305.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-20T06:03:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e43f24afc09942d4b582d309d9bc7981b52956305030be770906d5c74c94596e","abstract_canon_sha256":"da936c39739d4ba1b80e0cdb64986083bbb24961d4d2fb800917e8b0c68453b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:23.690027Z","signature_b64":"bFXpdZfY9D0vuY61vRrHTA5FvsSAFMY+ki4ZJ8J26PVzLxsRV6ujIsuzTqbiBXa/r5WSwWy3XXybvgmHprQoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","last_reissued_at":"2026-05-18T03:25:23.689389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:23.689389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Fang-Wei Fu, Jun Zhang, Xinran Li","submitted_at":"2013-05-20T06:03:23Z","abstract_excerpt":"In this paper, we construct an authentication scheme for multi-receivers and multiple messages based on a linear code $C$. This construction can be regarded as a generalization of the authentication scheme given by Safavi-Naini and Wang. Actually, we notice that the scheme of Safavi-Naini and Wang is constructed with Reed-Solomon codes. The generalization to linear codes has the similar advantages as generalizing Shamir's secret sharing scheme to linear secret sharing sceme based on linear codes. For a fixed message base field $\\f$, our scheme allows arbitrarily many receivers to check the int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4444","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.4444","created_at":"2026-05-18T03:25:23.689475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4444v1","created_at":"2026-05-18T03:25:23.689475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4444","created_at":"2026-05-18T03:25:23.689475+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJ25HW4C5CND","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJ25HW4C5CNDOT63","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJ25HW4C","created_at":"2026-05-18T12:27:40.988391+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/CJ25HW4C5CNDOT63G2QS5R2BNH","json":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH.json","graph_json":"https://pith.science/api/pith-number/CJ25HW4C5CNDOT63G2QS5R2BNH/graph.json","events_json":"https://pith.science/api/pith-number/CJ25HW4C5CNDOT63G2QS5R2BNH/events.json","paper":"https://pith.science/paper/CJ25HW4C"},"agent_actions":{"view_html":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH","download_json":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH.json","view_paper":"https://pith.science/paper/CJ25HW4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4444&json=true","fetch_graph":"https://pith.science/api/pith-number/CJ25HW4C5CNDOT63G2QS5R2BNH/graph.json","fetch_events":"https://pith.science/api/pith-number/CJ25HW4C5CNDOT63G2QS5R2BNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/action/storage_attestation","attest_author":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/action/author_attestation","sign_citation":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/action/citation_signature","submit_replication":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/action/replication_record"}},"created_at":"2026-05-18T03:25:23.689475+00:00","updated_at":"2026-05-18T03:25:23.689475+00:00"}