|
Web
Education
A Pairing-based Blind Signature Scheme with Message Recovery
utilizing bilinear pairings. This paper proposes an id-based blind signature scheme with message recovery. The proposed scheme is motivated by the work of [3], [27]. From the perspective of both blind signatures and id-based cryptosystems from the Gap-Diffie-Hellman groups, the new scheme is comparable with [4]....
Pairing Free Identity-Based Blind Signature Scheme with ...
In 2003, Zhang et al. and in 2005, Huang et al. proposed different efficient ID-based blind signature schemes. In 2006, Zhao et al. proposed a new identity based blind signature scheme from bilinear pairings. In 2008, Kalkan et al. presented a generalized ID...
A Lattice-Based Identity-Based Proxy Blind Signature ...
A proxy blind signature scheme is a special form of blind signature which allowed a designated person called proxy signer to sign on behalf of original signers without knowing the content of the message. It combines the advantages of proxy signature and blind signature. Up to date, most proxy blind signature schemes rely on hard number theory problems, discrete logarithm, and bilinear pairings....
 On the Security of an Efficient ID-based Partially Blind ...
ID-based partially blind signature scheme based on bilinear pairings. Their scheme is more efficient and requires less computational cost than Chow et al.'s scheme [23]. They claimed that their scheme is provably secure under the random oracle model. In this paper, we will show that their scheme suffers from forgery attack s. In the forgery ......
ID-Based Multi-Proxy Signature and Blind Multisignature ...
proxy signature from bilinear pairings [19]. In this paper, we propose an ID-based multi-proxy signature scheme (IDMPS) and an ID-based blind multisignature scheme (IDBMS) from bilinear pairings. Both the schemes can be regarded as a special case of corresponding variants of ID-based threshold signature scheme....
Improvement of Chen-Zhang-Liu’s IRPB Signature Scheme
Restrictive partially blind signatures incorporate the advantages of restrictive blind signatures and partially blind signatures, which play an important role in electronic commerce. Recently, Chen-Zhang-Liu first proposed an ID-based restrictive partially blind (IRPB) signature from bilinear pairings. Later, Hu-Huang showed that the Chen-Zhang-Liu’s scheme has a security weakness, and ......
A New ID-based Group Signature Scheme from Bilinear Pairings
We argue that traditional ID-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we propose new ID-based public key systems without trusted PKG (Private Key Generator) from bilinear pairings. In our new ID-based systems, if the dishonest PKG impersonates an honest user to communicate with others, the user can provide ......
Blind signature and its applications - CryptoWiki
Blind signature scheme based on bilinear pairing. Table 3 - Blind signature scheme based on bilinear pairing. The designations: Blind signature on braid groups . In order to describe a digital signature scheme using the braid group, we will enter the following definitions and theorems....
A New ID-based Group Signature Scheme from Bilinear Pairings
Plenty of ID-based cryptographic schemes from bilinear pairings have been proposed in last two years [4,6,16,25, 29]. However, It is still an open problem to design an ID-based group signature scheme from bilinear pairings. The reasons are as follows: Firstly, the problem of key escrow is a fatal disadvantage for ID-based systems, i:e:, the ......
New and Efficient ID -based Signature Scheme with Message ...
analyze a new signature scheme with message recovery in the Identity based setting using bilinear pairings over elliptic curves. We discuss the proof of correctness and the security of the proposed sche me. Finally, we compare our scheme with the related schemes in terms of computational and communicational point of view. Keywords : digital ......
|
