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 1991
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 *).
5
votes
Accepted
FHE over the Integers - reduction to approximate gcd problem
Before my answer, I would like to review the original binary GCD algorithm @wikipedia. Roughly speaking, this algorithm replaces division with binary shifts and subtraction.
For two positive integers …
- 2,186
7
votes
Accepted
Fully Homomorphic Encryption over the Integers - Runtime Question
On the first question
The public key of DGHV's SHE scheme consists of $\tau+1$ $\gamma$-bit numbers, that is, $pk = (x_0,\dots,x_\tau)$, where $x_i$ is chosen from the distribution $\mathcal{D}_{\gam …
- 2,186
12
votes
Accepted
Homomorphic Encryption and Semantic Security using Lattices?
The LWE assumption
I think we should start from the LWE assumption.
Let $n$ and $q$ be integers and let $\chi$ be a distribution over $\mathbb{Z}_q$. We often take $\chi$ as a Gaussian with small var …
- 2,186
2
votes
Is there an encyption scheme that combines additive homomorphism with ability to proxy re-en...
Very recently,
Yoshinori Aono, Xavier Boyen, Le Trieu Phong, and Lihua Wang (INDOCRYPT 2013) proposed an additively-homomorphic proxy re-encryption scheme from lattices, which is multi-hop, unidirect …
- 2,186
8
votes
Accepted
Can we proxy-re-encrypt using homomorphic encryption schemes?
YES. It is pointed out by Gentry (in his thesis) when he consider bootstrapping and re-encryption.
Let us denote the old key pair by $(PK, SK)$ and the new key pair by $(PK^1, SK^1)$.
What the user …
- 2,186