Cryptology ePrint Archive: Report 2015/126

Perfect Structure on the Edge of Chaos

Nir Bitansky and Omer Paneth and Daniel Wichs

Abstract: We construct trapdoor permutations based on (sub-exponential) indistinguishability obfuscation and one-way functions, thereby providing the first candidate that is not based on the hardness of factoring.

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, last revised 20 Jun 2017

Contact author: omerpa at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170620:201719 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]