HElib

I'm not math fluent enough to know what lattices really are, but it seems, from the wikipedia article, that a (geometric/group theory) lattice is a subgroup of the additive group of real numbers [1] that is isomorphic with the additive group of the "free abelian group" [2]. [1] which is to say, real numbers that one can obtain by adding or subtracting other real numbers. [2] which is a set that satisfies addition, commution, and inversion to derive any element from some subgroup of the set. Integers are an example, as one can produce any integer as a combination of the number 1. The way lattice math has intruded into my outgroup awareness is from C Gentry's formulation of a fully homomorphic encryption scheme using lattices. So, if you are interested in a survey of papers delving into the applications of lattices for cryptography, consid

Sounds very interesting!, I'm going to have to look at in more detail. I'm just wondering how it compares to something like https://github.com/shaih/HElib

homomorphic encryption exists. It's just slow, though it depends on what you consider slow: https://github.com/shaih/HElib

There's HELib for those that want to get a head start: https://github.com/shaih/HElib

> The encrypted file – if The Register understands the paper correctly – embeds actions that are permitted on that file (for example, the ability to read and write to parts or all of the file. The Evaluate function is able to use the combination of the public key and permitted actions (described as circuits) to operate on the file without decrypting it. 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.