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

Conference on Information Sciences and Systems

On the estimation and secrecy capabilities of stochastic encryption for parameter estimation in IoT

Ananth Narayan Samudrala, Rick S. Blum

Published Mar 1, 2018• 4 citations
Publisher

Abstract

In Internet of Things (IoT) applications requiring parameter estimation, sensors often transmit quantized observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. The fusion center uses the received data to estimate desired parameters. To provide security to such networks, some low complexity encryption approaches have been proposed. In this paper, we generalize those approaches and present an analysis of their estimation and secrecy capabilities. We show that the dimension of the unknown parameter that can be efficiently estimated using an unbiased estimator when using these approaches, is upper bounded. Assuming that an unauthorized eavesdropper is aware of the low complexity encryption process but is unaware of the encryption key, we show successful eavesdropping, even with a large number of observations, is impossible with unbiased estimators and independent observations for these approaches. Numerical results validating our analysis are presented.

DOI
10.1109/ciss.2018.8362293

Related papers

Asymptotic analysis of a new low complexity encryption approach for the Internet of Things, smart cities and smart grid

Ananth Narayan Samudrala, Rick S. Blum

Parameter estimation in wireless sensor networks (WSN) using encrypted non-binary quantized data is studied. In a WSN, sensors transmit their observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. Encryption approaches for WSNs with fixed threshold binary quantization were previously explored. However, fixed threshold binary quantization limits parameter estimation to scalar parameters. In this paper, we propose a stochastic encryption approach for WSNs that can operate on non-binary quantized observations and has the capability for vector parameter estimation. We extend a binary stochastic encryption approach proposed previously, to a non-binary generalized case. Sensor outputs are quantized using a quantizer with R + 1 levels, where R ϵ {1, 2, 3,...}, encrypted by flipping them with certain flipping probabilities, and then transmitted. Optimal estimators using maximum-likelihood estimation are derived for both a legitimate fusion center (LFC) and a third party fusion center (TPFC) perspectives. We assume the TPFC is unaware of the encryption. Asymptotic analysis of the estimators is performed by deriving the Cramer-Rao lower bound for LFC estimation, and the asymptotic bias and variance for TPFC estimation. Numerical results validating the asymptotic analysis are presented.

International Conference on Smart Grid and Smart Cities (ICSGSC)•Jul 1, 2017•12 citations

Secure Quantized Sequential Detection in the Internet of Things with Eavesdroppers

Jiangfan Zhang

We consider sequential detection based on one-bit quantized data in the Internet of Things (IoT) with an eavesdropper. A lightweight physical-layer encryption algorithm, called stochastic encryption, is employed as a counter measure that flips the quantization bits at each IoT sensor according to certain probabilities, and the flipping probabilities are only known to the legitimate cloud (LC) but not the eavesdropping cloud (EC). Due to the optimality of the sequential probability ratio test (SPRT), the LC employs the SPRT for sequential detection whereas the EC employs a mismatched SPRT (MSPRT). We characterize the asymptotic performance of the MSPRT in terms of the expected sample size as a function of the vanishing error probabilities. We show that every symmetric stochastic encryption is ineffective in the sense that it leads to the same expected sample size at the LC and EC when the LC and EC have the same detection accuracy. Next, in the asymptotic regime of small detection error probabilities, we show that every stochastic encryption degrades the performance of the EC to a greater extent in the sense that the expected sample size required at the EC is no fewer than that is required at the LC. Moreover, the optimal stochastic encryption is derived in the sense of maximizing the difference between the expected sample sizes required at the EC and LC.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2019•0 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

Evaluation of Physical Layer Secret Key Generation for IoT Devices

Marko Jacovic, M.P. Krayer von Kraus, Geoffrey Mainland +1 more

As aspects of our daily lives become more interconnected with the emergence of the Internet of Things (IoT), it is imperative that our devices are reliable and secure from threats. Vulnerabilities of Wi-Fi Protected Access (WPA/WPA2) have been exposed in the past, motivating the use of multiple security techniques, even with the release of WPA3. Physical layer security leverages existing components of communication systems to enable methods of protecting devices that are well-suited for IoT applications. In this work, we provide a low-complexity technique for generating secret keys at the Physical layer to enable improved IoT security. We leverage the existing carrier frequency offset (CFO) and channel estimation components of Orthogonal Frequency Division Multiplexing (OFDM) receivers for an efficient approach. The key generation algorithm we propose focuses on the unique CFO and channel experienced between a pair of desired nodes, and to the best of our understanding, the combination of the features has not been examined previously for the purpose of secret key generation. Our techniques are appropriate for IoT devices, as they do not require extensive processing capabilities and are based on second order statistics. We obtain experimental results using USRP N210 software defined radios and analyze the performance of our methods in post-processing. Our techniques improve the capability of desired nodes to establish matching secret keys, while hindering the threat of an eavesdropper, and are useful for protecting future IoT devices.

