79 reputation
5
bio website
location
age
visits member for 1 year, 7 months
seen Dec 13 '13 at 5:45

Aug
26
accepted The “Square Root” Solution of Oblivious RAM Simulation
Aug
26
comment The “Square Root” Solution of Oblivious RAM Simulation
Ah I figured it out, thank you for your answer!
Aug
26
revised The “Square Root” Solution of Oblivious RAM Simulation
deleted 6 characters in body
Aug
26
asked The “Square Root” Solution of Oblivious RAM Simulation
Aug
26
awarded  Informed
Mar
2
comment In RSA, how to make sure that $p-1$ and $q-1$ are still hard to factorize?
Thank you very much, again :-)
Mar
2
accepted In RSA, how to make sure that $p-1$ and $q-1$ are still hard to factorize?
Mar
2
asked In RSA, how to make sure that $p-1$ and $q-1$ are still hard to factorize?
Feb
26
comment How hard are discrete logarithms problems in $\mathbb Z^{*}_{n}$ and $\mathbb Z^{*}_{n^2}$, where $n$ is the RSA $n=pq$
Thank you again!
Feb
26
comment Strong RSA problem in $\mathbb Z^*_{n^2}$
@fgrieu Thank you for the hint!
Feb
25
revised Strong RSA problem in $\mathbb Z^*_{n^2}$
added 20 characters in body
Feb
24
asked Strong RSA problem in $\mathbb Z^*_{n^2}$
Feb
24
comment How hard are discrete logarithms problems in $\mathbb Z^{*}_{n}$ and $\mathbb Z^{*}_{n^2}$, where $n$ is the RSA $n=pq$
Thank you very much! BTW, if I want to use this conclusion in a paper, how should I acknowledge you, and how to make the reference?
Feb
24
accepted How hard are discrete logarithms problems in $\mathbb Z^{*}_{n}$ and $\mathbb Z^{*}_{n^2}$, where $n$ is the RSA $n=pq$
Feb
24
asked How hard are discrete logarithms problems in $\mathbb Z^{*}_{n}$ and $\mathbb Z^{*}_{n^2}$, where $n$ is the RSA $n=pq$
Feb
23
awarded  Scholar
Feb
23
awarded  Supporter
Feb
23
accepted In the Paillier cryptosystem, is there a method to judge whether an encrypted number is less than 0 (without the private key)
Jan
27
comment In the Paillier cryptosystem, is there a method to judge whether an encrypted number is less than 0 (without the private key)
Thank you for the interesting paper! However, if what I understand is correct, this protocol can be executed for each encrypted number only few times, otherwise it serves as the binary-searching-enabling blockbox mentioned by poncho...
Jan
24
comment In the Paillier cryptosystem, is there a method to judge whether an encrypted number is less than 0 (without the private key)
@Thomas Yes, any order-perserving systems I know lack the semantical security, as well as any deterministic encryption schemes like AES ... Hence I think it is acceptable for some applications ...