{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H53Z7UPEF5BY4CNCJLM4JW6EZ2","short_pith_number":"pith:H53Z7UPE","schema_version":"1.0","canonical_sha256":"3f779fd1e42f438e09a24ad9c4dbc4cea7da7c77cd5206632a35214272e970b3","source":{"kind":"arxiv","id":"1706.03444","version":1},"attestation_state":"computed","paper":{"title":"Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed El Shafie, Ahmed Sultan, Asma Mabrouk, Kamel Tourki, Naofal Al-Dhahir","submitted_at":"2017-06-12T02:51:12Z","abstract_excerpt":"This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a f"},"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":"1706.03444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T02:51:12Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"ee39e68cb6298d7ea9c6a81524e6e270c00740d47b8bd1891397fb80cacbe427","abstract_canon_sha256":"402eaf61f116a7242580104363ac25351c1bd18f8a19e6ca2a2c6cbf3d950e27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.665525Z","signature_b64":"ewcE0Nl8KEmgvv2vWUaIbl24/LHxeH6qdAxnKZTFVDLq6ZwcTqoU1CLlmsu/5/bF5lsIiWUxAot6v+cyTxKFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f779fd1e42f438e09a24ad9c4dbc4cea7da7c77cd5206632a35214272e970b3","last_reissued_at":"2026-05-18T00:42:35.665024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.665024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret-Key-Aided Scheme for Securing Untrusted DF Relaying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed El Shafie, Ahmed Sultan, Asma Mabrouk, Kamel Tourki, Naofal Al-Dhahir","submitted_at":"2017-06-12T02:51:12Z","abstract_excerpt":"This paper proposes a new scheme to secure the transmissions in an untrusted decode-and-forward (DF) relaying network. A legitimate source node, Alice, sends her data to a legitimate destination node, Bob, with the aid of an untrusted DF relay node, Charlie. To secure the transmissions from Charlie during relaying time slots, each data codeword is secured using a secret-key codeword that has been previously shared between Alice and Bob during the perfectly secured time slots (i.e., when the channel secrecy rate is positive). The secret-key bits exchanged between Alice and Bob are stored in a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03444","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":"1706.03444","created_at":"2026-05-18T00:42:35.665094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03444v1","created_at":"2026-05-18T00:42:35.665094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03444","created_at":"2026-05-18T00:42:35.665094+00:00"},{"alias_kind":"pith_short_12","alias_value":"H53Z7UPEF5BY","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H53Z7UPEF5BY4CNC","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H53Z7UPE","created_at":"2026-05-18T12:31:18.294218+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/H53Z7UPEF5BY4CNCJLM4JW6EZ2","json":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2.json","graph_json":"https://pith.science/api/pith-number/H53Z7UPEF5BY4CNCJLM4JW6EZ2/graph.json","events_json":"https://pith.science/api/pith-number/H53Z7UPEF5BY4CNCJLM4JW6EZ2/events.json","paper":"https://pith.science/paper/H53Z7UPE"},"agent_actions":{"view_html":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2","download_json":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2.json","view_paper":"https://pith.science/paper/H53Z7UPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03444&json=true","fetch_graph":"https://pith.science/api/pith-number/H53Z7UPEF5BY4CNCJLM4JW6EZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/H53Z7UPEF5BY4CNCJLM4JW6EZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2/action/storage_attestation","attest_author":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2/action/author_attestation","sign_citation":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2/action/citation_signature","submit_replication":"https://pith.science/pith/H53Z7UPEF5BY4CNCJLM4JW6EZ2/action/replication_record"}},"created_at":"2026-05-18T00:42:35.665094+00:00","updated_at":"2026-05-18T00:42:35.665094+00:00"}