{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VD7CJUQJG5UFGWMN3FMLLZFJ4U","short_pith_number":"pith:VD7CJUQJ","schema_version":"1.0","canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","source":{"kind":"arxiv","id":"1701.04371","version":1},"attestation_state":"computed","paper":{"title":"On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ali Ghrayeb, Chadi Assi, Mazen O. Hasna, Mohaned Chraiti","submitted_at":"2017-01-12T10:45:05Z","abstract_excerpt":"Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N-antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario where there is no relation between "},"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":"1701.04371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-12T10:45:05Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"00ff382ba909534583d2ed0e9a92cff6429877ac93d0bffa8f05b726996d11e5","abstract_canon_sha256":"0164778b5ac5264c1ac15fbb2a2f1a2fa0436f605f23f12f46b25e7ba82e5c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:44.794590Z","signature_b64":"W+tykqmbM3fS38YYXMn09GeI28MnI+uIRyrb4GVk+0DkurqzL/ASXkD3PijncfkynXjp9V2d9N1uzqXyopFRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fe24d209376853598dd958b5e4a9e534c36c8ec29bc24722394422d29207e4","last_reissued_at":"2026-05-18T00:52:44.794010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:44.794010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Achievable Secrecy Diversity of Cooperative Networks with Untrusted Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Ali Ghrayeb, Chadi Assi, Mazen O. Hasna, Mohaned Chraiti","submitted_at":"2017-01-12T10:45:05Z","abstract_excerpt":"Cooperative relaying is often deployed to enhance the communication reliability (i.e., diversity order) and consequently the end-to-end achievable rate. However, this raises several security concerns when the relays are untrusted since they may have access to the relayed message. In this paper, we study the achievable secrecy diversity order of cooperative networks with untrusted relays. In particular, we consider a network with an N-antenna transmitter (Alice), K single-antenna relays, and a single-antenna destination (Bob). We consider the general scenario where there is no relation between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04371","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":"1701.04371","created_at":"2026-05-18T00:52:44.794114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04371v1","created_at":"2026-05-18T00:52:44.794114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04371","created_at":"2026-05-18T00:52:44.794114+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD7CJUQJG5UF","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD7CJUQJG5UFGWMN","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD7CJUQJ","created_at":"2026-05-18T12:31:49.984773+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/VD7CJUQJG5UFGWMN3FMLLZFJ4U","json":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U.json","graph_json":"https://pith.science/api/pith-number/VD7CJUQJG5UFGWMN3FMLLZFJ4U/graph.json","events_json":"https://pith.science/api/pith-number/VD7CJUQJG5UFGWMN3FMLLZFJ4U/events.json","paper":"https://pith.science/paper/VD7CJUQJ"},"agent_actions":{"view_html":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U","download_json":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U.json","view_paper":"https://pith.science/paper/VD7CJUQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04371&json=true","fetch_graph":"https://pith.science/api/pith-number/VD7CJUQJG5UFGWMN3FMLLZFJ4U/graph.json","fetch_events":"https://pith.science/api/pith-number/VD7CJUQJG5UFGWMN3FMLLZFJ4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/action/storage_attestation","attest_author":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/action/author_attestation","sign_citation":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/action/citation_signature","submit_replication":"https://pith.science/pith/VD7CJUQJG5UFGWMN3FMLLZFJ4U/action/replication_record"}},"created_at":"2026-05-18T00:52:44.794114+00:00","updated_at":"2026-05-18T00:52:44.794114+00:00"}