A public-key cryptosystem invented by Pascal Paillier in 1999.
1
vote
2answers
112 views
How to verify a number encrypted with an unknown key
Are there any crypto-constructions to do the following kind of "zero-knowledge proof":
Alice encrypts a set of numbers using some cryptosystem and a secret key (e.g. Paillier crypto-system).
Bob ...
1
vote
1answer
70 views
Security relevance of random factor in Paillier
In the Paillier cryptosystem [1] the encryption of $m \in \mathbb{Z}_N$ with randomness $r \in \mathbb{Z}_n^*$ is $c = g^m r^n \bmod{n^2}$.
The additive-homomorphic property of the system shows that
...
2
votes
1answer
91 views
Questions about proof of correct encryption in the Paillier cryptosystem
In the Paillier cryptosystem [1] the encryption of $m \in \mathbb{Z}_N$ with randomness $r \in \mathbb{Z}_n^*$ is $c = g^m r^n \bmod{n^2}$.
A proof of correct encryption could look like presented in ...
3
votes
1answer
69 views
How hard are discrete logarithms problems in $\mathbb Z^{*}_{n}$ and $\mathbb Z^{*}_{n^2}$, where $n$ is the RSA $n=pq$
Use the notations form the Wikipedia article Paillier Cryptosystem
, assume that the chipertext $c$ and $c^{\lambda} \mod n^2$ are both given, is it possible to compute $\lambda$ easily?
1
vote
1answer
90 views
inverse element in Paillier cryptosystem
As I know, in Paillier cryptosystem, the encryption $c$ of a message $m$ is calculated as $c=g^m r^n \bmod n^2$.
Now, I am wondering if I can derive $g^m \bmod n^2$ given that I know $c$, $r$, and ...
1
vote
1answer
224 views
Several questions about Paillier cryptosystem
I have several questions concerning the original Paillier cryptosystem as described in Paillier, Pascal (1999).
"Public-Key Cryptosystems Based on Composite Degree Residuosity Classes".
EUROCRYPT. ...
-1
votes
1answer
191 views
Implementing Paillier Signature Scheme in Delphi
I've been trying to implement the Paillier Signature Scheme in Delphi, but I can't get it to work and I don't know where the problem is. First of all, I got my info about the scheme from this paper. ...
1
vote
1answer
147 views
ZKIP for Paillier public key correctness
I'm using the Paillier cryptosystem in a protocol similar to mental poker. In the beginning of the protocol, each player generates a Paillier public key $(n,g)$.
Later in the protocol, a player may ...
3
votes
3answers
375 views
Division in paillier cryptosystem
Is division possible in the Paillier Cryptosystem? i.e. given a the cipher-text $C$ of an integer $M$ the plain-text divisor $D$, and only the public key, can one compute the cipher-text of $M/D$ ?
