International Association
for Cryptologic Research

We show that differing-inputs obfuscation (diO) for Turing Machines is impossible to achieve. Our results are: (1) If sub-exponentially secure one-way functions exist then sub-exponentially secure diO for TMs does not exist (2) If in addition sub-exponentially secure iO exists then polynomially secure diO for TMs does not exist.