network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 10 months |
| seen | Oct 20 '12 at 21:52 | |
| stats | profile views | 1 |
|
Aug 22 |
comment |
Why can't Homomorphic encryption schemes support algorithms with conditions/branching? I hope the last question above is clear - I am trying to understand how sophisticated the processing algorithm in an HE system can be, which I have seen referred to as the evaluate() function in papers (apologies if I am misusing terms here). If this would be better as a separate question, let me know and I can delete these comments and re-post as a separate question. |
|
Aug 22 |
comment |
Why can't Homomorphic encryption schemes support algorithms with conditions/branching? Thanks for your answer. I think I need to understand the process for translating (compiling?) an algorithm to a circuit - any links to introductory texts/resources would be appreciated. I noticed on the hcrypt page that it states 'Garbled Circuits only support one-pass linear circuits' - whilst GC and secure function evaluation are an alternative to HE, this limitation in complexity sounds similar to what I believed about HE. I suppose the definition of an 'efficient' algorithm is important here. Is it is possible to express an upper bound on complexity for HE in simple terms? |
|
Aug 22 |
awarded | Scholar |
|
Aug 22 |
accepted | Why can't Homomorphic encryption schemes support algorithms with conditions/branching? |
|
Aug 21 |
asked | Why can't Homomorphic encryption schemes support algorithms with conditions/branching? |
