Affiliation:
1. Shandong University of Science and Technology, China
Abstract
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 paper 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.
Publisher
Association for Computing Machinery (ACM)
Reference20 articles.
1. Marina Blanton, Ahreum Kang, and Chen Yuan. 2020. Improved building blocks for secure multi-party computation based on secret sharing with honest majority. In International conference on applied cryptography and network security. Springer, 377–397.
2. Secret sharing approaches for 3D object encryption;Elsheh Esam;Expert Systems with Applications,2011
3. Rational secret sharing and multiparty computation
4. A Hierarchical Non-interactive Key-Sharing Scheme with Low Memory Size and High Resistance against Collusion Attacks
5. A novel color image encryption algorithm using coupled map lattice with polymorphic mapping;Huang Penghe;Electronics,2022