1,223 reputation
716
bio website
location
age
visits member for 2 years, 11 months
seen 2 hours ago

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
29
answered Homomorphic Encryption: how does the equality test on ciphertexts work?
Aug
19
answered Cryptography vs Security
Aug
12
accepted linear computations over bilinear pairings
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...
Aug
12
revised linear computations over bilinear pairings
edited body
Aug
12
asked linear computations over bilinear pairings
Aug
7
awarded  Nice Question
Jul
17
revised pairing-based schemes
edited body
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
Jul
17
answered Given $g$, $b$, $g^{ab}$, is finding $g^a$ a hard problem?
Jul
13
answered pairing-based schemes
Jul
8
reviewed Approve suggested edit on Is either brainpoolP320r1 or brainpoolP320t1 a SafeCurve?
Jul
2
awarded  Inquisitive
Jul
2
awarded  Curious
Jun
12
awarded  Nice Question
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