Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/1689499.1689536guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Physical layer security game: how to date a girl with her boyfriend on the same table

Published: 13 May 2009 Publication History

Abstract

Physical layer security is an emerging security concept that achieves perfect secrecy data transmission between the intended network nodes, while the eavesdropping malicious nodes obtain zero information. The so-called secrecy capacity can be improved using friendly jammers that introduce extra interference to the eavesdropping malicious nodes while the interference to the intended destination is limited. In this paper, we investigate the interaction between the source that transmits the desired data and friendly jammers who assist the source by "disguising" the eavesdropper. In order to obtain a distributed solution, we introduce a game theoretic approach. The game is defined in such a way that the source pays the friendly jammers to interfere the eavesdropper, and, therefore, increasing its secrecy capacity. Friendly jammers charge the source with a certain price for this "jamming servise". There is a tradeoff for the price: If the price is too low, the profit of the jammers is low; and if the price is too high, the source would not buy the "service" (jamming power) or would buy it from other jammers. To analyze the game outcome, we define and investigate a Stackelberg game and construct a distributed algorithm. Our analysis and simulation results show the effectiveness of friendly jamming and the tradeoff for setting the price. The fancy title comes from the fact that it is similar to a scenario where the main fellow character (the source) tries to send a dating message to a lady (the intended destination), whose "poor" boyfriend plays the role of the eavesdropper that may hear the message. Friends of the source, the so-called "friendly jammers," try to distract the boyfriend, so that the dating message can be secretly transmitted. The game is defined in order to derive what is the optimal price that the friends can charge for this "friendly" action.

References

[1]
A. D. Wyner, "The wire-tap channel," Bell System Technical Journal, vol. 54, no. 8, pp. 1355-1387, 1975.
[2]
S. K. Leung-Yan-Cheong and M. E. Hellman, "The Gaussian wiretap channel," IEEE Transactions on Information Theory, vol. 24, no. 4, pp. 451-456, July 1978.
[3]
I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 339-348, May 1978.
[4]
A. O. Hero, "Secure space-time communication," IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3235-3249, December 2003.
[5]
S. K. Leung-Yan-Cheong and M. E. Hellman, "The Gaussian wiretap channel," IEEE Transactions on Information Theory, vol. 24, pp. 451-456, July 1978.
[6]
Z. Li, W. Trappe and R. Yates, "Secret communication via multi-antenna transmission," in Proc. of 41st Conference on Information Sciences and Systems, Baltimore, MD, pp. 905-910, March 2007.
[7]
R. Negi and S. Goelm "Secret communication using artificial noise," in Proc. of IEEE Vehicular Technology Conference, vol. 3, pp. 1906-1910, Dallas, TX, September 2005.
[8]
P. Parada and R. Blahut, "Secrecy capacity of SIMO and slow fading channels," in Proc. of IEEE International Symposium on Information Theory, Adelaide, Australia, pp. 2152-2155, September 2005.
[9]
S. Shafiee and S. Ulukus, "Achievable rates in Gaussian MISO channels with secrecy constraints," in Proc. of IEEE International Symposium on Information Theory, Nice, France, pp. 2466-2470 June 2007.
[10]
Y. Liang, H. V. Poor, and S. Shamai (Shitz), "Secure communication over fading channels," IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2470-2492, June 2008.
[11]
P. K. Gopala, L. Lai, and H. El Gamal, "On the secrecy capacity of fading channels," IEEE Transactions on Information Theory, to appear, can be found at http://arxiv.org/PS_cache/cs/pdf/ 0610/0610103v1.pdf.
[12]
L. Dong, Z. Han, A. P. Petropulu, and H. V. Poor, "Secure collaborative beamforming," in Proc. of Allerton Conference on Communication, Control, and Computing, Allerton, IL, October 2008.
[13]
R. Liu, T. Liu, H. V. Poor, and S. Shamai (Shitz), "Multiple-Input Multiple-Output Gaussian broadcast channels with confidential messages," http://arxiv.org/PS{\_}cache/arxiv/pdf/0903/0903.3786v1.pdf.
[14]
V. Aggarwal, L. Sankar, A. R. Calderbank, and H. V.Poor, "Secrecy capacity of a class of orthogonal relay eavesdropper channels," http://arxiv.org/PS{\_}cache/arxiv/pdf/0812/0812.2275v1.pdf.
[15]
A. Kashyap, T. Basar, and R. Srikant, "Correlated jamming on MIMO Gaussian fading channels," IEEE Transactions on Information Theory, vol. 50, no. 9, pp. 2119-2123, September 2004.
[16]
S. Shafiee and S. Ulukus, "Mutual information games in multiuser channels with correlated jamming," http://arxiv.org/abs/ cs.IT/0601110.
[17]
M. H. Brady, M. Mohseni, and J. M. Cioffi, "Spatially-correlated jamming in gaussian multiple access and broadcast channels," in Proc. of 40th Annual Conference on Information Sciences and Systems, Princeton, NJ, pp. 1635-1639, March 2006.
[18]
L. Lai and H. El Gamal, "The relay-eavesdropper channel: Cooperation for secrecy," IEEE Transactions on Information Theory, to appear, http://arxiv.org/PS_cache/cs/pdf/0612/ 0612044v1.pdf.
[19]
D. Fudenberg and J. Tirole, Game theory, MIT Press, Cambridge, MA, 1991.
[20]
I. N. Stewart, Galois Theory, 3rd. ed., Chapman & Hall/CRC Mathematics, Boca Raton, FL, 2004.
[21]
C. U. Saraydar, N. B. Mandayam, and D. J. Goodman, "Efficient power control via pricing in wireless data networks", IEEE Transations on Communications, vol. 50, no. 2, pp. 291-303, Feburary 2002.
[22]
G. Scutari, S. Barbarossa, and D. P. Palomar, "Potential games: A framework for vector power control problems with coupled constraints," in Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP), Toulouse, France, vol. 4, pp. 241-244, May 2006.
[23]
B. Wang, Z. Han, and K. J. R. Liu, "Distributed relay selection and power control for multiuser cooperative communication networks using buyer / seller Game," in Proc. of Annual IEEE Conference on Computer Communications, INFOCOM, Anchorage, AK, pp. 544-552, May 2007.
[24]
N. Bonneau, M. Debbah, E. Altman, and A. Hjørungnes, "Nonatomic games for multi-user systems," IEEE Journal on Selected Areas in Communications, issue on "Game Theory in Communication Systems," vol. 26, no. 7, pp. 1047-1058, September 2008.
[25]
R. Yates, "A framework for uplink power control in cellular radio systems," IEEE Journals on Selected Areas on Commununications, vol. 13, no. 7, pp. 1341-1348, September 1995.
[26]
S. Boyd and L. Vandenberghe, Convex optimization, Cambridge University Press, 2006.
[27]
Z. Han and K. J. R. Liu, Resource Allocation for Wireless Networks: Basics, Techniques, and Applications, Cambridge University Press, UK, April, 2008.

