Reputation
1,933
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
3 13 26
Impact
~106k people reached

Dec
22
revised Are those two distributions indistinguishable?
deleted 1 character in body
Dec
22
comment ElGamal in a different group
Yehuda the link you provided does not work. Can you tell me the title? Thanks
Dec
21
asked ElGamal in a different group
Dec
21
comment What libraries do people use to implement and evaluate cryptography protocols?
The paper you mentioned has implementation results here homepage.rub.de/andy.rupp/papers/p4r_full.pdf
Dec
21
comment What libraries do people use to implement and evaluate cryptography protocols?
You can check PBC library for pairings and the for math operations the GMP library. Then Charm crypto abstracts a lot of useful basic crypto operations
Dec
21
revised Is that simple additive homomorphic scheme secure?
added 1 character in body
Dec
21
comment Is that simple additive homomorphic scheme secure?
that is very weak. The attacker always can ask for encryptions. In its weakest form a security game for confidentiality provides ciphers to the attacker at its will
Dec
21
answered Is that simple additive homomorphic scheme secure?
Dec
21
answered Why is Paillier Cryptosystem called probabilistic?
Dec
20
accepted Homomorphic OR operations
Dec
19
comment Homomorphic OR operations
Can you elaborate? i have 0,1 and the or equals 1 and not 0 as it would be if i multiplied
Dec
19
comment Homomorphic OR operations
I don't get it very clearly. It the truth table of or 3/4 entries are 1 and 1 is zero. If you multiply the elements then 3/4 entries become zero and 1/4 is one. From the cases it becomes 0 when multiplying only one is correct (0*0) and the others (0*1),(1*0) they do give the wrong result, because the OR gives 1.
Dec
19
comment Homomorphic OR operations
So i just need an additive homomorphic scheme?Then pailier will work?No because the ciphertext space has many elements. So how E(1)+E(1) will result in E(1) at the ciphertext space?By quadratic residuosity you mean the GM scheme?I thought that was only XOR homoorphic
Dec
19
comment Homomorphic OR operations
I can't get your formula. why you do not just write x+y-xy. And if this circuit is translated to an OR than you do not need just an additively homomorphic scheme but a multiplicative at the same time...
Dec
19
asked Homomorphic OR operations
Dec
3
comment Sorting over encrypted data with different symmetric keys
it seems that you need to put a bit of trust to some third party in order the latter to transform ciphertexts coming from different users to ciphers seem to be encrypted by a single user. Look at proxy re-encryption techniques
Nov
29
accepted What is the notion of an interactive assumption?
Nov
28
comment Bilinear map assumpion
Ok, i said DL is the strongest in the sense that breaking DL you break CDH and then DDH
Nov
26
comment Bilinear map assumpion
You were right about the other type of forgery by exponentiation. What about now? Assiming k is secret
Nov
26
revised Bilinear map assumpion
added 35 characters in body