{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FBRZKNZBGHA3YNOJOCHB32WTLE","short_pith_number":"pith:FBRZKNZB","schema_version":"1.0","canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","source":{"kind":"arxiv","id":"1410.3214","version":1},"attestation_state":"computed","paper":{"title":"Secure Erasure Codes With Partial Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2014-10-13T08:16:00Z","abstract_excerpt":"The MDS property (aka the $k$-out-of-$n$ property) requires that if a file is split into several symbols and subsequently encoded into $n$ coded symbols, each being stored in one storage node of a distributed storage system (DSS), then an user can recover the file by accessing any $k$ nodes. We study the so-called $p$-decodable $\\mu$-secure erasure coding scheme $(1 \\leq p \\leq k - \\mu, 0 \\leq \\mu < k, p | (k-\\mu))$, which satisfies the MDS property and the following additional properties:\n  (P1) strongly secure up to a threshold: an adversary which eavesdrops at most $\\mu$ storage nodes gains"},"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":"1410.3214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-13T08:16:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e716e36b898e2d60c5c1323d5fcc51d9b5393c348975eeda49b0e5860a35801","abstract_canon_sha256":"c672bbe9a7247c87c532e834da1042bc85839aa72e149613933f5bca90fe4fa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.828748Z","signature_b64":"kpclDeY+R7yAC4AQfWaawiH0ejBJmY8aZoGGvMmxGoSVpN9BE47NN/8/GEc4jK+AGzjglJxzdNnjLscI5UnRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286395372131c1bc35c9708e1dead35925436f37cc89b16b878019a8710c5656","last_reissued_at":"2026-05-18T02:40:11.828172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.828172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Erasure Codes With Partial Decodability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2014-10-13T08:16:00Z","abstract_excerpt":"The MDS property (aka the $k$-out-of-$n$ property) requires that if a file is split into several symbols and subsequently encoded into $n$ coded symbols, each being stored in one storage node of a distributed storage system (DSS), then an user can recover the file by accessing any $k$ nodes. We study the so-called $p$-decodable $\\mu$-secure erasure coding scheme $(1 \\leq p \\leq k - \\mu, 0 \\leq \\mu < k, p | (k-\\mu))$, which satisfies the MDS property and the following additional properties:\n  (P1) strongly secure up to a threshold: an adversary which eavesdrops at most $\\mu$ storage nodes gains"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3214","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":"1410.3214","created_at":"2026-05-18T02:40:11.828247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3214v1","created_at":"2026-05-18T02:40:11.828247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3214","created_at":"2026-05-18T02:40:11.828247+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBRZKNZBGHA3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBRZKNZBGHA3YNOJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBRZKNZB","created_at":"2026-05-18T12:28:28.263976+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/FBRZKNZBGHA3YNOJOCHB32WTLE","json":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE.json","graph_json":"https://pith.science/api/pith-number/FBRZKNZBGHA3YNOJOCHB32WTLE/graph.json","events_json":"https://pith.science/api/pith-number/FBRZKNZBGHA3YNOJOCHB32WTLE/events.json","paper":"https://pith.science/paper/FBRZKNZB"},"agent_actions":{"view_html":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE","download_json":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE.json","view_paper":"https://pith.science/paper/FBRZKNZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3214&json=true","fetch_graph":"https://pith.science/api/pith-number/FBRZKNZBGHA3YNOJOCHB32WTLE/graph.json","fetch_events":"https://pith.science/api/pith-number/FBRZKNZBGHA3YNOJOCHB32WTLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/action/storage_attestation","attest_author":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/action/author_attestation","sign_citation":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/action/citation_signature","submit_replication":"https://pith.science/pith/FBRZKNZBGHA3YNOJOCHB32WTLE/action/replication_record"}},"created_at":"2026-05-18T02:40:11.828247+00:00","updated_at":"2026-05-18T02:40:11.828247+00:00"}