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

arXiv:1612.05552 · IEEE Transactions on Automatic Control

Secure Estimation and Zero-Error Secrecy Capacity

Moritz Wiese, Tobias J. Oechtering, Karl Henrik Johansson, Panos Papadimitratos, Henrik Sandberg, Mikael Skoglund

Published Jun 21, 2018• 34 citations
arXivHTMLPDF

Abstract

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel, which is subject to nonstochastic disturbances as well, and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block encodes the states in such a way that, upon sending the generated codeword, the estimator's error is bounded and a security criterion is satisfied, thereby ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered and discussed with the help of a numerical example. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from the encoder to the estimator and the uncertain channel from the encoder to the eavesdropper is derived, which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. Finally, the zero-error secrecy capacity of uncertain wiretap channels is studied.

DOI
10.1109/tac.2018.2849620

Related papers

Secrecy capacity of wiretap channels with the bit error rate criterion

Ryutaroh Matsumoto

The coding problem over wiretap channels is to realize an encoder and a decoder such that the legitimate receiver can correctly decode transmitted secret messages while the eavesdropper knows little about the secret messages. Traditionally, the secrecy of messages to the eavesdropper has been measured in terms of mutual information. Recently, several researches on the wiretap channels employ the bit error rate after decoding by the eavesdropper as a secrecy measure. In this note, we show that the secrecy capacity with respect to the bit error rate criterion is different from that with the traditional mutual information criterion. In addition to that, the encoder can be deterministic for the bit error rate criterion, while it must be stochastic for the mutual information criterion.

IEICE Communications Express•Jan 1, 2016•0 citations

Wiretap Channel With Causal State Information and Secure Rate-Limited Feedback

Alejandro Cohen, Asaf Cohen

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and the legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We derive upper and lower bounds on the secrecy capacity and show that, when the channel to the eavesdropper is degraded, the bounds are tight and the secrecy capacity is completely characterized. The capacity achieving scheme is based on Wyner, Csiszár, and Körner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. The upper bound is more involved and requires a nontrivial recursive lemma extending previous results in the literature to include both state and feedback. We conclude the paper by showing that a few interesting known results can be seen as special cases of the above, as well as discussing the case where the source of local randomness at the encoder is limited.

arXiv:1308.6736•IEEE Transactions on Communications•Jan 7, 2016•25 citations

Optimal parameter encoding strategies for estimation theoretic secure communications

Çağrı Göken

