network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 2 months |
| seen | Jun 10 '12 at 11:01 | |
| stats | profile views | 2 |
|
Mar 30 |
awarded | Student |
|
Mar 27 |
awarded | Scholar |
|
Mar 27 |
accepted | ZKIP for Paillier public key correctness |
|
Mar 27 |
comment |
ZKIP for Paillier public key correctness Thanks. I think there are more Paillier variants (e.g. setting $g=n+1$) that would only require us to prove that $n$ is a valid RSA number. I skimmed through the article you posted, but it seems quite complicated (it would be the most complicated part of my protocol by far), so I'd prefer not to go that way. It's a correct solution though, so if I don't find another way, I might use it (or at least cite it as a possibility). |
|
Mar 25 |
asked | ZKIP for Paillier public key correctness |
