2005
DOI: 10.1007/11506157_27
|View full text |Cite
|
Sign up to set email alerts
|

Two Improved Partially Blind Signature Schemes from Bilinear Pairings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
57
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 80 publications
(57 citation statements)
references
References 19 publications
0
57
0
Order By: Relevance
“…The restrictiveness property is essentially the guarantee for traceability in the restrictive blind signature systems. Partial blind signature schemes [28], [29] allow the resulting signature to convey publicly visible information on common agreements between the signer and the signee. This is useful when certain information in the signature needs to be reviewed by a third party.…”
Section: Blind Signaturementioning
confidence: 99%
“…The restrictiveness property is essentially the guarantee for traceability in the restrictive blind signature systems. Partial blind signature schemes [28], [29] allow the resulting signature to convey publicly visible information on common agreements between the signer and the signee. This is useful when certain information in the signature needs to be reviewed by a third party.…”
Section: Blind Signaturementioning
confidence: 99%
“…In this section, our proposed Identity-based partially based blind signature is compared in terms of computation cost, with existing scheme [5,6,7] shown in Table 1. Here, according to [6], we represent G 1 A as the point addition on elliptic curve G 1 , G 1 M as the point multiplication on elliptic curve G 1 , Pa denote as the pairing operation on elliptic curve, MTP represent as the map-to-point hashing operation, Z q M denotes the multiplication operation on Z q and Z q d denotes the division operation on Z q .…”
Section: B Computational Analysismentioning
confidence: 99%
“…In 2005, Chow et al [5] presented a secure ID-based PBS scheme based on solving the hardness of computational DiffieHellman problem. However, this scheme was capable to solve the issue of key managements but it requires large computational cost.…”
Section: *Author For Correspondencementioning
confidence: 99%
See 2 more Smart Citations