{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2AIZFR6NHVHHDGA4WLKCYBF6AZ","short_pith_number":"pith:2AIZFR6N","schema_version":"1.0","canonical_sha256":"d01192c7cd3d4e71981cb2d42c04be064e647ca42c59fe6cd1c254d4a6ac9082","source":{"kind":"arxiv","id":"1009.2556","version":2},"attestation_state":"computed","paper":{"title":"Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Salim El Rouayheb, Sameer Pawar","submitted_at":"2010-09-14T02:42:46Z","abstract_excerpt":"We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, necessitating, thus, a repair mechanism in order to maintain a desired high system reliability. In such dynamic settings, an important security problem is to safeguard the system from an intruder who may come at different time instances during the lifetime of the storage system to observe and possibly alter the data stored on some nodes. In this scenario, we give upper bounds on the maximum amount of information that can "},"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":"1009.2556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-14T02:42:46Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"a949d91fabd44b3c560484f18c05d84208881af6470ab8ef97414ee9912b4db0","abstract_canon_sha256":"a90841f97891cf7a14e76a71979bcb72b51679b2e50909ac46cfd42942b404a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:32.475362Z","signature_b64":"c7CKejWYh0GYilWaI53RiyU9E1RM8JoPNrLZ0QNiT9DOTNYShAvTyvRUeI1/CxMPWltblhaiFrb0r1uxcXWEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d01192c7cd3d4e71981cb2d42c04be064e647ca42c59fe6cd1c254d4a6ac9082","last_reissued_at":"2026-05-18T04:23:32.474586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:32.474586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Securing Dynamic Distributed Storage Systems against Eavesdropping and Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Salim El Rouayheb, Sameer Pawar","submitted_at":"2010-09-14T02:42:46Z","abstract_excerpt":"We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, necessitating, thus, a repair mechanism in order to maintain a desired high system reliability. In such dynamic settings, an important security problem is to safeguard the system from an intruder who may come at different time instances during the lifetime of the storage system to observe and possibly alter the data stored on some nodes. In this scenario, we give upper bounds on the maximum amount of information that can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2556","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":"1009.2556","created_at":"2026-05-18T04:23:32.474702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2556v2","created_at":"2026-05-18T04:23:32.474702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2556","created_at":"2026-05-18T04:23:32.474702+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AIZFR6NHVHH","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AIZFR6NHVHHDGA4","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AIZFR6N","created_at":"2026-05-18T12:26:03.138858+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/2AIZFR6NHVHHDGA4WLKCYBF6AZ","json":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ.json","graph_json":"https://pith.science/api/pith-number/2AIZFR6NHVHHDGA4WLKCYBF6AZ/graph.json","events_json":"https://pith.science/api/pith-number/2AIZFR6NHVHHDGA4WLKCYBF6AZ/events.json","paper":"https://pith.science/paper/2AIZFR6N"},"agent_actions":{"view_html":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ","download_json":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ.json","view_paper":"https://pith.science/paper/2AIZFR6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2556&json=true","fetch_graph":"https://pith.science/api/pith-number/2AIZFR6NHVHHDGA4WLKCYBF6AZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2AIZFR6NHVHHDGA4WLKCYBF6AZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ/action/storage_attestation","attest_author":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ/action/author_attestation","sign_citation":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ/action/citation_signature","submit_replication":"https://pith.science/pith/2AIZFR6NHVHHDGA4WLKCYBF6AZ/action/replication_record"}},"created_at":"2026-05-18T04:23:32.474702+00:00","updated_at":"2026-05-18T04:23:32.474702+00:00"}