scholarly journals Privacy Protection of IoT Based on Fully Homomorphic Encryption

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Wei-Tao Song ◽  
Bin Hu ◽  
Xiu-Feng Zhao
Keyword(s):  
Internet Of Things ◽  
Privacy Protection ◽  
Large Scale ◽  
Homomorphic Encryption ◽  
Load Capacity ◽  
Rapid Development ◽  
Fully Homomorphic Encryption ◽  
Computation Techniques ◽  
Low Efficiency ◽  
Definition Of

With the rapid development of Internet of Things (IoT), grave questions of privacy protection are raised. This greatly impacts the large-scale applications of IoT. Fully homomorphic encryption (FHE) can provide privacy protection for IoT. But, its efficiency needs to be greatly improved. Nowadays, Gentry’s bootstrapping technique is still the only known method of obtaining a “pure” FHE scheme. And it is also the key for the low efficiency of FHE scheme due to the complexity homomorphic decryption. In this paper, the bootstrapping technique of Halevi and Shoup (EUROCRYPT 15) is improved. Firstly, by introducing a definition of “load capacity”, we optimize the parameter range for which their bootstrapping technique works. Next we generalize their ciphertext modulus from closing to a power of two to more general situations. This enables the method to be applied in a larger number of situations. Moreover, this paper also shows how to introduce SIMD homomorphic computation techniques into the new method, to improve the efficiency of recryption.

scholarly journals Achieving Message-Encapsulated Leveled FHE for IoT Privacy Protection

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Weiping Ouyang ◽  
Chunguang Ma ◽  
Guoyin Zhang ◽  
Keming Diao
Keyword(s):  
Internet Of Things ◽  
Privacy Protection ◽  
Large Scale ◽  
Homomorphic Encryption ◽  
Rapid Development ◽  
Information Leakage ◽  
The Internet ◽  
Public Key Encryption ◽  
Fully Homomorphic Encryption ◽  
The Internet Of Things

The rapid development of the Internet of Things has made the issue of privacy protection even more concerning. Privacy protection has affected the large-scale application of the Internet of Things. Fully Homomorphic Encryption (FHE) is a newly emerging public key encryption scheme, which can be used to prevent information leakage. It allows performing arbitrary algebraic operations on data which are encrypted, such that the operation performed on the ciphertext is directly transformed into the corresponding plaintext. Recently, overwhelming majority of FHE schemes are confined to single-bit encryption, whereas how to achieve a multibit FHE scheme is still an open problem. This problem is partially (rather than fully) solved by Hiromasa-Abe-Okamoto (PKC′15), who proposed a packed message FHE scheme which only supports decryption in a bit-by-bit manner. Followed by that, Li-Ma-Morais-Du (Inscrypt′16) proposed a multibit FHE scheme which can decrypt the ciphertext at one time, but their scheme is based on dual LWE assumption. Armed with the abovementioned two schemes, in this paper, we propose an efficient packed message FHE that supports the decryption in two ways: single-bit decryption and one-time decryption.

scholarly journals Data Privacy Protection Based on Micro Aggregation with Dynamic Sensitive Attribute Updating

Sensors ◽  
2018 ◽  
Vol 18 (7) ◽  
pp. 2307 ◽  
Author(s):  
Yancheng Shi ◽  
Zhenjiang Zhang ◽  
Han-Chieh Chao ◽  
Bo Shen
Keyword(s):  
Privacy Protection ◽  
Data Privacy ◽  
Large Scale ◽  
Data Centers ◽  
Personal Information ◽  
Rapid Development ◽  
Data Availability ◽  
Personal Privacy ◽  
Data Anonymization ◽  
Data Privacy Protection

With the rapid development of information technology, large-scale personal data, including those collected by sensors or IoT devices, is stored in the cloud or data centers. In some cases, the owners of the cloud or data centers need to publish the data. Therefore, how to make the best use of the data in the risk of personal information leakage has become a popular research topic. The most common method of data privacy protection is the data anonymization, which has two main problems: (1) The availability of information after clustering will be reduced, and it cannot be flexibly adjusted. (2) Most methods are static. When the data is released multiple times, it will cause personal privacy leakage. To solve the problems, this article has two contributions. The first one is to propose a new method based on micro-aggregation to complete the process of clustering. In this way, the data availability and the privacy protection can be adjusted flexibly by considering the concepts of distance and information entropy. The second contribution of this article is to propose a dynamic update mechanism that guarantees that the individual privacy is not compromised after the data has been subjected to multiple releases, and minimizes the loss of information. At the end of the article, the algorithm is simulated with real data sets. The availability and advantages of the method are demonstrated by calculating the time, the average information loss and the number of forged data.

