Search Results
| 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 homomorphic-encryption
Search options not deleted
user 36088
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 *).
4
votes
1
answer
171
views
Example of partial homomorphic encryption over $\mathbb{F}_{2^k}$?
I'm looking for a partial additive homomorphic encryption over $\mathbb{F}_{2^k}$.
I know that, I can take an additive homomorphic encryption over $\mathbb{F}_2$ and just concatenate each bit that we …
- 455
2
votes
1
answer
535
views
The existence of partial homomorphic additive encryption with bit-wise XOR operation
According to Protocol A that was presented in Section 3.1 paper entitled "Some Efficient Solutions to Yao’s Millionaire Problem" (2013). [1]
In that protocol they used an assumption that there is a …
- 455
2
votes
1
answer
189
views
BGN encryption scheme with unbounded message space
In Evaluating 2-DNF Formulas on Ciphertexts stated that
decryption in this system takes polynomial time in the size of the message space T. Therefore, the system as described above can only be us …
- 455
1
vote
2
answers
100
views
Constraint about encrypted values
Let V = $[x_1,\ldots ,x_n]$ be a binary vector of length $n$, and let $E(V)$ be the entrywise encryption of this vector.
Suppose I want to give to another player, $E(V)$, but also let him have the a …
- 455
1
vote
0
answers
527
views
Complexity of computing homomorphic encrypted matrix multiplication
Given two players $P_1 , P_2$ .
In our setting $P_1$ poses two encrypted matrices $M_{1_{k \times k}},M_{2_{k \times k}}$ over field $F$, and the encryption has additive homomorphic property, over pu …
- 455