Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination
With the development of cloud computing and internet of things technology, verifiable computing has been widely used as a new computing technology. While verifiable computing brings convenience to users, there are also security challenges: data privacy, verifiability of results, and efficiency. At p...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
POSTS&TELECOM PRESS Co., LTD
2024-04-01
|
| Series: | 网络与信息安全学报 |
| Subjects: | |
| Online Access: | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024035 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841529552518512640 |
|---|---|
| author | ZHANG Tianpeng REN Zhiyu DU Xuehui WANG Haichao |
| author_facet | ZHANG Tianpeng REN Zhiyu DU Xuehui WANG Haichao |
| author_sort | ZHANG Tianpeng |
| collection | DOAJ |
| description | With the development of cloud computing and internet of things technology, verifiable computing has been widely used as a new computing technology. While verifiable computing brings convenience to users, there are also security challenges: data privacy, verifiability of results, and efficiency. At present, the sparse matrix multiplication encryption method is used to protect the privacy of data in the matrix multiplication verifiable calculation scheme. After analyzing the sparse matrix encryption algorithm, it is found that there are two challenges. The one is that the row or column common factor leaks the row or column data of the original matrix. The other is that the zero element leaks the statistic information of the zero element of the original matrix. Meanwhile,the existing scheme is also not ideal for the verification efficiency of cloud server computing results.Aiming at the challenge of data privacy protection, the designed batch matrix multiplication verifiable computation scheme uses triple perturbation encryption algorithm to achieve stronger privacy protection without increasing the computational complexity of encryption and decryption. Specifically, a special upper or lower triangular sparse matrix is constructed to add double perturbation (multiplicative perturbation and additive perturbation) to protect row or column data, and a special additive sparse matrix is constructed to add a single perturbation (additive perturbation) to protect zero element information. Aiming at the challenge of verification efficiency of cloud server computing results, the scheme uses matrix linear combination technology to realize batch verification of calculation results. The verification efficiency is increased by about 50 times and increases with the increase of the number of matrices. Performance analysis shows that this scheme does not increase the client encryption and decryption overhead and improves the efficiency of result verification. |
| format | Article |
| id | doaj-art-ab20b10645a649198ed3a4ebc01ba87a |
| institution | Kabale University |
| issn | 2096-109X |
| language | English |
| publishDate | 2024-04-01 |
| publisher | POSTS&TELECOM PRESS Co., LTD |
| record_format | Article |
| series | 网络与信息安全学报 |
| spelling | doaj-art-ab20b10645a649198ed3a4ebc01ba87a2025-01-15T03:17:06ZengPOSTS&TELECOM PRESS Co., LTD网络与信息安全学报2096-109X2024-04-011012113263897223Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combinationZHANG TianpengREN ZhiyuDU XuehuiWANG HaichaoWith the development of cloud computing and internet of things technology, verifiable computing has been widely used as a new computing technology. While verifiable computing brings convenience to users, there are also security challenges: data privacy, verifiability of results, and efficiency. At present, the sparse matrix multiplication encryption method is used to protect the privacy of data in the matrix multiplication verifiable calculation scheme. After analyzing the sparse matrix encryption algorithm, it is found that there are two challenges. The one is that the row or column common factor leaks the row or column data of the original matrix. The other is that the zero element leaks the statistic information of the zero element of the original matrix. Meanwhile,the existing scheme is also not ideal for the verification efficiency of cloud server computing results.Aiming at the challenge of data privacy protection, the designed batch matrix multiplication verifiable computation scheme uses triple perturbation encryption algorithm to achieve stronger privacy protection without increasing the computational complexity of encryption and decryption. Specifically, a special upper or lower triangular sparse matrix is constructed to add double perturbation (multiplicative perturbation and additive perturbation) to protect row or column data, and a special additive sparse matrix is constructed to add a single perturbation (additive perturbation) to protect zero element information. Aiming at the challenge of verification efficiency of cloud server computing results, the scheme uses matrix linear combination technology to realize batch verification of calculation results. The verification efficiency is increased by about 50 times and increases with the increase of the number of matrices. Performance analysis shows that this scheme does not increase the client encryption and decryption overhead and improves the efficiency of result verification.http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024035triple perturbationlinear combinationenhanced privacyimproved efficiencyverifiable computation |
| spellingShingle | ZHANG Tianpeng REN Zhiyu DU Xuehui WANG Haichao Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination 网络与信息安全学报 triple perturbation linear combination enhanced privacy improved efficiency verifiable computation |
| title | Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| title_full | Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| title_fullStr | Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| title_full_unstemmed | Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| title_short | Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| title_sort | verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination |
| topic | triple perturbation linear combination enhanced privacy improved efficiency verifiable computation |
| url | http://www.cjnis.com.cn/thesisDetails#10.11959/j.issn.2096-109x.2024035 |
| work_keys_str_mv | AT zhangtianpeng verifiablecomputationschemeofbatchmatrixmultiplicationbasedontripleperturbationandlinearcombination AT renzhiyu verifiablecomputationschemeofbatchmatrixmultiplicationbasedontripleperturbationandlinearcombination AT duxuehui verifiablecomputationschemeofbatchmatrixmultiplicationbasedontripleperturbationandlinearcombination AT wanghaichao verifiablecomputationschemeofbatchmatrixmultiplicationbasedontripleperturbationandlinearcombination |