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 paillier
Search options questions only
not deleted
user 13740
A public-key cryptosystem invented by Pascal Paillier in 1999.
4
votes
1
answer
264
views
Why multiple homomorphic operations on a ciphertext leaks no information about the plaintext?
Scenario:
Assume I encrypt message $m$ using Paillier encryption, so I would get $c=E(m)$.
I give the identical $c$ to two different parties, parties $D$ and $E$. … Remark 2: I mentioned Paillier because I'm using it right now, and the question can be generalized for any homomorphic encryptions. …
- 1,583
4
votes
1
answer
1k
views
Paillier encryption: Many private keys for a public key
Assume $N$ is a public key for paillier encryption, generated by a third party.
Question: Given $N$ can each client generate its own private key, such that its public key is $N$? …
- 1,583
3
votes
1
answer
105
views
Homomorphic $\bmod p$ operation
Let $E(m)$ a be the encryption operation using Paillier encryption scheme. Let $N$ be the public key and $p$ be a large prime number, such that $p<N$. …
- 1,583
2
votes
1
answer
424
views
a homomorphic operation on Paillier encryption
We encrypt a message as $c=E(r\cdot m)$ using Paillier encryption. …
- 1,583