Hao Kong , Zi-Ming Wu , Bin Yan , Jeng-Shyang Pan , Hong-Mei Yang
{"title":"一种适用于FPGA处理的非扩展三维网格秘密共享方案","authors":"Hao Kong , Zi-Ming Wu , Bin Yan , Jeng-Shyang Pan , Hong-Mei Yang","doi":"10.1016/j.jvcir.2025.104580","DOIUrl":null,"url":null,"abstract":"<div><div>The existing meaningful secret sharing schemes for 3D model face the issue of model extension. To address this problem, we propose a non-extended secret 3D mesh sharing scheme. Considering the large amount of data that needs to be shared in a 3D model, we designed a circuit structure to accelerate the computation during sharing. In the sharing stage, vertex data is encoded and converted to integer data from floating-point data. This is more conducive to handling the computation in FPGA. By adjusting the length of the encoding, multiple secrets can be embedded in the vertex encoding stage. This solves the extension problem of the scheme. Experiments were conducted on a set of 3D meshes to compare the differences between the cover models and the shares. This experimental result shows that the shares maintain high fidelity with the cover meshes. Furthermore, the FPGA implementation achieves a throughput of 675Mbit/s. Simulation results show that the parallel circuit structure is 30 times faster than the serial structure. In terms of resource consumption, the circuit structure designed in this scheme occupies less than 5% of the on-chip resources.</div></div>","PeriodicalId":54755,"journal":{"name":"Journal of Visual Communication and Image Representation","volume":"112 ","pages":"Article 104580"},"PeriodicalIF":3.1000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A non-extended 3D mesh secret sharing scheme adapted for FPGA processing\",\"authors\":\"Hao Kong , Zi-Ming Wu , Bin Yan , Jeng-Shyang Pan , Hong-Mei Yang\",\"doi\":\"10.1016/j.jvcir.2025.104580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The existing meaningful secret sharing schemes for 3D model face the issue of model extension. To address this problem, we propose a non-extended secret 3D mesh sharing scheme. Considering the large amount of data that needs to be shared in a 3D model, we designed a circuit structure to accelerate the computation during sharing. In the sharing stage, vertex data is encoded and converted to integer data from floating-point data. This is more conducive to handling the computation in FPGA. By adjusting the length of the encoding, multiple secrets can be embedded in the vertex encoding stage. This solves the extension problem of the scheme. Experiments were conducted on a set of 3D meshes to compare the differences between the cover models and the shares. This experimental result shows that the shares maintain high fidelity with the cover meshes. Furthermore, the FPGA implementation achieves a throughput of 675Mbit/s. Simulation results show that the parallel circuit structure is 30 times faster than the serial structure. In terms of resource consumption, the circuit structure designed in this scheme occupies less than 5% of the on-chip resources.</div></div>\",\"PeriodicalId\":54755,\"journal\":{\"name\":\"Journal of Visual Communication and Image Representation\",\"volume\":\"112 \",\"pages\":\"Article 104580\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2025-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Visual Communication and Image Representation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1047320325001944\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Visual Communication and Image Representation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1047320325001944","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A non-extended 3D mesh secret sharing scheme adapted for FPGA processing
The existing meaningful secret sharing schemes for 3D model face the issue of model extension. To address this problem, we propose a non-extended secret 3D mesh sharing scheme. Considering the large amount of data that needs to be shared in a 3D model, we designed a circuit structure to accelerate the computation during sharing. In the sharing stage, vertex data is encoded and converted to integer data from floating-point data. This is more conducive to handling the computation in FPGA. By adjusting the length of the encoding, multiple secrets can be embedded in the vertex encoding stage. This solves the extension problem of the scheme. Experiments were conducted on a set of 3D meshes to compare the differences between the cover models and the shares. This experimental result shows that the shares maintain high fidelity with the cover meshes. Furthermore, the FPGA implementation achieves a throughput of 675Mbit/s. Simulation results show that the parallel circuit structure is 30 times faster than the serial structure. In terms of resource consumption, the circuit structure designed in this scheme occupies less than 5% of the on-chip resources.
期刊介绍:
The Journal of Visual Communication and Image Representation publishes papers on state-of-the-art visual communication and image representation, with emphasis on novel technologies and theoretical work in this multidisciplinary area of pure and applied research. The field of visual communication and image representation is considered in its broadest sense and covers both digital and analog aspects as well as processing and communication in biological visual systems.