Answers are grounded in this paper and cite their sources.
We present a general signature scheme which uses any pair of trap-door permutations (f0, f1) for which it is infeasible to find any x, y with f0(x) = f1(y). The scheme possesses the novel property of being robust against an adaptive chosen message attack: no adversary who first asks for and then receives sgnatures for messages of his choice (which may depend on previous signatures seen) can later forge the signature of even a singl additional message.
No takes yet. Share an insight, caveat, or question.
Goldwasser et al. (1984) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: