HElib is an open-source software library that implements homomorphic encryption. It supports the BGV scheme with bootstrapping and the Approximate Number CKKS scheme. HElib also includes optimizations for efficient homomorphic evaluation, focusing on effective use of ciphertext packing techniques and on the Gentry-Halevi-Smart optimizations.
I want to know if you considered multiplication under different secret keys. Assume we have c3 = c1 * c2, which means c3 is the tensor product of c1 and c2, and c1 is under secret key s1, c2 is under secret key s2, can we decrypt c3 with s3 = s1 * s_2, I computed this and think it may work, but I know from your code that this operation is not allowed( I read code carefully and I have read the design document). Is my computation wrong or this operation is hard to do ?
I want to know if you considered multiplication under different secret keys. Assume we have
c3 = c1 * c2
, which meansc3
is the tensor product ofc1
andc2
, andc1
is under secret keys1
,c2
is under secret keys2
, can we decryptc3
withs3 = s1 * s_2
, I computed this and think it may work, but I know from your code that this operation is not allowed( I read code carefully and I have read the design document). Is my computation wrong or this operation is hard to do ?