Matrix computation over homomorphic plaintext-ciphertext and its application
Those homomorphic encryption schemes supporting single instruction multiple data (SIMD) operations effectively enhance the amortized efficiency of ciphertext computations, yet the structure of ciphertexts leads to high complexity in matrix operations.In many applications, employing plaintext-ciphert...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024024/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540065596014592 |
|---|---|
| author | Yang LIU Linhan YANG Jingwei CHEN Wenyuan WU Yong FENG |
| author_facet | Yang LIU Linhan YANG Jingwei CHEN Wenyuan WU Yong FENG |
| author_sort | Yang LIU |
| collection | DOAJ |
| description | Those homomorphic encryption schemes supporting single instruction multiple data (SIMD) operations effectively enhance the amortized efficiency of ciphertext computations, yet the structure of ciphertexts leads to high complexity in matrix operations.In many applications, employing plaintext-ciphertext matrix operations can achieve privacy-preserving computing.Based on this, a plaintext-ciphertext matrix multiplication scheme for matrices of arbitrary dimension was proposed.The resulting ciphertext was computed through steps such as encoding the plaintext matrix, transforming the dimensions of the encrypted matrix, etc.Compared to the best-known encrypted matrix multiplication algorithm for square matrices proposed by Jiang et al., the proposed scheme supported matrix multiplication of arbitrary dimension, and consecutive matrix multiplications.Both theoretical analysis and experimental results show that the proposed scheme requires less rotations on ciphertexts and hence features higher efficiency.When applied to a privacy-preserving Bayesian classifier, the proposed scheme can complete classification tasks with higher security parameters and reduced running time. |
| format | Article |
| id | doaj-art-b5ce715cf74c43b6b174ba38c1d8b147 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-02-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-b5ce715cf74c43b6b174ba38c1d8b1472025-01-14T06:22:07ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-02-014515016159383376Matrix computation over homomorphic plaintext-ciphertext and its applicationYang LIULinhan YANGJingwei CHENWenyuan WUYong FENGThose homomorphic encryption schemes supporting single instruction multiple data (SIMD) operations effectively enhance the amortized efficiency of ciphertext computations, yet the structure of ciphertexts leads to high complexity in matrix operations.In many applications, employing plaintext-ciphertext matrix operations can achieve privacy-preserving computing.Based on this, a plaintext-ciphertext matrix multiplication scheme for matrices of arbitrary dimension was proposed.The resulting ciphertext was computed through steps such as encoding the plaintext matrix, transforming the dimensions of the encrypted matrix, etc.Compared to the best-known encrypted matrix multiplication algorithm for square matrices proposed by Jiang et al., the proposed scheme supported matrix multiplication of arbitrary dimension, and consecutive matrix multiplications.Both theoretical analysis and experimental results show that the proposed scheme requires less rotations on ciphertexts and hence features higher efficiency.When applied to a privacy-preserving Bayesian classifier, the proposed scheme can complete classification tasks with higher security parameters and reduced running time.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024024/homomorphic encryptionmatrix computationmachine learningBayesian classifier |
| spellingShingle | Yang LIU Linhan YANG Jingwei CHEN Wenyuan WU Yong FENG Matrix computation over homomorphic plaintext-ciphertext and its application Tongxin xuebao homomorphic encryption matrix computation machine learning Bayesian classifier |
| title | Matrix computation over homomorphic plaintext-ciphertext and its application |
| title_full | Matrix computation over homomorphic plaintext-ciphertext and its application |
| title_fullStr | Matrix computation over homomorphic plaintext-ciphertext and its application |
| title_full_unstemmed | Matrix computation over homomorphic plaintext-ciphertext and its application |
| title_short | Matrix computation over homomorphic plaintext-ciphertext and its application |
| title_sort | matrix computation over homomorphic plaintext ciphertext and its application |
| topic | homomorphic encryption matrix computation machine learning Bayesian classifier |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024024/ |
| work_keys_str_mv | AT yangliu matrixcomputationoverhomomorphicplaintextciphertextanditsapplication AT linhanyang matrixcomputationoverhomomorphicplaintextciphertextanditsapplication AT jingweichen matrixcomputationoverhomomorphicplaintextciphertextanditsapplication AT wenyuanwu matrixcomputationoverhomomorphicplaintextciphertextanditsapplication AT yongfeng matrixcomputationoverhomomorphicplaintextciphertextanditsapplication |