Loading…

On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary

We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2015-03, Vol.61 (3), p.1325-1343
Main Authors: Basciftci, Yuksel Ozan, Gungor, Onur, Koksal, Can Emre, Ozguner, Fusun
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143
cites cdi_FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143
container_end_page 1343
container_issue 3
container_start_page 1325
container_title IEEE transactions on information theory
container_volume 61
creator Basciftci, Yuksel Ozan
Gungor, Onur
Koksal, Can Emre
Ozguner, Fusun
description We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for various possibilities on receiver feedback and show special cases where the bounds are tight. We show that, without any feedback from the receiver, the secrecy capacity is zero if the transmitter-to-adversary channel stochastically dominates the effective transmitter-to-receiver channel. However, the secrecy capacity is nonzero even when the receiver is allowed to feed back only one bit at the end of each block. Our novel achievable strategy improves the rates proposed in the literature for the nonhybrid adversarial model. We also analyze the effect of multiple adversaries and delay constraints on the secrecy capacity. We show that our novel time sharing approach leads to positive secrecy rates even under strict delay constraints.
doi_str_mv 10.1109/TIT.2014.2383397
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_6990618</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6990618</ieee_id><sourcerecordid>3597615681</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143</originalsourceid><addsrcrecordid>eNo9kM1Lw0AQxRdRsFbvgpcFz6k72Y9sjjVYWyj0YMXjstlMbGpN6m4q5L93S4unYYb35j1-hNwDmwCw_Gm9WE9SBmKScs15nl2QEUiZJbmS4pKMGAOd5ELoa3ITwjauQkI6IvNVS_sN0jd0Ht1AC7u3rukH2tX0ede5LzqzVdN-0mJj2xZ3gX40_YZaOh9K31R0Wv2iD9YPt-SqtruAd-c5Ju-zl3UxT5ar10UxXSaOc94nWpQyhTJTWVaClZAxablOswpLiDdRlwxAl1IgIs9rUM4JrDhHTFFrEHxMHk9_9777OWDozbY7-DZGGlBScSUES6OKnVTOdyF4rM3eN9-xpgFmjrxM5GWOvMyZV7Q8nCxNjP6XqzxnCjT_A-LcZFI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1656364402</pqid></control><display><type>article</type><title>On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary</title><source>IEEE Xplore (Online service)</source><creator>Basciftci, Yuksel Ozan ; Gungor, Onur ; Koksal, Can Emre ; Ozguner, Fusun</creator><creatorcontrib>Basciftci, Yuksel Ozan ; Gungor, Onur ; Koksal, Can Emre ; Ozguner, Fusun</creatorcontrib><description>We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for various possibilities on receiver feedback and show special cases where the bounds are tight. We show that, without any feedback from the receiver, the secrecy capacity is zero if the transmitter-to-adversary channel stochastically dominates the effective transmitter-to-receiver channel. However, the secrecy capacity is nonzero even when the receiver is allowed to feed back only one bit at the end of each block. Our novel achievable strategy improves the rates proposed in the literature for the nonhybrid adversarial model. We also analyze the effect of multiple adversaries and delay constraints on the secrecy capacity. We show that our novel time sharing approach leads to positive secrecy rates even under strict delay constraints.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2014.2383397</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Communication channels ; Data transmission ; Decoding ; Delays ; Fading ; Feedback control systems ; Information theory ; Jamming ; Noise ; Receivers ; Receivers &amp; amplifiers ; Transmitters</subject><ispartof>IEEE transactions on information theory, 2015-03, Vol.61 (3), p.1325-1343</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2015</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143</citedby><cites>FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6990618$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Basciftci, Yuksel Ozan</creatorcontrib><creatorcontrib>Gungor, Onur</creatorcontrib><creatorcontrib>Koksal, Can Emre</creatorcontrib><creatorcontrib>Ozguner, Fusun</creatorcontrib><title>On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for various possibilities on receiver feedback and show special cases where the bounds are tight. We show that, without any feedback from the receiver, the secrecy capacity is zero if the transmitter-to-adversary channel stochastically dominates the effective transmitter-to-receiver channel. However, the secrecy capacity is nonzero even when the receiver is allowed to feed back only one bit at the end of each block. Our novel achievable strategy improves the rates proposed in the literature for the nonhybrid adversarial model. We also analyze the effect of multiple adversaries and delay constraints on the secrecy capacity. We show that our novel time sharing approach leads to positive secrecy rates even under strict delay constraints.</description><subject>Communication channels</subject><subject>Data transmission</subject><subject>Decoding</subject><subject>Delays</subject><subject>Fading</subject><subject>Feedback control systems</subject><subject>Information theory</subject><subject>Jamming</subject><subject>Noise</subject><subject>Receivers</subject><subject>Receivers &amp; amplifiers</subject><subject>Transmitters</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNo9kM1Lw0AQxRdRsFbvgpcFz6k72Y9sjjVYWyj0YMXjstlMbGpN6m4q5L93S4unYYb35j1-hNwDmwCw_Gm9WE9SBmKScs15nl2QEUiZJbmS4pKMGAOd5ELoa3ITwjauQkI6IvNVS_sN0jd0Ht1AC7u3rukH2tX0ede5LzqzVdN-0mJj2xZ3gX40_YZaOh9K31R0Wv2iD9YPt-SqtruAd-c5Ju-zl3UxT5ar10UxXSaOc94nWpQyhTJTWVaClZAxablOswpLiDdRlwxAl1IgIs9rUM4JrDhHTFFrEHxMHk9_9777OWDozbY7-DZGGlBScSUES6OKnVTOdyF4rM3eN9-xpgFmjrxM5GWOvMyZV7Q8nCxNjP6XqzxnCjT_A-LcZFI</recordid><startdate>201503</startdate><enddate>201503</enddate><creator>Basciftci, Yuksel Ozan</creator><creator>Gungor, Onur</creator><creator>Koksal, Can Emre</creator><creator>Ozguner, Fusun</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201503</creationdate><title>On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary</title><author>Basciftci, Yuksel Ozan ; Gungor, Onur ; Koksal, Can Emre ; Ozguner, Fusun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Communication channels</topic><topic>Data transmission</topic><topic>Decoding</topic><topic>Delays</topic><topic>Fading</topic><topic>Feedback control systems</topic><topic>Information theory</topic><topic>Jamming</topic><topic>Noise</topic><topic>Receivers</topic><topic>Receivers &amp; amplifiers</topic><topic>Transmitters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Basciftci, Yuksel Ozan</creatorcontrib><creatorcontrib>Gungor, Onur</creatorcontrib><creatorcontrib>Koksal, Can Emre</creatorcontrib><creatorcontrib>Ozguner, Fusun</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore (Online service)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Basciftci, Yuksel Ozan</au><au>Gungor, Onur</au><au>Koksal, Can Emre</au><au>Ozguner, Fusun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2015-03</date><risdate>2015</risdate><volume>61</volume><issue>3</issue><spage>1325</spage><epage>1343</epage><pages>1325-1343</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-receiver channel. We provide bounds to the secrecy capacity for various possibilities on receiver feedback and show special cases where the bounds are tight. We show that, without any feedback from the receiver, the secrecy capacity is zero if the transmitter-to-adversary channel stochastically dominates the effective transmitter-to-receiver channel. However, the secrecy capacity is nonzero even when the receiver is allowed to feed back only one bit at the end of each block. Our novel achievable strategy improves the rates proposed in the literature for the nonhybrid adversarial model. We also analyze the effect of multiple adversaries and delay constraints on the secrecy capacity. We show that our novel time sharing approach leads to positive secrecy rates even under strict delay constraints.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2014.2383397</doi><tpages>19</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2015-03, Vol.61 (3), p.1325-1343
issn 0018-9448
1557-9654
language eng
recordid cdi_ieee_primary_6990618
source IEEE Xplore (Online service)
subjects Communication channels
Data transmission
Decoding
Delays
Fading
Feedback control systems
Information theory
Jamming
Noise
Receivers
Receivers & amplifiers
Transmitters
title On the Secrecy Capacity of Block Fading Channels With a Hybrid Adversary
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T09%3A31%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Secrecy%20Capacity%20of%20Block%20Fading%20Channels%20With%20a%20Hybrid%20Adversary&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Basciftci,%20Yuksel%20Ozan&rft.date=2015-03&rft.volume=61&rft.issue=3&rft.spage=1325&rft.epage=1343&rft.pages=1325-1343&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2014.2383397&rft_dat=%3Cproquest_ieee_%3E3597615681%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c333t-84b521b7677b1a51705a3827deb16774fb0118b54eee39f16cc4ed33ee2e88143%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1656364402&rft_id=info:pmid/&rft_ieee_id=6990618&rfr_iscdi=true