International Conference on Smart Grid and Smart Cities (ICSGSC)

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

Published Jul 1, 2017• 11 citations

Abstract

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.

DOI: 10.1109/icsgsc.2017.8038576

Related papers

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

Ananth Narayan Samudrala, Rick S. Blum

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.

Conference on Information Sciences and SystemsMar 1, 20184 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, 20190 citations

1-Bit compressive sensing encryption in multicarrier systems

Yonggu Lee, Hanseong Jo, Jinho Choi

Compressive sensing (CS) encryption has attracted increasing attention as a lightweight encryption technique for the Internet of things (IoT) and wireless sensor networks (WSNs). Since devices and sensors may have limited hardware, it might be needed to consider quantization for CS encryption. In this paper, we consider a 1-bit CS encryption using artificial noise and a retransmission strategy with interleaving to mitigate degradation of detection performance at a legitimate receiver caused by the quantization errors. Through the analysis and simulation results, we demonstrate that the retransmission strategy can improve the detection performance at a legitimate receiver, while it slightly improves decision performance to estimate a measurement matrix at an eavesdropper. In addition, the proposed 1-bit CS encryption has a better performance than the existing CS encryption in terms of security, while mitigating the performance degradation caused by quantization errors of detection probability at a legitimate receiver.

IEEE Wireless Communications and Networking ConferenceApr 1, 20181 citation

A Quantum-Entropy-Based AES Framework for Energy-Efficient and Post-Quantum Secure IoT Wireless Sensor Networks

Mohammad Sirajuddin, Ravikumar Thallapalli, Dr.Burla Srinivas +1 more

The rapid development of Internet of Things (IoT) applications has led to the large-scale deployment of wireless sensor networks (WSNs) that incessantly generate and transmit sensitive data over wireless networks.Although the current mostly used symmetric encryption algorithm for securing such networks is the Advanced Encryption Standard (AES), the advent of quantum computing threatens the long-term security of AES, as well as the weaknesses inherent to the key generation, distribution, and lifecycle management.This research paper proposes a Quantum Enhanced AES framework for IoT based WSNs which integrates the use of Quantum Random Number Generator (QRNG) based high entropy key generation, key injection against side channel attacks and dynamic session-based rekeying.Compared with classical AES and two state-of-the-art security frameworks based on quantum computing, i.e., QKDassisted AES scheme and lightweight post-quantum security hybrid AES framework, the proposed scheme increases the entropy of the key by about 20% (from 0.82 to 0.99), and lowers the key exposure risk by more than 60% by using session-based rekeying.Simulation results indicate that the proposed method can achieve up to 8 to10% higher throughput and 22% lower end-to-end delay than post-quantum AES schemes, and also prolongs the network lifetime by almost 15% under realistic IoT-WSN workloads.The framework maintains and does not alter the AES standard compliance and does not make any changes to the AES core, thus it ensures practical applicability.These results show that the proposed approach offers a good quantum resilience with low performance and energy overhead, which is suitable for long-lived and security-critical IoT-WSN deployment.

International Journal of Computer Networks And ApplicationsAug 30, 20260 citations

Design of Binary Quantizers for Distributed Detection Under Secrecy Constraints

Venkata Sriram Siddhardh Nadendla, Pramod K. Varshney

In this paper, we investigate the design of distributed detection networks in the presence of an eavesdropper (Eve). We consider the problem of designing binary sensor quantizers that maximize the Kullback-Leibler (KL) divergence at the fusion center (FC), when subject to a tolerable constraint on the KL divergence at Eve. We assume that the channels between the sensors and the FC (likewise the channels between the sensors and the Eve) are modeled as binary symmetric channels (BSCs). In the case of i.i.d. received symbols at both the FC and Eve, we prove that the structure of the optimal binary quantizers is a likelihood ratio test (LRT). We also present an algorithm to find the threshold of the optimal LRT, and illustrate it for the case of Additive white Gaussian noise (AWGN) observation models at the sensors. In the case of non-i.i.d. received symbols at both FC and Eve, we propose a dynamic-programming based algorithm to find efficient quantizers at the sensors. Numerical results are presented to illustrate the performance of the proposed network.

arXiv:1410.8100IEEE Transactions on Signal ProcessingFeb 11, 201631 citations

Cryptanalysis and Improvement of a Privacy-Preserving Three-Factor Authentication Protocol for Wireless Sensor Networks

Km. Renuka, Sachin Kumar, Saru Kumari +1 more

Wireless sensor networks (WSNs) are of prominent use in unmanned surveillance applications. This peculiar trait of WSNs is actually the underlying technology of various applications of the Internet of Things (IoT) such as smart homes, smart cities, smart shopping complexes, smart traffic, smart health, and much more. Over time, WSNs have evolved as a strong base for laying the foundations of IoT infrastructure. In order to address the scenario in which a user wants to access the real-time data directly from the sensor node in wireless sensor networks (WSNs), Das recently proposed an anonymity-preserving three-factor authentication protocol. Das's protocol is suitable for resource-constrained sensor nodes because it only uses lightweight cryptographic primitives such as hash functions and symmetric encryption schemes as building blocks. Das's protocol is claimed to be secure against different known attacks by providing formal security proof and security verification using the Automated Validation of Internet Security Protocols and Applications tool. However, we find that Das's protocol has the following security loopholes: (1) By using a captured sensor node, an adversary can impersonate a legal user to the gateway node, impersonate other sensor nodes to deceive the user, and the adversary can also decrypt all the cipher-texts of the user; (2) the gateway node has a heavy computational cost due to user anonymity and thus the protocol is vulnerable to denial of service (DoS) attacks. We overcome the shortcomings of Das's protocol and propose an improved protocol. We also prove the security of the proposed protocol in the random oracle model. Compared with the other related protocols, the improved protocol enjoys better functionality without much enhancement in the computation and communication costs. Consequently, it is more suitable for applications in WSNs.

SensorsOct 24, 201931 citations