1,323 reputation
819
bio website
location
age
visits member for 3 years, 1 month
seen 51 mins ago

Dec
10
comment Proving the semantic security of the One Time pad
There is.I edit my answer
Nov
10
comment Best group if one wants the discrete log problem to be hard?
@RickyDemer why #2 is easy?
Oct
20
comment problem with “one time pad”
What do you mean if you have the same message the same message is encrypted?
Oct
16
comment Does the following linear equation hold in bilinear pairings:
Maybe it was not clearly defined but the setup is for any randomly chosen $a_1,a_2$ and $x_1,x_2$
Oct
15
comment Database row level encryption scheme
What is the number of particles in the universe
Sep
11
comment What exactly is a negligible (and non-negligible) function?
Numerically what is negligible nowdays? $2^{-80},2^{-70},?$ And can this be justified with existing computational power?
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
Paillier cryptosystem is also randomized. It is additively homomorphic. EAch time the same message is encrypted in different ciphertexts. However the decryption is deterministic... That's why encryption algorithms are described as randomized processes and decryption as deterministic. The former it's for security while the latter it's for correctness
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
@pAkY88 Well since you are thinking of not decrypting then it seems that you are looking for a homomorhpic hash-tag like primitive...
Aug
12
comment linear computations over bilinear pairings
Thank you. Very illustrative answer!
Aug
12
comment linear computations over bilinear pairings
if $x_2=g_2^{r_1}$ and $x_4=g_2^{r_2}$ does anything change for $r_1, r_2 \in \mathbb{Z}_p$
Aug
12
comment linear computations over bilinear pairings
It's not very clear to me what does it mean for $e(x_1,x_4)$ and $e(x_2,x_3)$ to be opposite...
Jul
17
comment Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
Sorry for my unclear comment. It's is its and refers to the inverse of $b$ mod (p-1). Is $p$ unknown?
Jul
17
comment Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
I guess in $\mathbb{Z}_p$ after finding it's inverse
Jun
2
comment Reductionist proofs of decisional problems to computational
This is also another right-up towards this direction cseweb.ucsd.edu/~mihir/papers/gl.pdf
Jun
2
comment Reductionist proofs of decisional problems to computational
Thank you. Very educative and precise analysis
May
22
comment Security assessment between $g^{a_ix_i+r_i}$ and $g^{x_i+r_i}$
there is a relaxed security definition and the attacker is allowed to reveal the sum but not the individual values. There is no all-or-nothing definition...
May
21
comment Security assessment between $g^{a_ix_i+r_i}$ and $g^{x_i+r_i}$
The adversary doesn't know $x_i$
May
21
comment Security assessment between $g^{a_ix_i+r_i}$ and $g^{x_i+r_i}$
Nice question. $r_i$ is 'partially' secret. It is used to verify aggregate results. $g^{\sum{r_i}}$ is revealed
Apr
16
comment Existence of a map $\phi:\mathbb{Z}_{N^2}^* \mapsto \mathbb{F} $
@poncho. the multiplicative one: $\phi(ab)=\phi (a)\phi (b)$
Apr
16
comment Existence of a map $\phi:\mathbb{Z}_{N^2}^* \mapsto \mathbb{F} $
@fgrieu But from the isomorphism of the crt?