An Efficient ID-Based Partially Blind Signature Scheme

Tong, Xiaoyang; Wang, Xiaoru

doi:10.1109/snpd.2007.127

Cited by 12 publications

(9 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, many ID-based partially blind signature schemes have been proposed in the literature together with their applications in e-cash systems [XXIV] [XXVIII]. In 2007, Hu et al [X] introduced an efficient and secure ID-based partially blind signature scheme, but the scheme was subject to critical forgery attack identified by Tseng et al [XXIII] in 2008 scheme was enhanced by Tian et al…”

Section: Related Workmentioning

confidence: 99%

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

J¹

2019

JMCMS

View full text Add to dashboard Cite

Blind signature plays a significant role in practical applications such as ecash and e-voting systems, where anonymity is of great importance. A partially blind signature enables a signer to explicitly incorporate a pre-agreed common information into a blind signature without the loss of blindness property. In recent years, many cryptographic researchers have made substantial progress in the design of blind signature schemes. In order to improve the efficiency, in this paper, we propose a new pairing free partially blind signature scheme with message recovery in the identity-based frame work. The proposed scheme is existentially unforgeable with the assumption that the Elliptic Curve Discrete Logarithm Problem (ECDLP) is hard. We compare our scheme to the well known existing identity-based partially blind signature schemes. With pairing free realization and the message recovery features, the proposed scheme is more efficient in terms of computation and communication point of view. Finally, we present an electronic-cash payment system based on our PF-IDPBS-MR scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

J¹

2019

JMCMS

View full text Add to dashboard Cite

show abstract

“…In 2003, Zhang and Kim [24] proposed another efficient and formally secure ID-BS scheme using bilinear pairing. With the bilinear pairings, Chow et al [25] put forwarded an identity-based partial blind signature (ID-PBS) scheme. However, the scheme is not formally proven to be secured in any computationally model.…”

Section: Related Workmentioning

confidence: 99%

“…With the intractability of DLP and Chinese Remainder Theorem, Huang and Chang [28] constructed a new partial blind signature scheme; however, Zhang and Chen [29] show that the scheme in [28] violates the partial blindness property. In 2008, Hu and Huang [25] constructed an ID-PBS scheme with bilinear pairings and argued that is it provably secure. In cryptography, the computation cost of the pairing is known to be expensive compared with execution time of other cryptographic operations.…”

Section: Related Workmentioning

confidence: 99%

Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing

Islam

Obaidat

2015

Security Comm Networks

View full text Add to dashboard Cite

In the literature, several pairing-based blind signature schemes have been put forwarded using identity-based cryptography. However, the private key escrow problem of these schemes makes them unsuitable in practical environments because the private key generator computes signer private key using signer public identity. Therefore, an untrusted/semitrusted private key generator may perform malicious activity on behalf of the signer. We took the advantage of certificateless public key cryptography and constructed a robust and efficient certificateless blind signature (CL-BS) scheme using bilinear pairing. Furthermore, the probabilistic map-to-point hash function, which requires more computation time than the execution time of an elliptic curve scalar point multiplication, is circumvented in our scheme. We found that our scheme is unlinkable and provably secure against the adaptive chosen message and identity adversaries. From the perspective of computational costs, our scheme is more efficient and secure than other related schemes. Motivation and contributionIn the literature, several blind signature schemes are designed based on IBC. However, very less number of pairing-based certificateless blind signature (CL-BS) schemes [6][7][8] have been noticed. We observed that the schemes devised in [6][7][8][9][10][11][12][13] are based on the probabilistic map-to-point hash function [4], which needs more computation time than the time needed to execute an elliptic curve scalar point multiplication operation. In addition,

show abstract

“…Therefore, to reduce the computational overheads in ID-based partially blind signature scheme. In 2007, Hu et al [36] proposed partially blind signature scheme from bilinear pairings. They compared their scheme with Chow et al's scheme [35] and claimed that their scheme is less computational and efficient than Ref.…”

Section: Id-based Blind Signaturementioning

confidence: 99%

ID-based signature schemes from bilinear pairing: A survey

Sahu

Padhye

2011

Front. Electr. Electron. Eng. China

View full text Add to dashboard Cite

In identity (ID)-based cryptosystems, a user can use his/her identity as the public key, which simplifies the key management procedure compared to certificatebased cryptosystems. Authentication is a desired property in cryptographic protocols. The signature scheme provides this property. Notion of pairing reduces the computation overheads and makes the system simple and efficient. In this survey, we have tried to cover some ID-based signature schemes based on bilinear pairings with their protocol and security analysis to the best of our knowledge. We hope this survey will provide a ready reference to work in the related area.

show abstract

An Efficient ID-Based Partially Blind Signature Scheme

Cited by 12 publications

References 33 publications

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

PairiPairing-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment Systemng-free Partially Blind Message Recovery Signature Scheme with Application To Online e-Cash Payment System

Design of provably secure and efficient certificateless blind signature scheme using bilinear pairing

ID-based signature schemes from bilinear pairing: A survey

Contact Info

Product

Resources

About