Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 115960

Cryptosystems which support computation on encrypted data. They might be partially homomorphic (support for one operation such as + or *) or they might be fully homomorphic (any sequence of + and *).

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
1 vote
1 answer
99 views

Is it possible to homomorphically evaluate an encryption circuit?

I know that it is possible to homomorphically evaluate a decryption circuit as it is the main idea behind bootstrapping, but I was wondering if it was possible to evaluate an encryption circuit homomo …
ProfCornDog's user avatar
0 votes
1 answer
150 views

Plaintext modulus choice for Fully Homomorphic Encryption

For SIMD fully homomorphic encryption scheme like BFV/BGV, and the underlying R-LWE problem parameterized by $n, p, q, \alpha$ (respectively the dimension, the plaintext modulus, the ciphertext modulu …
ProfCornDog's user avatar
0 votes

Urgent help with LWE Estimator

There is in a fact a documentation here, but it might be a bit tricky to navigate around it if you are not used to it. For a basic example, we first need to have sage installed, as well as the lattice …
ProfCornDog's user avatar