Reputation
Next privilege 150 Rep.
Create new tags
Badges
7
Newest
 Quorum
Impact
~608 people reached

  • 0 posts edited
  • 2 helpful flags
  • 2 votes cast
Mar
7
comment Homomorphic encryption for vector addition
I felt silly explaining this as my goal, but the motivation is for a 3D space which is most efficiently explored with ⊕. That in some kind of game you'd start in a coordinate with no concept of where you are in the plaintext space, but you can move relatively through it. The hyperlinearity was to enforce energy costs for traveling, so you can't just zoom through it. Also, perhaps as in our own physical universe, there would be no (known) center/origin. Silly thoughts, but yours is a great answer, thanks!
Mar
7
accepted Homomorphic encryption for vector addition
Feb
26
revised Homomorphic encryption for vector addition
Added idea about Indistinguishability Obfuscation
Feb
6
comment Homomorphic encryption for vector addition
Oh, ok. I am ok with anything with a large and identical p,q,r. Three signed 64-bit values is plenty for this.
Feb
5
comment Homomorphic encryption for vector addition
@mikeazo - do you want to add an answer about the SIMD FHE you mentioned on the other question comment?
Feb
5
comment Homomorphic encryption for vector addition
D.W. - Thanks for the added detail. I tried to get some help understanding your response on chat, but didn't get far. What is the significance of p, q, and r? My first guess is that it is related to the bit-size of x, y, and z since Z/pZ is an integer field mod p, right? - so 2^32 if they're 32-bit (although signed is preferred). But I think that's a bad guess since you seem to anticipate that p, q, and r would be different and perhaps prime.
Feb
3
awarded  Quorum
Feb
2
revised Homomorphic encryption for vector addition
some of the comments discussion
Jan
31
revised Homomorphic encryption for vector addition
added 25 characters in body
Jan
31
awarded  Commentator
Jan
31
revised Homomorphic encryption for vector addition
added 2 characters in body
Jan
31
comment Addition-only PHE in F#
ok, ready: Homomorphic encryption for vector addition I did not mention SIMD because I didn't want to steal your thunder.
Jan
31
asked Homomorphic encryption for vector addition
Jan
31
revised Addition-only PHE in F#
deleted 1 characters in body
Jan
31
comment Addition-only PHE in F#
But if I wanted to extend this to multiple dimensions, I'd need Gentry? $(\varepsilon(x), \varepsilon(y), \varepsilon(z))$ is not as ideal as $\varepsilon((x, y, z))$ because I don't want the components to be reusable independently like that. Is there an encoding of $(x, y, z)$ that makes it compatible with the simple $\oplus$?
Jan
31
awarded  Scholar
Jan
31
awarded  Supporter
Jan
31
accepted Addition-only PHE in F#
Jan
31
comment Addition-only PHE in F#
Thanks! The padding thing was due to my impression that HE is an undesirable property normal crypto uses and thus padding is added which interferes with HE, i.e. multiplication in RSA. But whatever, this is good info, thanks.
Jan
30
asked Addition-only PHE in F#