Alexander Viand
Alexander Viand
Finding out if an element is non-zero (i.e. computing `f(x) = (x != 0)`) can be tricky under encryption. If the vector elements were already binary, then it's very easy,...
Hi, I don't think you'll have much success with BFV here. Try to use the CKKS scheme, which supports a kind of "floating point like" approximate computation that works much...
The best way to analyze communication costs would probably to use SEAL's serialization feature. Either by actually writing the ciphertext to a file, or by using something like `save_size` (see...
While it would be quite easy to do these things using someone's personal access token, putting that kind of access into a random EC2 instance would be unwise. We could...
/remind me to consider GitHub App in 5 days
Ideally, we would also benchmark Cingulata's built-in implementation, but that might not be feasible. The same goes for Alchemy.
Oh, that's interesting! But sure, let's compare it anyway - might be interesting to see if there's a significant difference to TFHE
I know this question is pretty old, but maybe it's still helpful to your or others stopping by: I used to have a decent reference for the "three-for-two" trick but...
As a (windows) user of a downstream [library ](https://github.com/zama-ai/concrete/) that uses the system feature it'd be great to see support for this added. I'm working around it by using WSL...
Closing remaining cmake-related issues after we fully dropped cmake support