Hi, I have read your paper but something seem missing.
- What is the exact BGV parameters (ie. lattice dimension, and ciphertext modulus) used in the paper ?
- In the Full version Figure 9, it says when the sparse index
I is not empty, then ZKP using binary challenge matrix W.
However the SparseProof class seems not check whether the sparse vector is empty or not.