{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QRBKZBUEF5SKNLDPQFBTSJTG2O","short_pith_number":"pith:QRBKZBUE","schema_version":"1.0","canonical_sha256":"8442ac86842f64a6ac6f8143392666d3bedec22c04405c272ad311564848000c","source":{"kind":"arxiv","id":"1105.3879","version":1},"attestation_state":"computed","paper":{"title":"Non-Malleable Codes from the Wire-Tap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Patey, G\\'erard Cohen, Herv\\'e Chabanne, Jean-Pierre Flori","submitted_at":"2011-05-19T14:07:26Z","abstract_excerpt":"Recently, Dziembowski et al. introduced the notion of non-malleable codes (NMC), inspired from the notion of non-malleability in cryptography and the work of Gennaro et al. in 2004 on tamper proof security. Informally, when using NMC, if an attacker modifies a codeword, decoding this modified codeword will return either the original message or a completely unrelated value.\n  The definition of NMC is related to a family of modifications authorized to the attacker. In their paper, Dziembowski et al. propose a construction valid for the family of all bit-wise independent functions.\n  In this arti"},"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":"1105.3879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-05-19T14:07:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"02698edbeb02d3ea8bdc25d2129d7d261fab35445d11dcbb1d1c5efd0b0273c0","abstract_canon_sha256":"7f6eefd3f2fb40c1ebbdb7235e4c6b36915bad3de5712f8fbc2569f3408ec051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:51.142797Z","signature_b64":"mZujBTYgPyYmAnYZm378lPqZoYXepbKZpwNPHQ70DFn63p9KdVk8yJqqRH8gAbmWnTJAmkHji4CLOJS6DUjrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8442ac86842f64a6ac6f8143392666d3bedec22c04405c272ad311564848000c","last_reissued_at":"2026-05-18T04:21:51.142252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:51.142252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Malleable Codes from the Wire-Tap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Patey, G\\'erard Cohen, Herv\\'e Chabanne, Jean-Pierre Flori","submitted_at":"2011-05-19T14:07:26Z","abstract_excerpt":"Recently, Dziembowski et al. introduced the notion of non-malleable codes (NMC), inspired from the notion of non-malleability in cryptography and the work of Gennaro et al. in 2004 on tamper proof security. Informally, when using NMC, if an attacker modifies a codeword, decoding this modified codeword will return either the original message or a completely unrelated value.\n  The definition of NMC is related to a family of modifications authorized to the attacker. In their paper, Dziembowski et al. propose a construction valid for the family of all bit-wise independent functions.\n  In this arti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3879","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":"1105.3879","created_at":"2026-05-18T04:21:51.142357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3879v1","created_at":"2026-05-18T04:21:51.142357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3879","created_at":"2026-05-18T04:21:51.142357+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRBKZBUEF5SK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRBKZBUEF5SKNLDP","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRBKZBUE","created_at":"2026-05-18T12:26:39.201973+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/QRBKZBUEF5SKNLDPQFBTSJTG2O","json":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O.json","graph_json":"https://pith.science/api/pith-number/QRBKZBUEF5SKNLDPQFBTSJTG2O/graph.json","events_json":"https://pith.science/api/pith-number/QRBKZBUEF5SKNLDPQFBTSJTG2O/events.json","paper":"https://pith.science/paper/QRBKZBUE"},"agent_actions":{"view_html":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O","download_json":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O.json","view_paper":"https://pith.science/paper/QRBKZBUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3879&json=true","fetch_graph":"https://pith.science/api/pith-number/QRBKZBUEF5SKNLDPQFBTSJTG2O/graph.json","fetch_events":"https://pith.science/api/pith-number/QRBKZBUEF5SKNLDPQFBTSJTG2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O/action/storage_attestation","attest_author":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O/action/author_attestation","sign_citation":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O/action/citation_signature","submit_replication":"https://pith.science/pith/QRBKZBUEF5SKNLDPQFBTSJTG2O/action/replication_record"}},"created_at":"2026-05-18T04:21:51.142357+00:00","updated_at":"2026-05-18T04:21:51.142357+00:00"}