For those wondering why you haven&#x27;t yet seen practical applications of this research, this answer[1] on Stack Exchange does a decent job of explaining:<p>&gt; What must be understood is that in all these constructions, each circuit gate must map to an instance of Gentry&#x27;s fully homomorphic encryption scheme, and at every clock cycle for the obfuscated circuit, all gates must be processed, regardless of whether they are &quot;active&quot; or not in the circuit (this is a big part of why the obfuscation theoretically works: it does not reveal active gates, by always making them all active). This[2] article gives performance result: on a rather big PC, we are up for minutes of computation. That&#x27;s for each gate in the obfuscated circuit, and for each clock cycle.<p>&gt; There are millions or even probably billions of gates in the envisioned circuit, given the setup of functional encryption: the &quot;obfuscated circuit&quot; must include asymmetric decryption and validation of zero-knowledge proofs. So now we are talking about using all the computers currently running on Earth, all collaborating on the computation, and they might make non-negligible progress towards running one instance of functional encryption within a few centuries.<p>[1] <a href="http:&#x2F;&#x2F;security.stackexchange.com&#x2F;a&#x2F;50972" rel="nofollow">http:&#x2F;&#x2F;security.stackexchange.com&#x2F;a&#x2F;50972</a><p>[2] <a href="http:&#x2F;&#x2F;eprint.iacr.org&#x2F;2010&#x2F;520.pdf" rel="nofollow">http:&#x2F;&#x2F;eprint.iacr.org&#x2F;2010&#x2F;520.pdf</a>