A blind signature scheme allows a user to obtain a signature on a given message without revealing any information about the message to the signer. The idea of blind signature was first introduced by Chaum at CRYPTO 1982. Blind signatures can be used in many applications, such as e-voting. Recently, Chakraborty and Mehta proposed a new blind signature scheme (Chakraborty-Mehta scheme) based on t...

A low-computation partially blind signature scheme was proposed in 1998. Compared to the existing blind signature protocols, the scheme largely reduces the computation costs for each user by about 99%. However, a weakness on partial blindness is found in the scheme. This paper presents a new partially blind signature protocol with extremely low computation for each user. Not only is the propose...

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.

A secure scheme of restrictive partially blind signature is presented. Our proposed scheme has the following advantages. First, the scheme is secure against the one-more signature forgery under the adaptively parallel attack. Second, the issued signatures can be of polynomial number as comparing with the logarithmic number of previous work. At last, the scheme is with less communicational and c...

Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges between the signer and the user or are limited to issue only logarithmically many signatures in terms of a security parameter. This paper presents an efficient blind signature scheme that allows a polynomial number of signatures to...

As a special anonymous signature, the blindness of blind signatures makes it to play an important role in electronic commerce. Sometimes, we need a blind signature under the multiple signers. However, to the best of our knowledge, the research on the blind signer for multiple signers is much less. In this paper, we propose a novel blind signature scheme for multiple signers based on a new secur...

Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-dated survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how ...

This paper introduces a new concept of convertible user designating confirmer partially blind signature, in which only the designated confirmer (designated by the user) and the user can verify and confirm the validity of given signatures and convert given signatures into publicly verifiable ones. We give a formal definition for it and propose a concrete provably secure scheme with a proof of se...

The only known blind signature scheme that is secure in the standard model [20] is based on general results about multi-party computation, and thus it is extremely inefficient. The main result of this paper is the first provably secure blind signature scheme which is also efficient. We develop our construction as follows. In the first step, which is a significant result on its own, we devise an...

Delegation of rights is a common practice in the real world. Proxy signature schemes have been invented to delegate signing capability eeciently and transparently. In this paper, we present a new nonrepudiable proxy signature scheme. Nonrepudiation means the signature signers, both original and proxy signers, cannot falsely deny later that he generated a signature. In practice, it is important ...