Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/184215
Title: | Secure and efficient general matrix multiplication on cloud using homomorphic encryption | Authors: | Min Khant Htoo | Keywords: | Computer and Information Science | Issue Date: | 2025 | Publisher: | Nanyang Technological University | Source: | Min Khant Htoo (2025). Secure and efficient general matrix multiplication on cloud using homomorphic encryption. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/184215 | Abstract: | Matrix multiplication is a common operation in scientific computing, but can be com- putationally expensive. Cloud computing provides a scalable solution, but using it for sensitive data, such as medical records, raises privacy concerns. Homomorphic encryp- tion allows cloud computation service providers to operate on the encrypted matrices without decryption, but its high computational cost makes it impractical for real-world large-scale tasks. A previous study by Yang Gao et al. introduced the HEGMM (Ho- momorphic Encryption General Matrix Multiplication) algorithm, which uses SIMD (Single instruction, Multiple Data) operations to overcome this bottleneck. In this project, we build on their work by implementing 2 matrix packing methods to further improve the performance of HEGMM. | URI: | https://hdl.handle.net/10356/184215 | Schools: | College of Computing and Data Science | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | CCDS Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
UTF-8FYP_Min_Khant_Htoo.pdf Restricted Access | 278.53 kB | Adobe PDF | View/Open |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.