FPGA acceleration of secret sharing for 3D data cubes

Secret sharing can protect the security of important secret information in the network environment. However, the computational complexity and processing delay increase drastically when the secret information contains large amounts of data, such as three-dimensional (3D) data cubes. To improve the ef...

Full description

Saved in:
Bibliographic Details
Published in:Journal of real-time image processing 2023-08, Vol.20 (4), p.82, Article 82
Main Authors: Wu, Zi-Ming, Liu, Tao, Yan, Bin, Pan, Jeng-Shyang, Yang, Hong-Mei
Format: Article
Language:English
Subjects:
Access control
Addition & subtraction
Boolean
Circuits
Computation
Computer Graphics
Computer Science
Cryptography
Cubes
Data encryption
Efficiency
Field programmable gate arrays
Hardware
Image Processing and Computer Vision
Medical records
Multimedia Information Systems
Pattern Recognition
Polynomials
Prime numbers
Reconstruction
Signal,Image and Speech Processing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Secret sharing can protect the security of important secret information in the network environment. However, the computational complexity and processing delay increase drastically when the secret information contains large amounts of data, such as three-dimensional (3D) data cubes. To improve the efficiency of secret sharing on 3D data cubes, this paper proposes a hardware architecture to accelerate the generation of shares and reconstruction of the secret. The proposed hardware architecture parallelizes the secret sharing process and optimizes on this basis to save large amounts of circuit resources. Simulation results show that this architecture performs secret sharing more than ten times faster than the software implementation. This study enables the secret sharing of 3D data cubes, which protect large amounts of data information throughout the process and allows complete reconstruction of 3D data cubes. To be able to handle secrets without decoding them, we then extend the hardware architecture to the four basic processes of multi-party computation, demonstrating the feasibility of the structure and providing preliminary research tools for the effective implementation of multi-party computation.
ISSN:1861-8200
1861-8219
DOI:10.1007/s11554-023-01337-0