{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W4TMO6CMGYZDQNRGHF5VDQ22C6","short_pith_number":"pith:W4TMO6CM","schema_version":"1.0","canonical_sha256":"b726c7784c3632383626397b51c35a179d05bb4e76d82a15d364dcaec0911179","source":{"kind":"arxiv","id":"1505.01374","version":3},"attestation_state":"computed","paper":{"title":"Enhancing Secrecy Rates in a wiretap channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shahid M. Shah, Vinod Sharma","submitted_at":"2015-05-06T14:11:39Z","abstract_excerpt":"Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To mitigate the loss in the secrecy rate, we propose a coding scheme where we use sufficiently old messages as key and for this scheme prove that multiple messages are secure with respect to (w.r.t.) all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next we consider a fading wiretap channel with fu"},"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":"1505.01374","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T14:11:39Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"109d55dcaebfe5ac7c908706e025578dad3ccf0fdcc3a46c74cf1b7549a6e135","abstract_canon_sha256":"3f669f49315d1a673bc65c325f1450a49f46dccfb20d8c16f97019586b5f3793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:57.826187Z","signature_b64":"ihrsGWtMz5VlhuYfYvlJuAOLXm5+JVDR8xV4DxrG1DYiZC7Z41fGVlsoc2m8iJzuJhluv8uZE+T5PH5oeIVEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b726c7784c3632383626397b51c35a179d05bb4e76d82a15d364dcaec0911179","last_reissued_at":"2026-05-18T00:50:57.825547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:57.825547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Secrecy Rates in a wiretap channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shahid M. Shah, Vinod Sharma","submitted_at":"2015-05-06T14:11:39Z","abstract_excerpt":"Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To mitigate the loss in the secrecy rate, we propose a coding scheme where we use sufficiently old messages as key and for this scheme prove that multiple messages are secure with respect to (w.r.t.) all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next we consider a fading wiretap channel with fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01374","kind":"arxiv","version":3},"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":"1505.01374","created_at":"2026-05-18T00:50:57.825643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01374v3","created_at":"2026-05-18T00:50:57.825643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01374","created_at":"2026-05-18T00:50:57.825643+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4TMO6CMGYZD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4TMO6CMGYZDQNRG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4TMO6CM","created_at":"2026-05-18T12:29:47.479230+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/W4TMO6CMGYZDQNRGHF5VDQ22C6","json":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6.json","graph_json":"https://pith.science/api/pith-number/W4TMO6CMGYZDQNRGHF5VDQ22C6/graph.json","events_json":"https://pith.science/api/pith-number/W4TMO6CMGYZDQNRGHF5VDQ22C6/events.json","paper":"https://pith.science/paper/W4TMO6CM"},"agent_actions":{"view_html":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6","download_json":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6.json","view_paper":"https://pith.science/paper/W4TMO6CM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01374&json=true","fetch_graph":"https://pith.science/api/pith-number/W4TMO6CMGYZDQNRGHF5VDQ22C6/graph.json","fetch_events":"https://pith.science/api/pith-number/W4TMO6CMGYZDQNRGHF5VDQ22C6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6/action/storage_attestation","attest_author":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6/action/author_attestation","sign_citation":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6/action/citation_signature","submit_replication":"https://pith.science/pith/W4TMO6CMGYZDQNRGHF5VDQ22C6/action/replication_record"}},"created_at":"2026-05-18T00:50:57.825643+00:00","updated_at":"2026-05-18T00:50:57.825643+00:00"}