{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DCYBI5KOXO7BDPGSDKOBBVKYDL","short_pith_number":"pith:DCYBI5KO","schema_version":"1.0","canonical_sha256":"18b014754ebbbe11bcd21a9c10d5581ad3b1fc31894e74c49b1a915ff5ceadd7","source":{"kind":"arxiv","id":"1804.02087","version":1},"attestation_state":"computed","paper":{"title":"Low Complexity Secure Code (LCSC) Design for Big Data in Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fred Etemadieh, Hamid R. Sadjadpour, Mohammad Reza Rahimi, Mohsen Karimzadeh Kiskani","submitted_at":"2018-04-06T00:21:41Z","abstract_excerpt":"In the era of big data, reducing the computational complexity of servers in data centers will be an important goal. We propose Low Complexity Secure Codes (LCSCs) that are specifically designed to provide information theoretic security in cloud distributed storage systems. Unlike traditional coding schemes that are designed for error correction capabilities, these codes are only designed to provide security with low decoding complexity. These sparse codes are able to provide (asymptotic) perfect secrecy similar to Shannon cipher. The simultaneous promise of low decoding complexity and perfect "},"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":"1804.02087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-06T00:21:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"35f27fd9ce87919b2dc089e6c4a655e7db9fc5a1ed883973af2f3bba350a481e","abstract_canon_sha256":"41ae54bea05ea94afc746aab915236ae24af78b002e278b6fc254b9ddc0e5192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:07.887934Z","signature_b64":"tnSuu/Lw9K6ZKT0KMmqT2Lfr3twhGYkO6uLoSFSp3gUWx24UINikb+MUfSMqmFK1F2nmBYK5I5VSi9DZrkagAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18b014754ebbbe11bcd21a9c10d5581ad3b1fc31894e74c49b1a915ff5ceadd7","last_reissued_at":"2026-05-18T00:19:07.887384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:07.887384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Complexity Secure Code (LCSC) Design for Big Data in Cloud Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fred Etemadieh, Hamid R. Sadjadpour, Mohammad Reza Rahimi, Mohsen Karimzadeh Kiskani","submitted_at":"2018-04-06T00:21:41Z","abstract_excerpt":"In the era of big data, reducing the computational complexity of servers in data centers will be an important goal. We propose Low Complexity Secure Codes (LCSCs) that are specifically designed to provide information theoretic security in cloud distributed storage systems. Unlike traditional coding schemes that are designed for error correction capabilities, these codes are only designed to provide security with low decoding complexity. These sparse codes are able to provide (asymptotic) perfect secrecy similar to Shannon cipher. The simultaneous promise of low decoding complexity and perfect "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02087","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":"1804.02087","created_at":"2026-05-18T00:19:07.887486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02087v1","created_at":"2026-05-18T00:19:07.887486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02087","created_at":"2026-05-18T00:19:07.887486+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCYBI5KOXO7B","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCYBI5KOXO7BDPGS","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCYBI5KO","created_at":"2026-05-18T12:32:19.392346+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/DCYBI5KOXO7BDPGSDKOBBVKYDL","json":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL.json","graph_json":"https://pith.science/api/pith-number/DCYBI5KOXO7BDPGSDKOBBVKYDL/graph.json","events_json":"https://pith.science/api/pith-number/DCYBI5KOXO7BDPGSDKOBBVKYDL/events.json","paper":"https://pith.science/paper/DCYBI5KO"},"agent_actions":{"view_html":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL","download_json":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL.json","view_paper":"https://pith.science/paper/DCYBI5KO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02087&json=true","fetch_graph":"https://pith.science/api/pith-number/DCYBI5KOXO7BDPGSDKOBBVKYDL/graph.json","fetch_events":"https://pith.science/api/pith-number/DCYBI5KOXO7BDPGSDKOBBVKYDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL/action/storage_attestation","attest_author":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL/action/author_attestation","sign_citation":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL/action/citation_signature","submit_replication":"https://pith.science/pith/DCYBI5KOXO7BDPGSDKOBBVKYDL/action/replication_record"}},"created_at":"2026-05-18T00:19:07.887486+00:00","updated_at":"2026-05-18T00:19:07.887486+00:00"}