{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q5WALT3FURHTE4UQ4PDRCHELZD","short_pith_number":"pith:Q5WALT3F","schema_version":"1.0","canonical_sha256":"876c05cf65a44f327290e3c7111c8bc8f2e19f4ba10bbbe8cab32dd560f4de6a","source":{"kind":"arxiv","id":"1309.1151","version":2},"attestation_state":"computed","paper":{"title":"Non-Malleable Coding Against Bit-wise and Split-State Tampering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi, Venkatesan Guruswami","submitted_at":"2013-09-04T19:52:59Z","abstract_excerpt":"Non-malleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is impossible. Intuitively, information encoded by a non-malleable code either decodes to the original message or, in presence of any tampering, to an unrelated message. Dziembowski et al. show existence of non-malleable codes for any class of tampering functions of bounded size.\n  We consider constructions of coding schemes against two well-studied classes of tampering functions: bit-wise tampering functi"},"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":"1309.1151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-04T19:52:59Z","cross_cats_sorted":["cs.CC","cs.CR","math.IT"],"title_canon_sha256":"ccdf2723674b225211515d648ad2366952e89a3f0719f1d6159dadf034a3ccb2","abstract_canon_sha256":"b900d9bc7404df6d81497607f51aa9f10e380e97dac8e01064bdee4e831e0786"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:00.612470Z","signature_b64":"7ZDxqeeE5AzH+U0FyhAVwwR/KVFpSgfUp2aXP6IGop58aiIJQ3VUWrVjvQk4AyDzzCfamUJE3X4aMSRAdQHkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"876c05cf65a44f327290e3c7111c8bc8f2e19f4ba10bbbe8cab32dd560f4de6a","last_reissued_at":"2026-05-18T02:44:00.612106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:00.612106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Malleable Coding Against Bit-wise and Split-State Tampering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi, Venkatesan Guruswami","submitted_at":"2013-09-04T19:52:59Z","abstract_excerpt":"Non-malleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is impossible. Intuitively, information encoded by a non-malleable code either decodes to the original message or, in presence of any tampering, to an unrelated message. Dziembowski et al. show existence of non-malleable codes for any class of tampering functions of bounded size.\n  We consider constructions of coding schemes against two well-studied classes of tampering functions: bit-wise tampering functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1151","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":"1309.1151","created_at":"2026-05-18T02:44:00.612154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1151v2","created_at":"2026-05-18T02:44:00.612154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1151","created_at":"2026-05-18T02:44:00.612154+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5WALT3FURHT","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5WALT3FURHTE4UQ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5WALT3F","created_at":"2026-05-18T12:27:57.521954+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/Q5WALT3FURHTE4UQ4PDRCHELZD","json":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD.json","graph_json":"https://pith.science/api/pith-number/Q5WALT3FURHTE4UQ4PDRCHELZD/graph.json","events_json":"https://pith.science/api/pith-number/Q5WALT3FURHTE4UQ4PDRCHELZD/events.json","paper":"https://pith.science/paper/Q5WALT3F"},"agent_actions":{"view_html":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD","download_json":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD.json","view_paper":"https://pith.science/paper/Q5WALT3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1151&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5WALT3FURHTE4UQ4PDRCHELZD/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5WALT3FURHTE4UQ4PDRCHELZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD/action/storage_attestation","attest_author":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD/action/author_attestation","sign_citation":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD/action/citation_signature","submit_replication":"https://pith.science/pith/Q5WALT3FURHTE4UQ4PDRCHELZD/action/replication_record"}},"created_at":"2026-05-18T02:44:00.612154+00:00","updated_at":"2026-05-18T02:44:00.612154+00:00"}