2009
DOI: 10.1016/j.csi.2008.05.013
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and provably-secure certificateless short signature scheme from bilinear pairings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
90
0
1

Year Published

2011
2011
2018
2018

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 101 publications
(91 citation statements)
references
References 13 publications
0
90
0
1
Order By: Relevance
“…The proposed scheme is based on an efficient and provably secure signature scheme from bilinear pairings [11,12] and an identity-based authenticated key agreement protocol [13].…”
Section: Introductionmentioning
confidence: 99%
“…The proposed scheme is based on an efficient and provably secure signature scheme from bilinear pairings [11,12] and an identity-based authenticated key agreement protocol [13].…”
Section: Introductionmentioning
confidence: 99%
“…Liu et al [9] claimed their certificateless aggregate signature scheme is secure against Tpye II adversary A II . Unfortunately, the scheme is insecure.…”
Section: Security-analysis Of Liu Et Al's Schemementioning
confidence: 99%
“…Later, Zhang et al, [7] proposed a new certificateless aggregate signature scheme and perfected Gong's certificateless aggregate signature security model, but the efficiency of their schemes [6][7] is lower. Afterwards, researchers proposed several schemes with less pairings or fixed signature's length [8][9][10][11]. Recently, Liu et al, [12] proposed another new construction of efficient certificateless aggregate signature scheme which only spent 3 pairings and is proven existentially unforgeable against adaptive chosen-message attacks.…”
Section: Introductionmentioning
confidence: 99%
“…H. Du and Q. Yen [11] proposed an efficient and provably secure certificateless short signature scheme from bilinear pairings. They presented a certificateless signature (CLS) scheme that was proven to be secure in the random oracle model and required general cryptographic hash functions instead of the map-to-point hash function, which is inefficient.…”
Section: Related Workmentioning
confidence: 99%