Sander, Young, and Yung (SYY) Scheme

SYY describes first SWHE scheme over a semi-group. It is another idea of evaluating operations on encrypted data that is realized over different sets. This idea requires fewer properties than a group. This scheme Polynomially supports many ANDing of ciphertexts with one OR/NOT gate. Therefore, the ciphertext size increases due to the constant multiplication with each OR/NOT gate evaluation. However, the limits of the circuit depth evaluation are increased.

Leave a comment