4 ms·

> 1. yes, exactly. How is this possible (I have no clue about FHE)? If the server can do operations on the image, then the image can't look like random noise,

> 1. yes, exactly. How is this possible (I have no clue about FHE)? If the server can do operations on the image, then the image can't look like random noise, or not? And if there are indeed patterns the server can operate on, then the image can be decrypted?

Dylan16807 5y ago
If you can write a program with few to no if statements that depend on the data, then you can run that program relatively efficiently under FHE. A blur or sharpen filter would be an easy example. The server sees you take the random noise of each pixel, mix it with the nearby pixels, and output new random noise.
- bildung 5y ago
  > The server sees you take the random noise of each pixel, mix it with the nearby pixels, and output new random noise. Which means the pixel positions are known to the server, which means the image isn't really encrypted?
  - Dylan16807 5y ago
    A blur filter does the exact same thing to every pixel. The server would know that you're doing a blur, but it would have no idea what the contents of the image are. Your data is encrypted. Your program is not encrypted. If you want to hide your program, then things will get much slower yet again.
    - bildung 5y ago
      Sorry if I'm being too thick here, but a blur filter needs information about the neighbour pixels. It can't operate on a single pixel alone (well it changes things pixel by pixel, but needs the neighbour pixels as input). If I can extract these neighbour pixels from the encrypted image, why can't I extract the image itself?
      - Dylan16807 5y ago
        Each pixel is encrypted separately. FHE lets the server take two encrypted numbers and add or multiply them to make a new encrypted number. There is no way for the server to ever know what any of those numbers actually are.
aasasd 5y ago
> If the server can do operations on the image, then the image can't look like random noise, or not? FHE is precisely the magic that allows doing operations on encrypted data and get encrypted results that you can then decrypt to valid end result.

Dylan16807 5y ago

If you can write a program with few to no if statements that depend on the data, then you can run that program relatively efficiently under FHE. A blur or sharpen filter would be an easy example. The server sees you take the random noise of each pixel, mix it with the nearby pixels, and output new random noise.

bildung 5y ago
> The server sees you take the random noise of each pixel, mix it with the nearby pixels, and output new random noise. Which means the pixel positions are known to the server, which means the image isn't really encrypted?
- Dylan16807 5y ago
  A blur filter does the exact same thing to every pixel. The server would know that you're doing a blur, but it would have no idea what the contents of the image are. Your data is encrypted. Your program is not encrypted. If you want to hide your program, then things will get much slower yet again.
  - bildung 5y ago
    Sorry if I'm being too thick here, but a blur filter needs information about the neighbour pixels. It can't operate on a single pixel alone (well it changes things pixel by pixel, but needs the neighbour pixels as input). If I can extract these neighbour pixels from the encrypted image, why can't I extract the image itself?
    - Dylan16807 5y ago
      Each pixel is encrypted separately. FHE lets the server take two encrypted numbers and add or multiply them to make a new encrypted number. There is no way for the server to ever know what any of those numbers actually are.

aasasd 5y ago

> If the server can do operations on the image, then the image can't look like random noise, or not? FHE is precisely the magic that allows doing operations on encrypted data and get encrypted results that you can then decrypt to valid end result.