The industrial Internet of Things is flourishing, which is unprecedentedly driven by the rapid development of wireless sensor networks (WSNs) with the assistance of cloud computing. The new wave of technology will give rise to new risks to cyber security, particularly the data confidentiality in cloud-assisted WSNs (CWSNs). Searchable public-key encryption (SPE) is a promising method to address this problem. In theory, it allows sensors to upload public-key ciphertexts to the cloud, and the owner of these sensors can securely delegate a keyword search to the cloud and retrieve the intended data while maintaining data confidentiality. However, all existing and semantically secure SPE schemes have expensive costs in terms of generating ciphertexts and searching keywords. Hence, this paper proposes a lightweight SPE (LSPE) scheme with semantic security for CWSNs. LSPE reduces a large number of the computation-intensive operations that are adopted in previous works; thus, LSPE has search performance close to that of some practical searchable symmetric encryption schemes. In addition, LSPE saves considerable time and energy costs of sensors for generating ciphertexts. Finally, we experimentally test LSPE and compare the results with some previous works to quantitatively demonstrate the above advantages.
The industrial Internet of Things is flourishing, which is unprecedentedly driven by the rapid development of wireless sensor networks (WSNs) with the assistance of cloud computing. The new wave of technology will give rise to new risks to cyber security, particularly the data confidentiality in cloud-assisted WSNs (CWSNs). Searchable public-key encryption (SPE) is a promising method to address this problem. In theory, it allows sensors to upload public-key ciphertexts to the cloud, and the owner of these sensors can securely delegate a keyword search to the cloud and retrieve the intended data while maintaining data confidentiality. However, all existing and semantically secure SPE schemes have expensive costs in terms of generating ciphertexts and searching keywords. Hence, this paper proposes a lightweight SPE (LSPE) scheme with semantic security for CWSNs. LSPE reduces a large number of the computation-intensive operations that are adopted in previous works; thus, LSPE has search performance close to that of some practical searchable symmetric encryption schemes. In addition, LSPE saves considerable time and energy costs of sensors for generating ciphertexts. Finally, we experimentally test LSPE and compare the results with some previous works to quantitatively demonstrate the above advantages.
With the rapid progress in technology, wireless sensor networks (WSNs) have attracted people's interest in the research community. However, due to the limited node communication and computing power, the traditional public key encryption algorithm can't be effectively applied. And as step into post-quantum era, pairing related assumption is fragile. Lattice is an ideal choice for building secure encryption scheme against quantum attack. Based on this, we propose a public encryption with key search scheme from lattice for wireless sensor networks. Compared with the existing public searchable encryption algorithm, the proposed encryption algorithm requires less computation time and achieves more security level.
Cloud-assisted Industrial Internet of Things (IIoT) relies on cloud computing to provide massive data storage services. To ensure the confidentiality, sensitive industrial data need to be encrypted before being outsourced to cloud storage server. Public-key encryption with keyword search (PEKS) enables users to search target encrypted data by keywords. However, most existing PEKS schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with quantum computers in the near future. Moreover, they suffer from key exposure, and thus the security would be broken once the keys are compromised. In this paper, we propose a forward secure PEKS scheme (FS-PEKS) based on lattice assumptions for cloud-assisted IIoT, which is post-quantum secure. We integrate a lattice-based delegation mechanism into FS-PEKS to achieve forward security, such that the security of the system is still guaranteed even the keys are compromised by the adversaries. We define the first formal security model on forward security of PEKS, and prove the security of FS-PEKS under the model. As the keywords of industrial data are with inherently low entropy, we further extend FS-PEKS to resist insider keyword guessing attacks (IKGA). The comprehensive performance evaluation demonstrates that FS-PEKS is practical for cloud-assisted IIoT.
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.
With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.
With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.
Wireless Sensor Networks (WSNs) are promoting the spread of the Internet for devices in all areas of life, which makes it is a promising technology in the future. In the coming days, as attack technologies become more improved, security will have an important role in WSN. Currently, quantum computers pose a significant risk to current encryption technologies that work in tandem with intrusion detection systems because it is difficult to implement quantum properties on sensors due to the resource limitations. In this paper, quantum computing is used to develop a future-proof, robust, lightweight and resource-conscious approach to sensor networks. Great emphasis is placed on the concepts of using the BB84 protocol with the AES algorithm in WSN security. The results of analysis indicated a high level of security between the data by depending on the generation of secure keys, and reached an accuracy rate of about (80-95) % based on using NIST statistical. The efficiency of the work increased to 0.704 after using the Quantum Bit Error Rate equation, eventually increasing the network performance. This results in the reduction of the overall amount of energy, and the time required for performing the key exchange in the encryption and decryption processes decreased.