Physical layer security has gained a renewed interest with the advances in modern wireless communication technologies. In estimation theoretic security, secrecy levels are measured via estimation theoretic tools and metrics, such as mean-squared error (MSE), where the objective is to perform accurate estimation of the parameter at the intended receiver while keeping the estimation error at the eavesdropper above a certain level. This framework proves useful both for analyzing the achievable performance under security constraints in parameter estimation problems, and for designing low-complexity, practical methods to enhance security in communication systems. In this dissertation, we investigate optimal deterministic encoding of random scalar and vector parameters in the presence of an eavesdropper, who is unaware of the encoding operation. We also analyze optimal stochastic encoding of a random parameter under secrecy constraints in a Gaussian wiretap channel model, where the eavesdropper is aware of the encoding strategy at the transmitter. In addition, we perform optimal parameter design for secure broadcast of a parameter to multiple receivers with fixed estimators. First, optimal deterministic encoding of a scalar parameter is investigated in the presence of an eavesdropper. The aim is to minimize the expectation of the conditional Cram´er-Rao bound (ECRB) at the intended receiver while keeping the MSE at the eavesdropper above a certain threshold. The eavesdropper is modeled to employ the linear minimum mean-squared error (LMMSE) estimator based on the encoded version of the parameter. First, the optimal encoding function is derived in the absence of secrecy constraints for any given prior distribution on the parameter. Next, an optimization problem is formulated under a secrecy constraint and various solution approaches are proposed. Also, theoretical results on the form of the optimal encoding function are provided. Furthermore, a robust parameter encoding approach is developed. In this case, the objective is to maximize the worst-case Fisher information of the parameter at the intended receiver while keeping the MSE at the eavesdropper above a certain level. The optimal encoding function is derived when there exist no secrecy constraints. Next, to obtain the solution of the problem in the presence of the secrecy constraint, the form of the encoding function that maximizes the MSE at the eavesdropper is explicitly derived for any given level of worst-case Fisher information. Then, based on this result, a low-complexity algorithm is provided to calculate the optimal encoding function for the given secrecy constraint. Numerical examples are presented to illustrate the theoretical results for both the ECRB and worst-case Fisher information based designs. Second, optimal deterministic encoding of a vector parameter is investigated in the presence of an eavesdropper. The objective is to minimize the ECRB at the intended receiver while satisfying an individual secrecy constraint on the MSE of estimating each parameter at the eavesdropper. The eavesdropper is modeled to employ the LMMSE estimator based on the noisy observation of the encoded parameter without being aware of encoding. First, the problem is formulated as a constrained optimization problem in the space of vector-valued functions. Then, two practical solution strategies are developed based on nonlinear individual encoding and affine joint encoding of parameters. Theoretical results on the solutions of the proposed strategies are provided for various scenarios on channel conditions and parameter distributions. Finally, numerical examples are presented to illustrate the performance of the proposed solution approaches. Third, estimation theoretic secure transmission of a scalar random parameter is investigated in the presence of an eavesdropper. The aim is to minimize the estimation error at the receiver under a secrecy constraint at the eavesdropper; or, alternatively, to maximize the estimation error at the eavesdropper for a given estimation accuracy limit at the receiver. In the considered setting, the encoder at the transmitter is allowed to use a randomized mapping between two one-to-one and continuous functions and the eavesdropper is fully aware of the encoding strategy at the transmitter. For small numbers of observations, both the eavesdropper and the receiver are modeled to employ LMMSE estimators, and for large numbers of observations, the ECRB metric is employed for both the receiver and the eavesdropper. Optimization problems are formulated and various theoretical results are provided in order to obtain the optimal solutions and to analyze the effects of encoder randomization. In addition, numerical examples are presented to corroborate the theoretical results. It is observed that stochastic encoding can bring significant performance gains for estimation theoretic secrecy problems. Finally, estimation theoretic secure broadcast of a random parameter is investigated. In the considered setting, each receiver device employs a fixed estimator and carries a certain security risk such that its decision can be available to a malicious third party with a certain probability. The encoder at the transmitter is allowed to use a random mapping to minimize the weighted sum of the conditional Bayes risks of the estimators under secrecy and average power constraints. After formulating the optimal parameter design problem, it is shown that the optimization problem can be solved individually for each parameter value and the optimal mapping at the transmitter involves a randomization among at most three different signal levels. Sufficient conditions for improvability and nonimprovability of the deterministic design via stochastic encoding are obtained. Numerical examples are provided to corroborate the theoretical results.

•Dec 1, 2019•0 citations

On the ergodic secrecy capacity of the wiretap channel under imperfect main channel estimation

Zouheir Rezki, Ashish J. Khisti, Mohamed‐Slim Alouini

The ergodic secrecy capacity of the wiretap channel is known when the main channel (between the transmitter and the legitimate receiver) state information (CSI) is perfect at the transmitter and the coherence period is sufficiently large to enable random coding arguments in each block. In a fast fading scenario, when the codeword length spans many coherence periods, the secrecy capacity is still not known. In this paper, we present a framework that characterizes this secrecy capacity under imperfect main channel estimation at the transmitter. Inner and outer bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate is a simple on-off scheme using a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and the eavesdropper channels. The upper and the lower bounds coincide with recently derived ones in the perfect main CSI extreme. Furthermore, the lower bound matches the upper bound in no main CSI extreme, where the secrecy capacity is equal to zero. Numerical results are provided for independent identically distributed (i.i.d.) Rayleigh fading channels.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•20 citations

Wiretap channel with causal state information and secure rate-limited feedback

Alejandro Cohen, Asaf Cohen

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We shown that the secrecy capacity is bounded by Cs ≥ max {p(u|v) p(x|u,v)max min{I(U;Y|v) - I(U;Z|V) + H(V|Z) + Rf, I(U;Y|V)},p(u)p(x|u,v)max min{H(V|Z,U) + Rf, I(U;Y|V)}}. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2013•1 citation

Strong secrecy capacity of the wiretap channel II with DMC main channel

Dan Nong He, Yuan Luo, Ning Cai

