148 reputation
7
bio website sites.google.com/site/…
location France
age 28
visits member for 4 years, 2 months
seen Aug 10 at 12:13
I am a PhD Student at IRISA, University Rennes 1, France. My PhD topic is on privacy preservation in user-centric distributed search environments. The field includes cryptography, data mining, and large scale peer to peer systems. I am also a staff member at the Computer Science department, Helwan University, Egypt. I currently hold a masters degree in Computer Science from University Rennes I, France

Sep
9
comment Expectation of square root of binomial r.v.
Thank you for your clarification :)!
Sep
6
comment Expectation of square root of binomial r.v.
Can someone help be notice why $1 + \frac{x-1}{2} - \frac{(x-1)^2}{2} \le \sqrt{x} $?
Nov
15
awarded  Peer Pressure
Oct
12
accepted Is there a two-party multiplicative and additive secret sharing scheme ?
Aug
30
awarded  Commentator
Aug
3
comment Is there a two-party multiplicative and additive secret sharing scheme ?
Do you have a reference for the impossibility of OT in both classical and quantum case ?
Jul
25
comment Looking for a probability distribution
Can you elaborate more on what you mean by "distinct hash values" ? Do you refer to the number modulo 2 or to the overall value of the binary-represented integer by the array ?
Jul
24
comment Reducing two variable linear Diophantine equation to modular inversion
I can use Paillier or its generalized variant[1].For the inversion protocol I am using the idea in of [2, Section 3] after porting it to Paillier as it was based on secret sharing (because I can't do secret sharing multiplication in two-party setting (see bit.ly/9tuXPf)). In general, it's a protocol where the modulus (a mod b in our case) is public. [1] I. Damgård and M. Jurik, "A Generalisation, a Simplification and ....," Public Key Cryptography, 2001, pp. 119-136. [2] J. Bar-Ilan and D. Beaver, "Non-Cryptographic Fault-Tolerant Computing ....," PODC'89, Edmonton
Jul
24
comment Reducing two variable linear Diophantine equation to modular inversion
@Yuan: Thanks for the hint. I do apologize for the readers who were mislead by this mistake; I am new to online community discussion and the line between not too long and too less information was still a bit fuzzy to me. I just was trying to be nice and write as short as I can so as not to waste the time of the reader.
Jul
24
revised Reducing two variable linear Diophantine equation to modular inversion
It was too poorly written as indicated in the comments !; added 4 characters in body
Jul
24
comment Reducing two variable linear Diophantine equation to modular inversion
@Alekseyev: Thanks for your useful comment. So since it is not possible I'll try another research direction.
Jul
24
comment Reducing two variable linear Diophantine equation to modular inversion
@Speiser: No it is not elementary. I do not want to use extended GCD. In fact, I am in the field of secure multiparty comptuation and I want to implement the GCD algorithm itself in a secure form, given only a secure protocol for modular inversion (Using homomorphic encryption or secret-sharing). It would have been trivial to use extended GCD to solve these equations, but I don't have a secure sub-protocol for that.
Jul
23
revised Reducing two variable linear Diophantine equation to modular inversion
Edited the title for clarity
Jul
23
asked Reducing two variable linear Diophantine equation to modular inversion
Jul
23
comment Are there consecutive integers of the form $a^2b^3$ where $a$, $b$ > 1?
That is 15061377048201 and 15061377048200. Nice job.
Jul
22
awarded  Supporter
Jul
21
awarded  Student
Jul
21
comment Is there a two-party multiplicative and additive secret sharing scheme ?
Thanks for you answer. I am sorry that I forgot to note that I am aware of those schemes. Homomorphic encryption depend on hardness assumptions, while secret sharing is unconditionally secure (and thus provides much better cipher-text size and less computations (since there is no big integer exponentiations).
Jul
21
revised Is there a two-party multiplicative and additive secret sharing scheme ?
Noted that to exclude homomorphic encryption.
Jul
21
asked Is there a two-party multiplicative and additive secret sharing scheme ?