Polynomial Multiplication Systolic Array for Homomorphic Encryption in Secure Network Communications

Author(s):  
Nana Sutisna ◽  
Gilbert Jonatan ◽  
Infall Syafalni ◽  
Rahmat Mulyawan ◽  
Trio Adiono
2020 ◽  
Vol 23 (4) ◽  
pp. 386-396
Author(s):  
A. D. Dakhnovich ◽  
D. A. Moskvin ◽  
D. P. Zegzhda

Digital transformation, or Industry 4.0, is already changing manufacturing processes as it brings more automation to standardized Industrial Control Systems (ICS) based systems such as Supervisory Control and Data Acquisition (SCADA) systems. It is performed by the means of cyber-physical systems such as Internet of Things (IoT). For now, these “Things” are communicating in a new network area, where peer-to-peer communications are widely used. Such networks are responsible for real life processes safety. However, such shift also extends a threat vectors and entry points for an adversary inside the industrial segments. In the paper, new cybersecurity challenges on the Industrial Internet of Things network segments are considered as well as known practices to mitigate some of them. As a result, a peer-to-peer smart multipath network routing based on garlic routing is proposed to model secure network communications in IoT field. An approach is aimed to be used on the IoT field to tackle all of the network-scoped cybersecurity challenges.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Mingyang Song ◽  
Yingpeng Sang ◽  
Yuying Zeng ◽  
Shunchao Luo

The efficiency of fully homomorphic encryption has always affected its practicality. With the dawn of Internet of things, the demand for computation and encryption on resource-constrained devices is increasing. Complex cryptographic computing is a major burden for those devices, while outsourcing can provide great convenience for them. In this paper, we firstly propose a generic blockchain-based framework for secure computation outsourcing and then propose an algorithm for secure outsourcing of polynomial multiplication into the blockchain. Our algorithm for polynomial multiplication can reduce the local computation cost to O n . Previous work based on Fast Fourier Transform can only achieve O n log n for the local cost. Finally, we integrate the two secure outsourcing schemes for polynomial multiplication and modular exponentiation into the fully homomorphic encryption using hidden ideal lattice and get an outsourcing scheme of fully homomorphic encryption. Through security analysis, our schemes achieve the goals of privacy protection against passive attackers and cheating detection against active attackers. Experiments also demonstrate our schemes are more efficient in comparisons with the corresponding nonoutsourcing schemes.


2021 ◽  
Author(s):  
Jigang Yang ◽  
Zhenmin Li ◽  
Jingwei Ren ◽  
Xiaolei Wang ◽  
Wei Ni ◽  
...  

1992 ◽  
Vol 139 (2) ◽  
pp. 147
Author(s):  
G.A. Orton ◽  
L.E. Peppard ◽  
S.G. Akl

Sign in / Sign up

Export Citation Format

Share Document