Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

New answers tagged

4 votes

Why is division in fully homomorphic encryption impossible?

Fully homomorphic encryption is (mostly) able to perform operations that may be encoded as polynomials. One can attempt to encode (integer) division in this form by exploiting the identity $$ \frac{1}{...
Mark Schultz-Wu's user avatar
  • 13.3k
1 vote

How can one model the behaviour of CKKS decryption noise?

How should I model the noise that my simulator should inject when decrypting? How does this noise change when applying the various homomorphic operations? What is the shape of the noise distribution? (...
Mark Schultz-Wu's user avatar
  • 13.3k
3 votes

Why is division in fully homomorphic encryption impossible?

It is not really about the devs, but more about the complexity of division for known fully homomorphic encryption schemes. Without going into much details, while addition and multiplication are pretty ...
ProfCornDog's user avatar
0 votes

Plaintext modulus choice for Fully Homomorphic Encryption

Actually $p$ is not related to security, it's only related to usability: larger $p$ could hold larger plaintext at the cost of more error growth. As you can see in the Homomorphic encryption standard (...
vince.h's user avatar
  • 147
1 vote

Efficient commutative one-way encryption or hashing

Here is an idea. All quantities are integers, sometime assimilated to bytestrings of stated fixed size. Let $p$ be a public safe prime in interval $[2^{2047},2^{2048}-2^{64})$, that is a prime $p$ in ...
fgrieu's user avatar
  • 142k
1 vote
Accepted

Decrypting the sum of votes but not the single vote

I think there's something called Threshold Homomorphic Encryption. The decryption key is split into multiple shares, and a certain threshold of shares is required to decrypt the result. The shares are ...
suchislife's user avatar
0 votes
Accepted

About IND-CPA security of Homomorphic Encryption

First, it should be mentioned that a ciphertext does not expose anything about the plaintext is not the common definition of IND-CPA security for homomorphic encryption. Roughly speaking, in (fully) ...
Mark Schultz-Wu's user avatar
  • 13.3k
0 votes

About IND-CPA security of Homomorphic Encryption

I don't know a standard game for what the question wants to achieve. If I understand the requirement to be tested, it's met by a simple variant of Paillier encryption: define $\operatorname{Enc}(x)+\...
fgrieu's user avatar
  • 142k

Top 50 recent answers are included