Perfect Structure on the Edge of Chaos
TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562(2016)
摘要
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 $\text{ 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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络