Lawrence Lim
Lawrence Lim
I need to use the TPC-DS workload for a project. Is the TPC-DS workload completed? If not, what's missing? Could I implement it?
## About the author My name is Lawrence, and I am a PhD student studying computer science at UCSB. My field of study is privacy-preserving systems, which is building applications...
# Halevi-Shoup Matrix Multiplication Matrix multiplications are ubiquitous across applications involving machine learning, computer vision, search, and more. Providing an efficient method of matrix multiplications over homomorphically encrypted data can...
Given a tree of associative operations, say (((a * b) * c) * d), then rebalance the tree to be (a * b) * (c * d). This improves performance...
Given a tree of operations, say (a*b + a*c), reduce the number of operations by using the distributive property to obtain (a * (b + c)). Note that this provides...
Our encryption and decryption when lowering LWE to Polynomial (in LWEToPolynomial.cpp) currently only supports BGV and there is still work to do to add support for CKKS, TFHE, and BFV....
Currently, our lowering for RLWE to Polynomial does not handle TFHE. Other schemes, like BGV have ciphertexts composed of 2 polynomials and a secret key composed of 1 polynomial; however,...
In our lowering for LWE encryption (inside LWEToPolynomial.cpp), we need to configure some of the parameters for the randomness. Parameters that need to be configured include: * Seed * Standard...
Currently, our lowering for LWE to Polynomial only supports public key encryption (see LWEToPolynomial.cpp and #874). We need to add support for Secret Key Encryption as well.
# Adding CKKS to HEIR ### Background This issue describes design decisions and changes for creating a CKKS Dialect. CKKS is a FHE scheme that enables homomorphic floating point operations,...