Our construction shows that even highly structured primitives, such as trapdoor permutations, can be potentially based on hardness assumptions with noisy structures such as those used in candidate constructions of indistinguishability obfuscation. It also suggest a possible way to construct trapdoor permutations that resist quantum attacks, and that their hardness may be based on problems outside the complexity class SZK - indeed, while factoring-based candidates do not possess such security, future constructions of indistinguishability obfuscation might.
As a corollary, we eliminate the need to assume trapdoor permutations and injective one-way function in many recent constructions based on indistinguishability obfuscation.
Category / Keywords: Date: received 17 Feb 2015 Contact author: omerpa at gmail com Available format(s): PDF | BibTeX Citation Version: 20150226:120700 (All versions of this report) Short URL: ia.cr/2015/126 Discussion forum: Show discussion | Start new discussion