@inproceedings{d1a16432132347b6a9d5d27e2a20d441,
title = "Perfect structure on the edge of chaos trapdoor permutations from indistinguishability obfuscation",
abstract = "We construct trapdoor permutations based on (subexponential) 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.",
author = "Nir Bitansky and Omer Paneth and Daniel Wichs",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2016.; 13th International Conference on Theory of Cryptography, TCC 2016 ; Conference date: 10-01-2016 Through 13-01-2016",
year = "2016",
doi = "10.1007/978-3-662-49096-9_20",
language = "الإنجليزيّة",
isbn = "9783662490952",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "474--502",
editor = "Eyal Kushilevitz and Tal Malkin",
booktitle = "Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings",
address = "ألمانيا",
}