The ... IEEE Annual Wireless and Microwave Technology Conference•Apr 1, 2019•16 citations

Secrecy Limits of Energy Harvesting IoT Networks under Channel Imperfections

Furqan Jameel, Zheng Chang, Riku Jäntti

Simultaneous wireless information and power transfer (SWIPT) has recently gathered much research interest from both academia and industry as a key enabler of energy harvesting Internet-of-things (IoT) networks. Due to a number of growing use cases of such networks, it is important to study their performance limits from the perspective of physical layer security (PLS). With this intent, this work aims to provide a novel analysis of the ergodic secrecy capacity of a SWIPT system is provided for Rician and Nakagami- m faded communication links. For a realistic evaluation of the system, the imperfections of channel estimations for different receiver designs of the SWIPT-based IoT systems have been taken into account. Subsequently, the closed-form expressions of the ergodic secrecy capacities for the considered scenario are provided and, then, validated through extensive simulations. The results indicate that an error ceiling appears due to imperfect channel estimation at high values of signal-to-noise ratio (SNR). More importantly, the secrecy capacity under different channel conditions stops increasing beyond a certain limit, despite an increase of the main link SNR. The in-depth analysis of secrecy-energy trade-off has also been performed and a comparison has been provided for imperfect and perfect channel estimation cases. As part of the continuous evolution of IoT networks, the results provided in this work can help in identifying the secrecy limits of IoT networks in the presence of multiple eavesdroppers.

arXiv:2008.01835•IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)•Mar 1, 2020•2 citations

Jammer-Assisted Secure Precoding and Feedback Design for MIMO IoT Networks

Zhiyao Tang, Liang Sun, Dusit Tao Niyato +2 more

Great concerns on the Internet of Things (IoT) security are raised as IoT becomes an emerging paradigm to achieve ubiquitous connectivity. This article studies low-complexity secure transceiver and feedback design with the assistance of a jammer for physical-layer security in multiantenna IoT systems. We consider the general setting where a legitimate multiantenna controller broadcasts confidential messages to multiple multiantenna IoT devices in the presence of a passive external multiantenna eavesdropper. Moreover, there is only quantized downlink channel state information (CSI) at the controller and the jammer through feedback channels. We introduce several secure transceivers for different system setups, all of which employ block-diagonal precoding at the controller and null-space beamforming at the jammer but are with the different receivers at each IoT device. Considering the practical setup of IoT and for the tractability of analysis, we study the secrecy performance of the transceiver with an arbitrarily selected receive matrix independent of the channels of all devices. We derive an approximate lower bound on the ergodic secrecy rate (ESR) of each devicewithoutassuming any asymptotes for system parameters. The obtained result can also be viewed as a lower bound on the ESR performance of any other transceivers. We also optimize this bound to find an adaptive feedback bit allocation to the two feedback channels of each legitimate device. Numerical results are shown to illustrate the obtained analytical ESR lower bound, the feedback bit allocation algorithm, and significant ESR performance gain that results from the proposed feedback bit allocation.

