{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:47JITBLZPROGEBD7PDUB2X2XN3","short_pith_number":"pith:47JITBLZ","schema_version":"1.0","canonical_sha256":"e7d28985797c5c62047f78e81d5f576ecbf5bd14e46d82ed888d0d2386096c10","source":{"kind":"arxiv","id":"1708.05462","version":1},"attestation_state":"computed","paper":{"title":"Non-Malleable Codes with Leakage and Applications to Secure Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Fuchun Lin, Huaxiong Wang, Mahdi Cheraghchi, Reihaneh Safavi-Naini","submitted_at":"2017-08-17T23:27:03Z","abstract_excerpt":"Non-malleable codes are randomized codes that protect coded messages against modification by functions in a tampering function class. These codes are motivated by providing tamper resilience in applications where a cryptographic secret is stored in a tamperable storage device and the protection goal is to ensure that the adversary cannot benefit from their tamperings with the device. In this paper we consider non-malleable codes for protection of secure communication against active physical layer adversaries. We define a class of functions that closely model tampering of communication by adver"},"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":"1708.05462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-08-17T23:27:03Z","cross_cats_sorted":[],"title_canon_sha256":"4e186eda9bc73ab01667b8aaa5e33e62f9066b26dd8d53c42cd671690058c874","abstract_canon_sha256":"6fdef8969e1dd8f5981870ceb121fd937282a5aa418ae3a9280703435df91fed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:50.003181Z","signature_b64":"j9LOzAj5DyMGV8BsDmBp8xQbsLTo6lsoXuykTENwTLLhKLlexbIyxik0NmK6ROIkc7rqiEMYDLu0ExgC1c9aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7d28985797c5c62047f78e81d5f576ecbf5bd14e46d82ed888d0d2386096c10","last_reissued_at":"2026-05-18T00:37:50.002464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:50.002464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Malleable Codes with Leakage and Applications to Secure Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Fuchun Lin, Huaxiong Wang, Mahdi Cheraghchi, Reihaneh Safavi-Naini","submitted_at":"2017-08-17T23:27:03Z","abstract_excerpt":"Non-malleable codes are randomized codes that protect coded messages against modification by functions in a tampering function class. These codes are motivated by providing tamper resilience in applications where a cryptographic secret is stored in a tamperable storage device and the protection goal is to ensure that the adversary cannot benefit from their tamperings with the device. In this paper we consider non-malleable codes for protection of secure communication against active physical layer adversaries. We define a class of functions that closely model tampering of communication by adver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05462","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":"1708.05462","created_at":"2026-05-18T00:37:50.002589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05462v1","created_at":"2026-05-18T00:37:50.002589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05462","created_at":"2026-05-18T00:37:50.002589+00:00"},{"alias_kind":"pith_short_12","alias_value":"47JITBLZPROG","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"47JITBLZPROGEBD7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"47JITBLZ","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11066","citing_title":"Non-malleable Coding for Arbitrary Varying Channels","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3","json":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3.json","graph_json":"https://pith.science/api/pith-number/47JITBLZPROGEBD7PDUB2X2XN3/graph.json","events_json":"https://pith.science/api/pith-number/47JITBLZPROGEBD7PDUB2X2XN3/events.json","paper":"https://pith.science/paper/47JITBLZ"},"agent_actions":{"view_html":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3","download_json":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3.json","view_paper":"https://pith.science/paper/47JITBLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05462&json=true","fetch_graph":"https://pith.science/api/pith-number/47JITBLZPROGEBD7PDUB2X2XN3/graph.json","fetch_events":"https://pith.science/api/pith-number/47JITBLZPROGEBD7PDUB2X2XN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3/action/storage_attestation","attest_author":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3/action/author_attestation","sign_citation":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3/action/citation_signature","submit_replication":"https://pith.science/pith/47JITBLZPROGEBD7PDUB2X2XN3/action/replication_record"}},"created_at":"2026-05-18T00:37:50.002589+00:00","updated_at":"2026-05-18T00:37:50.002589+00:00"}