Skip to main content

New answers tagged

1 vote

Real-or-Random Security (IND$-CPA) for Homomorphic Encryption?

Yes. Consider the GSW-levelled homomorphic encryption scheme. A pseudorandom matrix $A \leftarrow \mathbb{Z}_q^{n \times m}$ serves as the scheme's public key, while the secret key is a vector $s \...
Mahesh S R's user avatar
0 votes
Accepted

Real-or-Random Security (IND$-CPA) for Homomorphic Encryption?

Often in homomorphic encryption, what "stage" you are at in the computation is leaked (intentionally) by the format of the ciphertext. As a very simple example, many FHE schemes have a "...
Mark Schultz-Wu's user avatar
  • 13.5k

Top 50 recent answers are included