IEEE Internet of Things Journal•Dec 14, 2021•8 citations
In Internet of Things (IoT) applications requiring parameter estimation, sensors often transmit quantized observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. The fusion center uses the received data to estimate desired parameters. To provide security to such networks, some low complexity encryption approaches have been proposed. In this paper, we generalize those approaches and present an analysis of their estimation and secrecy capabilities. We show that the dimension of the unknown parameter that can be efficiently estimated using an unbiased estimator when using these approaches, is upper bounded. Assuming that an unauthorized eavesdropper is aware of the low complexity encryption process but is unaware of the encryption key, we show successful eavesdropping, even with a large number of observations, is impossible with unbiased estimators and independent observations for these approaches. Numerical results validating our analysis are presented.
Parameter estimation in wireless sensor networks (WSN) using encrypted non-binary quantized data is studied. In a WSN, sensors transmit their observations to a fusion center through a wireless medium where the observations are susceptible to unauthorized eavesdropping. Encryption approaches for WSNs with fixed threshold binary quantization were previously explored. However, fixed threshold binary quantization limits parameter estimation to scalar parameters. In this paper, we propose a stochastic encryption approach for WSNs that can operate on non-binary quantized observations and has the capability for vector parameter estimation. We extend a binary stochastic encryption approach proposed previously, to a non-binary generalized case. Sensor outputs are quantized using a quantizer with R + 1 levels, where R ϵ {1, 2, 3,...}, encrypted by flipping them with certain flipping probabilities, and then transmitted. Optimal estimators using maximum-likelihood estimation are derived for both a legitimate fusion center (LFC) and a third party fusion center (TPFC) perspectives. We assume the TPFC is unaware of the encryption. Asymptotic analysis of the estimators is performed by deriving the Cramer-Rao lower bound for LFC estimation, and the asymptotic bias and variance for TPFC estimation. Numerical results validating the asymptotic analysis are presented.
We consider sequential detection based on one-bit quantized data in the Internet of Things (IoT) with an eavesdropper. A lightweight physical-layer encryption algorithm, called stochastic encryption, is employed as a counter measure that flips the quantization bits at each IoT sensor according to certain probabilities, and the flipping probabilities are only known to the legitimate cloud (LC) but not the eavesdropping cloud (EC). Due to the optimality of the sequential probability ratio test (SPRT), the LC employs the SPRT for sequential detection whereas the EC employs a mismatched SPRT (MSPRT). We characterize the asymptotic performance of the MSPRT in terms of the expected sample size as a function of the vanishing error probabilities. We show that every symmetric stochastic encryption is ineffective in the sense that it leads to the same expected sample size at the LC and EC when the LC and EC have the same detection accuracy. Next, in the asymptotic regime of small detection error probabilities, we show that every stochastic encryption degrades the performance of the EC to a greater extent in the sense that the expected sample size required at the EC is no fewer than that is required at the LC. Moreover, the optimal stochastic encryption is derived in the sense of maximizing the difference between the expected sample sizes required at the EC and LC.
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.
As aspects of our daily lives become more interconnected with the emergence of the Internet of Things (IoT), it is imperative that our devices are reliable and secure from threats. Vulnerabilities of Wi-Fi Protected Access (WPA/WPA2) have been exposed in the past, motivating the use of multiple security techniques, even with the release of WPA3. Physical layer security leverages existing components of communication systems to enable methods of protecting devices that are well-suited for IoT applications. In this work, we provide a low-complexity technique for generating secret keys at the Physical layer to enable improved IoT security. We leverage the existing carrier frequency offset (CFO) and channel estimation components of Orthogonal Frequency Division Multiplexing (OFDM) receivers for an efficient approach. The key generation algorithm we propose focuses on the unique CFO and channel experienced between a pair of desired nodes, and to the best of our understanding, the combination of the features has not been examined previously for the purpose of secret key generation. Our techniques are appropriate for IoT devices, as they do not require extensive processing capabilities and are based on second order statistics. We obtain experimental results using USRP N210 software defined radios and analyze the performance of our methods in post-processing. Our techniques improve the capability of desired nodes to establish matching secret keys, while hindering the threat of an eavesdropper, and are useful for protecting future IoT devices.
Simultaneous wireless information and power transfer (SWIPT) has recently gathered much research interest from both academia and industry as a key enabler of energy harvesting Internet-of-things (IoT) networks. Due to a number of growing use cases of such networks, it is important to study their performance limits from the perspective of physical layer security (PLS). With this intent, this work aims to provide a novel analysis of the ergodic secrecy capacity of a SWIPT system is provided for Rician and Nakagami- m faded communication links. For a realistic evaluation of the system, the imperfections of channel estimations for different receiver designs of the SWIPT-based IoT systems have been taken into account. Subsequently, the closed-form expressions of the ergodic secrecy capacities for the considered scenario are provided and, then, validated through extensive simulations. The results indicate that an error ceiling appears due to imperfect channel estimation at high values of signal-to-noise ratio (SNR). More importantly, the secrecy capacity under different channel conditions stops increasing beyond a certain limit, despite an increase of the main link SNR. The in-depth analysis of secrecy-energy trade-off has also been performed and a comparison has been provided for imperfect and perfect channel estimation cases. As part of the continuous evolution of IoT networks, the results provided in this work can help in identifying the secrecy limits of IoT networks in the presence of multiple eavesdroppers.
Great concerns on the Internet of Things (IoT) security are raised as IoT becomes an emerging paradigm to achieve ubiquitous connectivity. This article studies low-complexity secure transceiver and feedback design with the assistance of a jammer for physical-layer security in multiantenna IoT systems. We consider the general setting where a legitimate multiantenna controller broadcasts confidential messages to multiple multiantenna IoT devices in the presence of a passive external multiantenna eavesdropper. Moreover, there is only quantized downlink channel state information (CSI) at the controller and the jammer through feedback channels. We introduce several secure transceivers for different system setups, all of which employ block-diagonal precoding at the controller and null-space beamforming at the jammer but are with the different receivers at each IoT device. Considering the practical setup of IoT and for the tractability of analysis, we study the secrecy performance of the transceiver with an arbitrarily selected receive matrix independent of the channels of all devices. We derive an approximate lower bound on the ergodic secrecy rate (ESR) of each devicewithoutassuming any asymptotes for system parameters. The obtained result can also be viewed as a lower bound on the ESR performance of any other transceivers. We also optimize this bound to find an adaptive feedback bit allocation to the two feedback channels of each legitimate device. Numerical results are shown to illustrate the obtained analytical ESR lower bound, the feedback bit allocation algorithm, and significant ESR performance gain that results from the proposed feedback bit allocation.