Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

European Signal Processing Conference (EUSIPCO)

Secrecy Rate Optimization For A Mimo Secrecy Channel Based On Stackelberg Game

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding, Martin Johnston, Stéphane Y. Le Goff

Published Sep 1, 2014• 11 citations
Publisher

Abstract

Publication in the conference proceedings of EUSIPCO, Lisbon, Portugal, 2014
DOI
10.5281/zenodo.43755

Related papers

Secrecy Rate Optimization for the Power Beacon-Assisted Secrecy Network Based on Stackelberg Game

MahmudaAkter Keya, Long Jiao, Yao Ge +2 more

Communications in computer and information science•Jan 1, 2024•0 citations

High-Precision Ldpc Codes Decoding At The Lowest Complexity

Luca Fanucci, L''Insalata, Nicola, Francesco Rossi +1 more

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 2006

European Signal Processing Conference (EUSIPCO)•Sep 4, 2006•6 citations

Fast secrecy rate optimization for MIMO wiretap channels in the presence of a multiple-antenna eavesdropper

Linhui Fan, Bo Tang, Qiuxi Jiang

Signal Processing•Sep 9, 2020•3 citations

Secrecy rate optimization for a MIMO secrecy channel based on Stackelberg game

Z Chu, Kanapathippillai Cuma, Zhiguo Ding +2 more

© 2014 EURASIP.In this paper, we consider a multi-input-multi-output (MIMO) wiretap channel with a multi-antenna eavesdropper, where a private cooperative jammer is employed to improve the achievable secrecy rate. The legitimate user pays the legitimate transmitter for its secured communication based on the achieved secrecy rate. We first approximate the legitimate transmitter covariance matrix by employing Taylor series expansion, then this secrecy rate problem can be formulated into a Stackelberg game based on a fixed covariance matrix of the transmitter, where the transmitter and the jammer try to maximize their revenues. This secrecy rate maximization problem is formulated into a Stackelberg game where the jammer and the transmitter are the leader and follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results are provided to show that the revenue functions of the legitimate user and the jammer are concave functions and the Stackelberg equilibrium solution has been validated.

•Sep 1, 2014•0 citations

Embedding Quantum Cryptography On Dsp-Boards

Florian Schupfer, Gerhard Humer, Thomas Lorünser +1 more

Publication in the conference proceedings of EUSIPCO, Viena, Austria, 2004

•Sep 6, 2004•1 citation

Secrecy rate region maximization for multi-user MIMO systems with artificial noise and service integration

Mei Weidong, Chen Zhi, Jun Fang

IEEE Conference Proceedings•Jan 1, 2016•0 citations
© 2014 EURASIP.In this paper, we consider a multi-input-multi-output (MIMO) wiretap channel with a multi-antenna eavesdropper, where a private cooperative jammer is employed to improve the achievable secrecy rate. The legitimate user pays the legitimate transmitter for its secured communication based on the achieved secrecy rate. We first approximate the legitimate transmitter covariance matrix by employing Taylor series expansion, then this secrecy rate problem can be formulated into a Stackelberg game based on a fixed covariance matrix of the transmitter, where the transmitter and the jammer try to maximize their revenues. This secrecy rate maximization problem is formulated into a Stackelberg game where the jammer and the transmitter are the leader and follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results are provided to show that the revenue functions of the legitimate user and the jammer are concave functions and the Stackelberg equilibrium solution has been validated.