I've just come across [this popular article][1] about [a breakthrough][2] (which can be purchased [here][3]), published in *Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium* by a team of cryptographers (Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai and Brent Waters) showing that the workings of a computer programme can be *obfuscated*.  The author writes :

> This obfuscation scheme is unbreakable, the team showed, provided that
> a certain newfangled problem about lattices is as hard to solve as the
> team thinks it is.

Would someone care to share with us the problem about lattices that is alluded to here ?


  [1]: https://www.simonsfoundation.org/quanta/20140130-perfecting-the-art-of-sensible-nonsense/
  [2]: http://eprint.iacr.org/2013/451.pdf
  [3]: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6686139&url=http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6686139