|
Web
Education
 An ID-based Blind Signature Scheme from Bilinear Pairings
computational problems, on which of our scheme is based .The syntax and security model of ID-based Blind signature Scheme is given in Section3. We then present our ID-based Blind Signature Scheme from bilinear pairings in Section 4. The correctness and security analysis of the proposed scheme is given in Section 5. Section 6 concludes this paper 2....
An ID-based Blind Signature Scheme from Bilinear Pairings ...
Request PDF | An ID-based Blind Signature Scheme from Bilinear Pairings | Blind signatures, introduced by Chaum, allow a user to obtain a signature on a message without revealing any thing about ...
A Secure ID-Based Blind and Proxy Blind Signature Scheme ...
(2017). A Secure ID-Based Blind and Proxy Blind Signature Scheme from Bilinear Pairings. Journal of Applied Security Research: Vol. 12, No. 2, pp. 276-286.
An efficient identity-based blind signature scheme without ...
The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed....
ID-Based Blind Signature and Ring Signature from Pairings ...
Blind signature and ring signature are very useful to provide the user’s anonymity and the signer’s privacy. They are playing an important role in building e-commerce. In this paper, we firstly propose an ID-based blind signature scheme and an ID-based ring signature scheme, both of which are based on the bilinear pairings....
(PDF) ID-Based Blind Signature and Ring Signature from ...
In this paper, we firstly propose an ID-based blind signature scheme and an ID-based ring signature scheme, both of which are based on the bilinear pairings. Also we analyze their security and e# ...
Generalized ID-Based Blind Signatures From Bilinear Pairings
The first ID-based blind signature scheme was proposed by Zhang and Kim [13] in 2002. After that, there has been several proposals for ID-based blind signatures [14], [8], [6]. In this paper, we introduce the concept of generalized ID-based blind signatures. First we convert a blind ElGamal signature scheme into an ID-based counterpart....
New Group Blind Signature Scheme Based on Bilinear Pairings
A New Type of Group Blind Signature Scheme Based on Bilinear Pairings Jun Zhong Dake He （School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China） Abstract: This paper constructs a new group blind signature scheme on the basis of CZK group signature scheme. The security of the new scheme is under the computational Diffie-Hellman...
An efficient certificateless blind signature scheme ...
Weaknesses and improvements of an efficient certificateless signature scheme without using bilinear pairings. DOI: 10.1002/dac.2388. [ Links ] Wang C and Lu R. 2008. A certificateless restrictive partially blind signature scheme. 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 279 p. [ Links ]...
An Efficient Signature Scheme from Bilinear Pairings and ...
In this paper, we propose a new short signature scheme from the bilinear pairings that unlike BLS, uses general cryptographic hash functions such as SHA-1 or MD5, and does not require special hash functions. Furthermore, the scheme requires less pairing operations than BLS scheme and so is more efficient than BLS scheme. We use this signature ......
|
