148 reputation
3
bio website
location
age
visits member for 1 year, 7 months
seen Dec 28 '13 at 11:28

Dec
24
awarded  Scholar
Dec
24
accepted How can uniformity of hash functions (e.g. SHA-256) be proved?
Dec
21
comment How can uniformity of hash functions (e.g. SHA-256) be proved?
+1 for specific links.
Dec
21
revised How can uniformity of hash functions (e.g. SHA-256) be proved?
edited tags
Dec
21
comment Outsourcing arbitrary computations securely
I see: so in $Z_2$ this can be calculated as bitwise OR, but in $R$ this doesn't work. What's the name of this property of $Z_2$ over $R$ in terms of algebraic structures, so I can dig a bit deeper and (re)educate myself.
Dec
21
comment What happens to entropy after hashing?
Hmm ... do you mean any "hashing" (e.g. how about $H(k) = 0$), do you mean entropy of $k$ or $H(k)$, do you mean increase or decrease?
Dec
21
comment Outsourcing arbitrary computations securely
Can you please given an example of a calculation in $Z_2$ where this doesn't work. In rings such as $R$ you can do $3 * 2 = 2 + 2 + 2$ or even $3 + 2 = (1 + 1 + 1) + (1 + 1)$. Isn't $Z_2$ also (such) a ring? I guess I'm missing something simple.
Dec
21
asked How can uniformity of hash functions (e.g. SHA-256) be proved?
Dec
21
comment Outsourcing arbitrary computations securely
+1 Is it correct to assume that an additively homomorphic homomorphic encryption scheme is more limited than FHE only in a practical sense, for you could imagine a secure (if very slow) server that did all of its multiplications as series of additions?
Dec
27
comment Blind quantum computing and fully homomorphic encryption
+1 thx for this.
Dec
27
awarded  Student
Dec
21
awarded  Supporter
Dec
21
comment A situation where security by obscurity might be the best solution - or am I wrong?
I think this is a(nother) problem that could benefit from adding security by obscurity to the solution/mix.
Dec
21
asked Blind quantum computing and fully homomorphic encryption