TITLE: Is this obfuscation scheme unbreakable?
QUESTION [8 upvotes]: I've just come across this popular article about a breakthrough (which can be purchased here), 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 ?

REPLY [9 votes]: "Is this obfuscation scheme unbreakable?"
"Well.. no." said people a couple of years later.

On GGHRSW13 specifically: Cryptanalyses of Candidate Branching Program Obfuscators

See also (concurrent, similar flavor):

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
Zeroizing Attacks on Indistinguishability Obfuscation over CLT13


Some interesting candidates for secure obfuscation do remain.
See, for instance:
a) Secure Obfuscation in a Weak Multilinear Map Model 
b) Preventing CLT Zeroizing Attacks on Obfuscation