This paper considers an extension of wiretap channel II, where the source message W is transmitted to the legitimate receiver via a discrete memoryless main channel (DMC). Receiving YN, the receiver needs to recover W with small error probability. Meanwhile, an eavesdropper is able to observe arbitrary subsequence of YNwith size μ = Nα, where 0 <; α <; 1 is a constant real number. The encoding-decoding scheme is designed to satisfy a strong secrecy criterion, i.e. the information of each block (instead of each bit) exposed to the eavesdropper is negligible or arbitrarily close to 0 when N is sufficiently large. We focus on the secrecy capacity of this model.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•9 citations
We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel, which is subject to nonstochastic disturbances as well, and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block encodes the states in such a way that, upon sending the generated codeword, the estimator's error is bounded and a security criterion is satisfied, thereby ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered and discussed with the help of a numerical example. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from the encoder to the estimator and the uncertain channel from the encoder to the eavesdropper is derived, which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. Finally, the zero-error secrecy capacity of uncertain wiretap channels is studied.
The coding problem over wiretap channels is to realize an encoder and a decoder such that the legitimate receiver can correctly decode transmitted secret messages while the eavesdropper knows little about the secret messages. Traditionally, the secrecy of messages to the eavesdropper has been measured in terms of mutual information. Recently, several researches on the wiretap channels employ the bit error rate after decoding by the eavesdropper as a secrecy measure. In this note, we show that the secrecy capacity with respect to the bit error rate criterion is different from that with the traditional mutual information criterion. In addition to that, the encoder can be deterministic for the bit error rate criterion, while it must be stochastic for the mutual information criterion.
In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and the legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We derive upper and lower bounds on the secrecy capacity and show that, when the channel to the eavesdropper is degraded, the bounds are tight and the secrecy capacity is completely characterized. The capacity achieving scheme is based on Wyner, Csiszár, and Körner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. The upper bound is more involved and requires a nontrivial recursive lemma extending previous results in the literature to include both state and feedback. We conclude the paper by showing that a few interesting known results can be seen as special cases of the above, as well as discussing the case where the source of local randomness at the encoder is limited.
Physical layer security has gained a renewed interest with the advances in modern wireless communication technologies. In estimation theoretic security, secrecy levels are measured via estimation theoretic tools and metrics, such as mean-squared error (MSE), where the objective is to perform accurate estimation of the parameter at the intended receiver while keeping the estimation error at the eavesdropper above a certain level. This framework proves useful both for analyzing the achievable performance under security constraints in parameter estimation problems, and for designing low-complexity, practical methods to enhance security in communication systems. In this dissertation, we investigate optimal deterministic encoding of random scalar and vector parameters in the presence of an eavesdropper, who is unaware of the encoding operation. We also analyze optimal stochastic encoding of a random parameter under secrecy constraints in a Gaussian wiretap channel model, where the eavesdropper is aware of the encoding strategy at the transmitter. In addition, we perform optimal parameter design for secure broadcast of a parameter to multiple receivers with fixed estimators. First, optimal deterministic encoding of a scalar parameter is investigated in the presence of an eavesdropper. The aim is to minimize the expectation of the conditional Cram´er-Rao bound (ECRB) at the intended receiver while keeping the MSE at the eavesdropper above a certain threshold. The eavesdropper is modeled to employ the linear minimum mean-squared error (LMMSE) estimator based on the encoded version of the parameter. First, the optimal encoding function is derived in the absence of secrecy constraints for any given prior distribution on the parameter. Next, an optimization problem is formulated under a secrecy constraint and various solution approaches are proposed. Also, theoretical results on the form of the optimal encoding function are provided. Furthermore, a robust parameter encoding approach is developed. In this case, the objective is to maximize the worst-case Fisher information of the parameter at the intended receiver while keeping the MSE at the eavesdropper above a certain level. The optimal encoding function is derived when there exist no secrecy constraints. Next, to obtain the solution of the problem in the presence of the secrecy constraint, the form of the encoding function that maximizes the MSE at the eavesdropper is explicitly derived for any given level of worst-case Fisher information. Then, based on this result, a low-complexity algorithm is provided to calculate the optimal encoding function for the given secrecy constraint. Numerical examples are presented to illustrate the theoretical results for both the ECRB and worst-case Fisher information based designs. Second, optimal deterministic encoding of a vector parameter is investigated in the presence of an eavesdropper. The objective is to minimize the ECRB at the intended receiver while satisfying an individual secrecy constraint on the MSE of estimating each parameter at the eavesdropper. The eavesdropper is modeled to employ the LMMSE estimator based on the noisy observation of the encoded parameter without being aware of encoding. First, the problem is formulated as a constrained optimization problem in the space of vector-valued functions. Then, two practical solution strategies are developed based on nonlinear individual encoding and affine joint encoding of parameters. Theoretical results on the solutions of the proposed strategies are provided for various scenarios on channel conditions and parameter distributions. Finally, numerical examples are presented to illustrate the performance of the proposed solution approaches. Third, estimation theoretic secure transmission of a scalar random parameter is investigated in the presence of an eavesdropper. The aim is to minimize the estimation error at the receiver under a secrecy constraint at the eavesdropper; or, alternatively, to maximize the estimation error at the eavesdropper for a given estimation accuracy limit at the receiver. In the considered setting, the encoder at the transmitter is allowed to use a randomized mapping between two one-to-one and continuous functions and the eavesdropper is fully aware of the encoding strategy at the transmitter. For small numbers of observations, both the eavesdropper and the receiver are modeled to employ LMMSE estimators, and for large numbers of observations, the ECRB metric is employed for both the receiver and the eavesdropper. Optimization problems are formulated and various theoretical results are provided in order to obtain the optimal solutions and to analyze the effects of encoder randomization. In addition, numerical examples are presented to corroborate the theoretical results. It is observed that stochastic encoding can bring significant performance gains for estimation theoretic secrecy problems. Finally, estimation theoretic secure broadcast of a random parameter is investigated. In the considered setting, each receiver device employs a fixed estimator and carries a certain security risk such that its decision can be available to a malicious third party with a certain probability. The encoder at the transmitter is allowed to use a random mapping to minimize the weighted sum of the conditional Bayes risks of the estimators under secrecy and average power constraints. After formulating the optimal parameter design problem, it is shown that the optimization problem can be solved individually for each parameter value and the optimal mapping at the transmitter involves a randomization among at most three different signal levels. Sufficient conditions for improvability and nonimprovability of the deterministic design via stochastic encoding are obtained. Numerical examples are provided to corroborate the theoretical results.
The ergodic secrecy capacity of the wiretap channel is known when the main channel (between the transmitter and the legitimate receiver) state information (CSI) is perfect at the transmitter and the coherence period is sufficiently large to enable random coding arguments in each block. In a fast fading scenario, when the codeword length spans many coherence periods, the secrecy capacity is still not known. In this paper, we present a framework that characterizes this secrecy capacity under imperfect main channel estimation at the transmitter. Inner and outer bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate is a simple on-off scheme using a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and the eavesdropper channels. The upper and the lower bounds coincide with recently derived ones in the perfect main CSI extreme. Furthermore, the lower bound matches the upper bound in no main CSI extreme, where the secrecy capacity is equal to zero. Numerical results are provided for independent identically distributed (i.i.d.) Rayleigh fading channels.
In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the legitimate transmitter and legitimate receiver. In addition, the legitimate receiver can send secure feedback to the transmitter at a limited rate Rf. We shown that the secrecy capacity is bounded by Cs ≥ max {p(u|v) p(x|u,v)max min{I(U;Y|v) - I(U;Z|V) + H(V|Z) + Rf, I(U;Y|V)},p(u)p(x|u,v)max min{H(V|Z,U) + Rf, I(U;Y|V)}}. Moreover, when the channel to the legitimate receiver is less noisy than the channel to the eavesdropper, the bound is shown to be tight. The capacity achieving scheme is based on both the Wyner wiretap coding and two steps of shared-key generation: one from the state information and one via the noiseless feedback. Finally, we consider several special cases. When state information is available only at the legitimate receiver, the analysis suggests that unlike previous results involving feedback, it is better to use the feedback to send the state information to the transmitter (when possible), rather than send a random key.
This paper considers an extension of wiretap channel II, where the source message W is transmitted to the legitimate receiver via a discrete memoryless main channel (DMC). Receiving YN, the receiver needs to recover W with small error probability. Meanwhile, an eavesdropper is able to observe arbitrary subsequence of YNwith size μ = Nα, where 0 <; α <; 1 is a constant real number. The encoding-decoding scheme is designed to satisfy a strong secrecy criterion, i.e. the information of each block (instead of each bit) exposed to the eavesdropper is negligible or arbitrarily close to 0 when N is sufficiently large. We focus on the secrecy capacity of this model.