Reputation
Next privilege 125 Rep.
Vote down
Badges
7
Newest
 Commentator
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 11 votes cast
12h
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
@RickyDemer Using the notation in the question, can I use $r \leftarrow (0, 2^{\rho'+1})$ instead of $r \leftarrow (-2^{\rho'}, 2^{\rho'})$?
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
Well, can I shift the symmetric form to the normal form for programming easily?
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
In that post tylo pointed out elements in lattices are not integers, but vectors. But here $r$ is 'verily' an integer...
Aug
28
comment In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
In my opinion (and as the authors of the paper mentioned), here we do not need the knowledge of lattice (except the case to attack the scheme). The scheme itself is written in simple mathematics (though the proof is advanced). So just think about (elementary ) number theory, what's the mistake? Do you mean $(-2^{\rho'}, 2^{\rho'})$ is in fact $(0, 2^{\rho'+1})$?
Aug
28
revised In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
edited title
Aug
28
asked In DGHV FHE, why noise $r$ can be in $(-2^{\rho'}, 0)$?
Aug
24
accepted Why an upside down path on the evaluation of branching program on encrypted data?
Aug
24
comment Why an upside down path on the evaluation of branching program on encrypted data?
By manually writing down each step of the bottom-up process, I think I finally understand it. In my opinion, for the terminal nodes, their labels are exactly all the possible outputs. And then, for the nodes whose height $j > 0$, their labels are the filtered possible outputs by the information of inputs at height $j$. So the label of the initial node is the only one left possible output filtered by all the inputs. Am I right?
Aug
24
comment Why an upside down path on the evaluation of branching program on encrypted data?
Sorry, I am still confusing... The Fibonacci series can be calculated from up to bottom or from bottom to up for the commutativity and associativity, but I think the calculation graph of $P$ does not always hold these properties. So why we can obtain $P(x)$ from a path from the terminal nodes to the initial node? Should I have known some other things? Is there any reference for the non-cryptographic version of the bottom-up evaluation of BP?
Aug
24
comment Why an upside down path on the evaluation of branching program on encrypted data?
Sorry, I cannot catch the point. I know that the first example seems like the up-bottom process, and the second example shows the recursion, which requires RAM to store the function caller records on stack. These examples are two different programs, using different structures. In the paper, however, it seems that $P$ of the orginial version and the encrypted version share the same structure. So would you please expand it a bit more? Thank you very much.
Aug
24
revised Why an upside down path on the evaluation of branching program on encrypted data?
spelling
Aug
24
asked Why an upside down path on the evaluation of branching program on encrypted data?
Aug
24
accepted Are there any encryption schemes that enable to permute homomorphically?
Aug
24
comment Are there any encryption schemes that enable to permute homomorphically?
By a quick check, I think that this paper in fact described an interactive protocol based on OT. Do you have any hints about a non-interactive cryptographic scheme? Anyway, thank you.
Aug
24
revised Are there any encryption schemes that enable to permute homomorphically?
grammar fix
Aug
24
revised Are there any encryption schemes that enable to permute homomorphically?
grammar problem
Aug
24
asked Are there any encryption schemes that enable to permute homomorphically?
Jun
12
accepted Definition of indistinguishable schemes
Jun
12
revised Definition of indistinguishable schemes
edited title
Jun
12
comment Definition of indistinguishable schemes
@cygnusv: Maybe you are right. I've updated the title.