Recently, there are several generic transformation techniques proposed for converting unforgeable signature schemes (the message in the forgery has not been signed yet) into strongly unforgeable ones (the message in the forgery could have been signed previously). Most of the techniques are based on trapdoor hash functions and all of them require adding supplementary components onto the original...

Sensor networks are characterized by lack of trusted infrastructure and severe hardware limitations in terms of computational power and memory size. Securing the exchanges between a set of distributed sensors is challenging. On one hand, ad hoc infrastructures imply a lack of a priori trust between entities that can dynamically appear and disappear. In this context, it is necessary to ensure no...

Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously de ned and satis ed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.

Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously deened and satissed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.

One-time signatures (OTS) offer a viable alternative to public keybased digital signatures. OTS security is based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of a mathematical problem. OTS methods have been proposed in the past but no solid foundation exists for judging their efficiency or optimality. This paper develops a new method...

Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed) require supplementary components to be added onto the original key pairs of the schemes. In addition, some of them can only be applied to a certain type of signature schemes. In this paper, we propose a new generic ...

Zeng and Keitel proposed an arbitrated quantum signature scheme In 2002. Recently, Curty and Lütkenhaus pointed out that the protocol is not operationally specified. In a reply, Zeng gave more details of the scheme. The author also claimed that the scheme is suitable for unknown messages. In this letter, we remark that the invented scenario in the original scheme is artificial. This is because ...