1,246 reputation
817
bio website
location
age
visits member for 3 years
seen 4 hours ago

Sep
17
reviewed Approve suggested edit on Pollard's Rho - Constructing the random function
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?
Sep
10
revised Why does key generation take an input $1^k$, and how do I represent it in practice?
edited body
Sep
10
answered Why does key generation take an input $1^k$, and how do I represent it in practice?
Sep
7
reviewed Approve suggested edit on How does one calculate the scalar multiplication on elliptic curves?
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
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?