Loading…

FPGA Accelerated Implementation of 3D Mesh Secret Sharing Based on Symmetric Similarity of Model

Secret sharing is particularly important in the field of information security, which allows for the reconstruction of secret information from secure shares. However, due to the large amount of data and non-integer data type of 3D (three-dimensional) models, it is less efficient to perform sharing co...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on reconfigurable technology and systems 2024-12, Vol.17 (4), p.1-19, Article 60
Main Authors: Wu, Zi-Ming, Zhao, Meng-Yuan, Yan, Bin, Pan, Jeng-Shyang, Yang, Hong-Mei
Format: Article
Language:English
Subjects:
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 is particularly important in the field of information security, which allows for the reconstruction of secret information from secure shares. However, due to the large amount of data and non-integer data type of 3D (three-dimensional) models, it is less efficient to perform sharing compared to the 2D(two-dimensional) digital images. In order to enable efficient sharing of 3D models as well, this article designs different circuit modules to parallelize the process of sharing 3D models. The proposed structure exploits the vertex extension to perform a complete reconstruction of the 3D model. In the sharing phase, the symmetric similarity of 3D model is exploited to realize the sharing in parallel, which improves the efficiency of sharing. In the reconstruction phase, the Strassen algorithm is used to optimize matrix multiplication, which saves circuit resources. Simulation results show that the structure performs more than 100 times faster than software. The utilization of circuit resources and the size of the share are both optimized. The validity of the designed hardware architecture is confirmed after analyzing the data from experiments performed on several 3D models.
ISSN:1936-7406
1936-7414
DOI:10.1145/3689049