Cited By

View all
  • (2017)Pareto Optimal Security Resource Allocation for Internet of ThingsACM Transactions on Privacy and Security10.1145/313929320:4(1-30)Online publication date: 24-Oct-2017
  • (2016)Playing with SybilACM SIGAPP Applied Computing Review10.1145/2993231.299323316:2(16-25)Online publication date: 29-Aug-2016
  • (2016)Preserving Location Privacy in Radio Networks Using a Stackelberg Game FrameworkProceedings of the 12th ACM Symposium on QoS and Security for Wireless and Mobile Networks10.1145/2988272.2988277(29-37)Online publication date: 13-Nov-2016
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
GameNets'09: Proceedings of the First ICST international conference on Game Theory for Networks
May 2009
719 pages
ISBN:9781424441761

Publisher

IEEE Press

Publication History

Published: 13 May 2009

Author Tags

  1. game theory
  2. jamming
  3. physical layer security
  4. secrecy capacity
  5. stackelberg game

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2017)Pareto Optimal Security Resource Allocation for Internet of ThingsACM Transactions on Privacy and Security10.1145/313929320:4(1-30)Online publication date: 24-Oct-2017
  • (2016)Playing with SybilACM SIGAPP Applied Computing Review10.1145/2993231.299323316:2(16-25)Online publication date: 29-Aug-2016
  • (2016)Preserving Location Privacy in Radio Networks Using a Stackelberg Game FrameworkProceedings of the 12th ACM Symposium on QoS and Security for Wireless and Mobile Networks10.1145/2988272.2988277(29-37)Online publication date: 13-Nov-2016
  • (2016)Solving sybil attacks using evolutionary game theoryProceedings of the 31st Annual ACM Symposium on Applied Computing10.1145/2851613.2851848(2195-2201)Online publication date: 4-Apr-2016
  • (2015)Pareto-Optimal Adversarial Defense of Enterprise SystemsACM Transactions on Information and System Security10.1145/269990717:3(1-39)Online publication date: 9-Mar-2015
  • (2014)Power napping with loud neighborsProceedings of the 2014 ACM conference on Security and privacy in wireless & mobile networks10.1145/2627393.2627406(117-128)Online publication date: 23-Jul-2014
  • (2013)Game theory meets network security and privacyACM Computing Surveys10.1145/2480741.248074245:3(1-39)Online publication date: 3-Jul-2013
  • (2011)Power allocation in team jamming games in wireless ad hoc networksProceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools10.5555/2151688.2151748(515-524)Online publication date: 16-May-2011

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media