scholarly journals A privacy protection-oriented parallel fully homomorphic encryption algorithm in cyber physical systems

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Zhaoe Min ◽  
Geng Yang ◽  
Arun Kumar Sangaiah ◽  
Shuangjie Bai ◽  
Guoxiu Liu
Keyword(s):  
Privacy Protection ◽  
Homomorphic Encryption ◽  
Cyber Physical Systems ◽  
Encryption Algorithm ◽  
Fully Homomorphic Encryption ◽  
Physical Systems ◽  
Oriented Parallel

scholarly journals Accelerating privacy-preserving momentum federated learning for industrial cyber-physical systems

2021 ◽  
Author(s):  
Linlin Zhang ◽  
Zehui Zhang ◽  
Cong Guan
Keyword(s):  
Convergence Rate ◽  
Performance Improvement ◽  
Gradient Descent ◽  
Homomorphic Encryption ◽  
Cyber Physical Systems ◽  
Privacy Preserving ◽  
Fully Homomorphic Encryption ◽  
Physical Systems ◽  
Cloud Server ◽  
And Performance

AbstractFederated learning (FL) is a distributed learning approach, which allows the distributed computing nodes to collaboratively develop a global model while keeping their data locally. However, the issues of privacy-preserving and performance improvement hinder the applications of the FL in the industrial cyber-physical systems (ICPSs). In this work, we propose a privacy-preserving momentum FL approach, named PMFL, which uses the momentum term to accelerate the model convergence rate during the training process. Furthermore, a fully homomorphic encryption scheme CKKS is adopted to encrypt the gradient parameters of the industrial agents’ models for preserving their local privacy information. In particular, the cloud server calculates the global encrypted momentum term by utilizing the encrypted gradients based on the momentum gradient descent optimization algorithm (MGD). The performance of the proposed PMFL is evaluated on two common deep learning datasets, i.e., MNIST and Fashion-MNIST. Theoretical analysis and experiment results confirm that the proposed approach can improve the convergence rate while preserving the privacy information of the industrial agents.

scholarly journals An Efficient Encryption Algorithm for the Security of Sensitive Private Information in Cyber-Physical Systems

Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1220 ◽  
Author(s):  
Xiaogang Zhu ◽  
Gautam Srivastava ◽  
Reza M. Parizi
Keyword(s):  
Private Information ◽  
Information Acquisition ◽  
Personal Information ◽  
Smart Cities ◽  
Recognition Rate ◽  
Cyber Physical Systems ◽  
Information Resources ◽  
Encryption Algorithm ◽  
Utilization Rate ◽  
Physical Systems

The new developments in smart cyber-physical systems can be shown to include smart cities, Internet of things (IoT), and for the most part smart anything. To improve the security of sensitive personal information (SPI) in cyber-physical systems, we present some novel ideas related to the encryption of SPI. Currently, there are issues in traditional encryption methods, such as low speed of information acquisition, low recognition rate, low utilization rate of effective information resources, and high delay of information query. To address these issues, we propose a novel efficient encryption algorithm for the security of incremental SPI. First, our proposed method analyzes user information resources and determines valid data to be encrypted. Next, it uses adaptive acquisition methods to collect information, and uses our encryption method to complete secure encryption of SPI according to the acquisition results. Our experimental analysis clearly shows that the algorithm effectively improves the speed of information acquisition as well as effective information recognition rate, thus enhancing the security of SPI. The encryption model in turn can provide a strong guarantee for user information security.

A Key Management Scheme for Smart Grid Wireless Terminals

2013 ◽  
Vol 442 ◽  
pp. 501-506
Author(s):  
Bo Zhang ◽  
Yu Fei Wang ◽  
Tao Zhang ◽  
Yuan Yuan Ma
Keyword(s):  
Smart Grid ◽  
Power Systems ◽  
Key Management ◽  
Large Scale ◽  
Homomorphic Encryption ◽  
Symmetric Polynomial ◽  
Encryption Algorithm ◽  
Fully Homomorphic Encryption ◽  
Management Scheme ◽  
Key Management Scheme

With the large-scale construction of smart grid, smart grid terminals widely using wireless access technology to communicate to the power systems. For ensuring the communication security, pair-wise key pre-distribution scheme is widely used, however, which introduces the complexity of key management, and insufficient security problems. According to the smart grid terminals wireless communication features, proposes an intelligent grid wireless terminal online key management scheme, which is based on the t rank binary symmetric polynomial and fully homomorphic encryption algorithm. This scheme make the communication key could be established with a few parameters between the communicating parties, which reduces the complexity of key predistribution and the amount of calculation. Moreover, the whole process of the key generation is encrypted by fully homomorphic encryption algorithm, effectively enhances the security of the scheme.

scholarly journals Two-Party Secure Computation for Any Polynomial Function on Ciphertexts under Different Secret Keys

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Bingbing Jiang
Keyword(s):  
Polynomial Function ◽  
Homomorphic Encryption ◽  
Auxiliary Information ◽  
Secure Computation ◽  
Encryption Algorithm ◽  
Fully Homomorphic Encryption ◽  
Simple Scheme ◽  
Secret Keys ◽  
Learning With Errors ◽  
Multiple Keys

Multikey fully homomorphic encryption proposed by Lopez-Alt et al. (STOC12) is a significant primitive that allows one to perform computation on the ciphertexts encrypted by multiple different keys independently. Then, several schemes were constructed based on decisional small polynomial ratio or learning with errors. These schemes all require an expansion algorithm to transform a ciphertext under a single key into an encryption of the same message under a set of keys. To achieve the expansion algorithm without interaction with these key-keepers, their encryption algorithm not only outputs a ciphertext of a plaintext but also exports auxiliary information generated from the randomness used in the former encryption process. Beyond that, the size of the ciphertext encrypted by multiple keys increases linearly or quadratically in the number of participants. In this paper, we studied the problem whether someone can directly perform arbitrary computation on ciphertexts encrypted by different keys without any auxiliary information in the output of the encryption algorithm and an increase in the size of the ciphertext in the expansion algorithm. To this end, we proposed a novel and simple scheme of secure computation on ciphertexts under two different keys directly without any auxiliary information. In other words, each party just provides its own ciphertexts encrypted by the GSW scheme (CRYPTO13). In the procedure of executing evaluation on these ciphertexts, the size of the new ciphertext remains the same as that of the GSW ciphertext.

scholarly journals Smart Contract Privacy Protection Using AI in Cyber-Physical Systems: Tools, Techniques and Challenges

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 24746-24772 ◽  
Author(s):  
Rajesh Gupta ◽  
Sudeep Tanwar ◽  
Fadi Al-Turjman ◽  
Prit Italiya ◽  
Ali Nauman ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Cyber Physical Systems ◽  
Physical Systems ◽  
Smart Contract
Sign in / Sign up

Export Citation Format

Share Document