IBM open sources new approach to crypto
theregister.co.uk
theregister.co.uk
I'm pretty sure that this has nothing to do with permissions. Homomorphic encryption maintains certain properties of the plaintext (through some isomorphism) to allow pre-defined operations (operations that the isomorphism are designed for).
Also, why theregister? Why not link to the actual article (http://eprint.iacr.org/2011/277) or the github project (https://github.com/shaih/HElib) They're much, much more informative.
Besides, the article includes links to more technical materials, including the project page should the reader want to find out more.
> I'm pretty sure that this has nothing to do with permissions. Homomorphic encryption maintains certain properties of the plaintext (through some isomorphism) to allow pre-defined operations (operations that the isomorphism are designed for).
I've read 'permitted' as 'operations that can be performed on the ciphertext when using this encryption scheme'. While it might be ambiguous, I don't think they're incorrect in saying that.
So many technical articles just get the facts wrong and pass them off as correct. I appreciate the honesty in this case.
All the available documentation seems to focus on the underlying implementation and mathematical proofs without clearly stating the user-visible performance behavior.
For example, if I have N encrypted signed B-bit integers (treated as modulo 2^B), and add them all with homomorphic encryption, how much time does that take and how large is the resulting cyphertext?
What if I have two N-dimensional vectors called v and w of B-bit integers (treated as modulo 2^B), and want to compute the value v^T . M . w where M is an NxN matrix?
What if they are floating point instead? Is that supported? Are integers modulo M supported for any M?
Is the sign(x) operation available or just addition and multiplication?
So any fast algorithm that can be computed without encryption can be computed efficiently by a homomorphic encryption scheme (in time that is some low degree polynomial of the time needed for the unencrypted algorithm).
EDIT: Just saw GPL2 or later, so choosing GPL3 would mean patent license included, right?
They obviously can't grant a patent license for patents they don't hold, but that's life.
http://en.wikipedia.org/wiki/Export_of_cryptography_in_the_U...