How to sign given any trapdoor function

Abstract

We present a digital signature scheme based on trapdoor permutations. This scheme is secure against existential forgery under adaptive chosen message attack. The only previous scheme with the same level of security was based on factoring. Although the main thrust of our work is the question of reduced assumptions, we believe that the scheme itself is of some independent interest. We mention improvements on the basic scheme which lead to a memoryless and more efficient version.