International Association
for Cryptologic Research

Abstract  We take a closer look at several enhancements of the notion of trapdoor permutations. Specifically, we consider the notions of enhanced trapdoor permutation (Goldreich, Foundation of Cryptography: Basic Applications, 2004) and doubly enhanced trapdoor permutation (Goldreich, Computational Complexity: A Conceptual Perspective, 2011) as well as intermediate notions (Rothblum, A Taxonomy of Enhanced Trapdoor Permutations, 2010). These enhancements arose in the study of Oblivious Transfer and NIZK, but they address natural concerns that may arise also in other applications of trapdoor permutations. We clarify why these enhancements are needed in such applications, and show that they actually suffice for these needs.

• Content Type Journal Article
• Pages 1-29
• DOI 10.1007/s00145-012-9131-8
• Authors

  • Oded Goldreich, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel
  • Ron D. Rothblum, Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel

• Journal Journal of Cryptology
• Online ISSN 1432-1378
• Print ISSN 0933-2790

From: Wed, 12 Sep 2012 16:02:54 GMT