Reputation
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 15 34
Newest
 Nice Answer
Impact
~156k people reached

Jun
29
answered Using bad generator in ElGamal Encryption
Jun
18
answered Are there any differences between PIR, oblivious transfer and differential privacy?
May
7
comment RSA reencryption scheme
Section 4.3 of this paper has an example for RSA but it is unidirectional: www.isoc.org/isoc/conferences/ndss/03/proceedings/papers/14.pdf
May
7
comment RSA reencryption scheme
This is called proxy re-encryption and there are a lot of ways of doing it: en.wikipedia.org/wiki/Proxy_re-encryption
Apr
30
awarded  Enlightened
Apr
30
awarded  Nice Answer
Apr
13
answered What are advantages of using a HMAC over RSA with SHA-1 hashes?
Apr
13
answered Blind signature with openssl
Apr
7
awarded  Critic
Mar
30
comment What challenge should I use in a challenge-response proof-of-work?
Good point about multiple connections. You are right, in DoS prevention, I guess parallalization doesn't matter much. Yeah, scrypt is a nice way to meter based on processing power and memory accesses.
Mar
30
answered What challenge should I use in a challenge-response proof-of-work?
Mar
27
comment ZKIP for Paillier public key correctness
Yes, the proof is very complicated. I would consider using the exponential version of Elgamal ($\mathsf{Enc}(g^m)$ instead of $\mathsf{Enc}(m)$, see tinyurl.com/CGS1997) instead of Paillier if possible.
Mar
26
answered ZKIP for Paillier public key correctness
Mar
26
revised Division in paillier cryptosystem
edited tags
Mar
20
answered Order Preserving Encryption for Numeric Data Values
Mar
13
comment Division in paillier cryptosystem
@user996522 It depends on how you define "makes sense." If $a/b = c$, then $c \cdot b=a$. It is the same thing here. If you compute $a/b$ under encryption, you will get the encryption of the value $c$ such that $c \cdot b \bmod{n} = a$. You can think of it as "discrete division" akin to a discrete logarithm.
Mar
13
revised Division in paillier cryptosystem
added 78 characters in body
Mar
13
revised Division in paillier cryptosystem
added 797 characters in body
Mar
13
answered Division in paillier cryptosystem
Mar
9
comment Why do we use encrypt-decrypt-encrypt (EDE) in 3DES, rather than encrypting three times?
Duplicate on Security SE: security.stackexchange.com/questions/1886/…