Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Secure Communication Game With a Relay Helping the Eavesdropper
Download
index.pdf
Date
2011-09-01
Author
Yüksel Turgut, Ayşe Melda
Liu, Xi
Erkip, Elza
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
71
views
34
downloads
Cite This
In this work, a four-terminal complex Gaussian network composed of a source, a destination, an eavesdropper, and a jammer relay is studied under two different set of assumptions: 1) The jammer relay does not hear the source transmission, and 2) The jammer relay is causally given the source message. In both cases, the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, noncooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdfs) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.
Subject Keywords
Eavesdropping
,
jamming
,
physical layer security
,
relay channel
,
wire-tap channel
,
CHANNELS
URI
https://hdl.handle.net/11511/96447
Journal
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
DOI
https://doi.org/10.1109/tifs.2011.2125956
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
A Secure Communication Game with a Relay Helping the Eavesdropper
Yüksel Turgut, Ayşe Melda; Liu, Xi; Erkip, Elza (2009-01-01)
In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved se...
A Secrecy Game with an Informed Jammer Relay
Yüksel Turgut, Ayşe Melda; Liu, Xi; Erkip, Elza (2010-01-01)
A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message. The source aims to increase the achievable secrecy rates, whereas the jammer relay aims to decrease it. To help the eavesdropper and to decrease achievable perfect secrecy rates, the jammer relay can use pure relaying and/or send interference to assist eavesdropping. The problem is formulated as a zero-sum game and the saddle poi...
On the Carrier Frequency Offset Estimation for Frequency Hopping Burst Mode Mobile Radio
Güvensen, Gökhan Muzaffer; Tanık, Yalçın; Yılmaz, Ali Özgür (2010-11-03)
In this paper, we evaluate the Cramer-Rao bounds (CRB) for the estimation of the carrier frequency offset (CFO) for general QAM modulations with no knowledge of the transmitted sequence (blind operation) in frequency hopping (FH) based short burst mode mobile radios. We investigate the blind CFO estimation problem in FH based mobile system that uses multiple short narrowband bursts in different frequency channels for the transmission of one packet. Joint blind channel and CFO estimation over multiple freque...
A numerical solution of the steady MHD flow through infinite strips with BEM
Bozkaya, Canan; Tezer, Münevver (2012-04-01)
The magnetohydrodynamic (MHD) flow of an incompressible, viscous, electrically conducting fluid in infinite channels in the presence of a magnetic field is investigated. The fluid is driven either by a pressure gradient or by the currents produced by electrodes placed parallel in the middle of the walls. The applied magnetic field is perpendicular to the infinite walls which are combined from conducting and insulated parts. A boundary element method (BEM) solution has been obtained by using a fundamental so...
A new technique for line interference monitoring and reduction in biopotential amplifiers
Ider, Yusuf Ziya; Koymen, H. (Institute of Electrical and Electronics Engineers (IEEE), 1990-6)
Hardware developed to record the common mode line frequency signal on the body simultaneously with the ECG lead signals of a 15-channel computerized cardiograph is described. This interference reference signal and its quadrature, obtained by software, are linearly combined to be subtracted from any one of the channels to reduce the interference to below the quantization level of the 12 b A/D converter. Coefficients of the linear combination are estimated using linear regression, which is applied to the rela...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. M. Yüksel Turgut, X. Liu, and E. Erkip, “A Secure Communication Game With a Relay Helping the Eavesdropper,”
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
, vol. 6, no. 3, pp. 818–830, 2011, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/96447.