Skip to main content
Cryptography

Return to Question

Corrected typos, removed thanks and highlighted the parameters
Source Link
edit approved Aug 12, 2023 at 12:20
Rohit Gupta
edit approved Aug 12, 2023 at 12:20
Rohit Gupta
  • 477
  • 2
  • 5
  • 10

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (8x1 Vector) (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384poly_modulus_degree=16384 and plain_modulus=536903681plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in a way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (8x1 Vector) (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (8x1 Vector) (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in a way, that would allow an unlimited amount of computations, right?

added 13 characters in body
Source Link
Freak14
Freak14
  • 23
  • 3

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (8x1 Vector) (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (8x1 Vector) (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

added 7 characters in body
Source Link
Freak14
Freak14
  • 23
  • 3

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

I am currently playing around with some of the Python FHE libraries and found out that, e.g. TenSeal (SEAL) is able to perform "only" 8 ciphertext-ciphertext multiplications on the same ciphertext (c1 = c1*c2 in a loop) before the noise threshold is surpassed and decryption fails.

The parameters I set for this are: poly_modulus_degree=16384 and plain_modulus=536903681 using the BFV Scheme.

Is it even possible to perform arbitrary amounts of operations on the same ciphertext, assuming runtime is irrelevant? I understand, that multiplication operations increase noise significantly, but methods like bootstrapping and relinearization do not seem to decrease the noise in way, that would allow an unlimited amount of computations, right?

Thanks

Source Link
Freak14
Freak14
  • 23
  • 3