At Crypto 96 Cramer and Damg̊ard proposed an efficient, tree-based, signature scheme that is provably secure against adaptive chosen message attacks under the assumption that inverting RSA is computationally infeasible. In this paper we show how to modify their basic construction in order to achieve a scheme that is provably secure under the assumption that factoring large composites of a certai...

We adapt the Cramer, Franklin, Schoenmaker and Yung internet voting protocol[12] to the booth setting. In this protocol, expressions of the form g 0g x1