Code obfuscation: a difficult problem apparently cracked
By Richard Chirgwin, 5 Jun 2014A very interesting area that does not get very much exposure but certainly has a lot of mileage in it in terms of what it can do to assist in protect systems.
http://regmedia.co.uk/2014/05/29/random_string.png?x=419&y=278&crop=1
"Better code obfuscation has attracted the attention of the prestigious Association of Computing Machinery, which has anointed an Indian-born developer working at IBM's TJ Watson Research Centre with an award for his work.
Protecting code, even as a binary, from being reverse-engineered is difficult: any solution that encrypts the code has to keep its functionality in place, and decrypting the code for execution has to be fast.
Sanjam Garg, an alumni of the Institute of Technology of Delhi, claims to have cracked that problem in this paper, Candidate Multilinear Maps from Ideal Lattices.
As that paper explains, bilinear maps are so well-known that their applications are “too numerous” to list – but (for example) tripartate Diffie-Hellman and identity-based encryption are two handy examples. Expanding that concept to multi-lineal maps has been theorised, Garg writes in his paper, but not previously achieved."
Full Article