, Volume 26, Issue 3, pp 484512
First online:
Enhancements of Trapdoor Permutations
 Oded GoldreichAffiliated withDepartment of Computer Science, Weizmann Institute of Science
 , Ron D. RothblumAffiliated withDepartment of Computer Science, Weizmann Institute of Science Email author
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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.
Key words
Trapdoor permutations Oblivious transfer Noninteractive zeroknowledge Title
 Enhancements of Trapdoor Permutations
 Journal

Journal of Cryptology
Volume 26, Issue 3 , pp 484512
 Cover Date
 201307
 DOI
 10.1007/s0014501291318
 Print ISSN
 09332790
 Online ISSN
 14321378
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Trapdoor permutations
 Oblivious transfer
 Noninteractive zeroknowledge
 Industry Sectors
 Authors

 Oded Goldreich ^{(1)}
 Ron D. Rothblum ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel