Promising one-time signature schemes (survey)

In this paper we describe several one-time signatures and show, by the use of the Merkle tree, that we are able to verify several one-time signatures with one public key. One-time signatures have been the subject of increased attention recently because they have fast verification, their security doesn't rely on number theoretic assumptions, and they appear to resist quantum computing attacks.