\u201cIndistinguishability obfuscation\u201d is a powerful concept that would yield provably secure versions of every cryptographic system we\u2019ve ever developed and all those we\u2019ve been unable to develop. But nobody knows how to put it into practice.<\/p>\n
Last week, at the IEEE Symposium on Foundations of Computer Science, MIT researchers showed that the problem of indistinguishability obfuscation is, in fact, a variation on a different cryptographic problem, called efficient functional encryption. And while computer scientists don\u2019t know how to do efficient functional encryption, either, they believe that they\u2019re close \u2014 much closer than they thought they were to indistinguishability obfuscation.<\/p>\n
\u201cThis thing has really been studied for a longer time than obfuscation, and we\u2019ve had a very nice progression of results achieving better and better functional-encryption schemes,\u201d says Nir Bitansky, a postdoc in MIT\u2019s Computer Science and Artificial Intelligence Laboratory who wrote the conference paper together with Vinod Vaikuntanathan, an associate professor of electrical engineering and computer science. \u201cPeople thought this is a small gap. Obfuscation \u2014 that\u2019s another dimension. It\u2019s much more powerful. There\u2019s a huge gap there. What we did was really narrow this gap. Now if you want to do obfuscation and get all of crypto, everything that you can imagine, from standard assumptions, all that you have to do is solve this very specific problem, making functional encryption just a little bit more efficient.\u201d<\/p>\n