Ciphertext-ciphertext matrix multiplication: fast for large matrices

DOI10.1007/978-3-031-91101-9_6MaRDI QIDQ6891169zbMATH OpenFDO

Authors Jai Hyun Park

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91101-9_6

zbMATH Keywords

CC-MM algorithm for large matricesmatrix multiplication of two encrypted matrices

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A full RNS variant of approximate homomorphic encryption
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A simple BGN-type cryptosystem from LWE
• Better bootstrapping for approximate homomorphic encryption
• Bootstrapping for approximate homomorphic encryption
• Classical hardness of learning with errors
• Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Gaussian elimination is not optimal
• HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
• Homomorphic encryption for arithmetic of approximate numbers
• Lossy trapdoor functions and their applications
• On ideal lattices and learning with errors over rings
• On the concrete hardness of learning with errors
• Rotation key reduction for client-server systems of deep neural network on fully homomorphic encryption
• Worst-case to average-case reductions for module lattices

Cited in

(1)

• Fast homomorphic linear algebra with BLAS

This page was built for publication: Ciphertext-ciphertext matrix multiplication: fast for large matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891169)