Research on Micro-Certificate Based Security System for Internet of Things

2012 ◽  
Vol 263-266 ◽  
pp. 3125-3129
Author(s):  
Li Ping Du ◽  
Ying Li ◽  
Guan Ning Xu ◽  
Fei Duan
Keyword(s):  
Internet Of Things ◽  
Large Scale ◽  
Rapid Development ◽  
Security System ◽  
Security Requirements ◽  
Full Account ◽  
Chip Technology ◽  
Cryptographic Algorithms ◽  
Encryption Decryption ◽  
The Internet Of Things

The rapid development of internet of things puts forward urgent needs for security. The security system must be studied to adapt to the characteristics of the internet of things. The micro- certificate based security system for internet of things takes full account of the security characteristics of things, and uses the symmetric cryptographic algorithms and security chip technology. This security system can meet the security requirements for large-scale sensor’s authentication, signification and encryption/decryption in internet of things, and improve the security performance of internet of things greatly.

scholarly journals Efficient Authentication for Internet of Things Devices in Information Management Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xiaofeng Wu ◽  
Fangyuan Ren ◽  
Yiming Li ◽  
Zhenwei Chen ◽  
Xiaoling Tao
Keyword(s):  
Internet Of Things ◽  
Information Management ◽  
Management System ◽  
Large Scale ◽  
Rapid Development ◽  
Mutual Authentication ◽  
Information Management System ◽  
Management Systems ◽  
User Privacy ◽  
Information Management Systems

With the rapid development of the Internet of Things (IoT) technology, it has been widely used in various fields. IoT device as an information collection unit can be built into an information management system with an information processing and storage unit composed of multiple servers. However, a large amount of sensitive data contained in IoT devices is transmitted in the system under the actual wireless network environment will cause a series of security issues and will become inefficient in the scenario where a large number of devices are concurrently accessed. If each device is individually authenticated, the authentication overhead is huge, and the network burden is excessive. Aiming at these problems, we propose a protocol that is efficient authentication for Internet of Things devices in information management systems. In the proposed scheme, aggregated certificateless signcryption is used to complete mutual authentication and encrypted transmission of data, and a cloud server is introduced to ensure service continuity and stability. This scheme is suitable for scenarios where large-scale IoT terminal devices are simultaneously connected to the information management system. It not only reduces the authentication overhead but also ensures the user privacy and data integrity. Through the experimental results and security analysis, it is indicated that the proposed scheme is suitable for information management systems.

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 Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption

2021 ◽  
Vol 11 (21) ◽  
pp. 10332
Author(s):  
Zong-Wu Zhu ◽  
Ru-Wei Huang
Keyword(s):  
Homomorphic Encryption ◽  
Fully Homomorphic Encryption ◽  
Storage Overhead ◽  
Malicious Model ◽  
Overall Performance ◽  
The Common ◽  
Crs Model ◽  
Low Efficiency ◽  
Threshold Decryption ◽  
Better Than

Aiming at the problems of large ciphertext size and low efficiency in the current secure multi-party computation (SMC) protocol based on fully homomorphic encryption (FHE), the paper proves that the fully homomorphic encryption scheme that supports multi-bit encryption proposed by Chen Li et al. satisfies the key homomorphism. Based on this scheme and threshold decryption, a three-round, interactive, leveled, secure multi-party computation protocol under the Common Random String (CRS) model is designed. The protocol is proved to be safe under the semi-honest model and the semi-malicious model. From the non-interactive zero-knowledge proof, it can be concluded that the protocol is also safe under the malicious model. Its security can be attributed to the Decisional Learning With Errors (DLWE) and a variant of this problem (some-are-errorless LWE). Compared with the existing secure multi-party computation protocol based on fully homomorphic encryption under the CRS model, the ciphertext size of this protocol is smaller, the efficiency is higher, the storage overhead is smaller, and the overall performance is better than the existing protocol.

Sign in / Sign up

Export Citation Format

Share Document