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

Indentity-based broadcast signcryption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0
1

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 54 publications
(26 citation statements)
references
References 6 publications
0
25
0
1
Order By: Relevance
“…Here means elliptic curve multiplication. is a base point in the generator point .Security of ECC relies on the difficulties of following problems [22].…”
Section: Overview Of Eccmentioning
confidence: 99%
“…Here means elliptic curve multiplication. is a base point in the generator point .Security of ECC relies on the difficulties of following problems [22].…”
Section: Overview Of Eccmentioning
confidence: 99%
“…Typically, elliptic curves are defined over either the integers modulo a prime number (GF(p)) or over binary polynomials (GF (2m)). An elliptic curve is a cubic equation of the form: Generally, the security of ECC relies on the difficulties of the following problems [10]. Definition 1 Given two points P and Q over Ep(a, b), the elliptic curve discrete logarithm problem (ECDLP) is to find an integer s ε Fp * such that Q = s.P.…”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…Definition 3 Given two points P and Q = s.P + t.P over Ep(a, b) or s; t ε Fp * , the elliptic curve factorization problem (ECFP) is to find two points s. P and t.P over Ep(a, b). Up to now, there is no algorithm to be able to solve any of the above problems [10] …”
Section: Elliptic Curve Cryptographymentioning
confidence: 99%
“…In [4], Zheng introduced the notion of signcryption in 1997, which is a cryptographic primitive that supplies both authentication and confidentiality in a reasonable logic step, at a lower price than that of the traditional signature-then-encryption approach. Many practical and novel signcryption schemes along with their applications have been proposed in the past years (such as [3,[5][6][7][8][9][10][11][12]). …”
Section: Introductionmentioning
confidence: 99%
“…For example, in 2006, Duan and Cao [8] proposed a multi-receiver ID-based signcryption for more than one receiver scenario. In 2008, Li et al [7] presented an ID-based broadcast signcryption for the application of broadcasting a message to multiple users in a secure and authenticated manner. In 2010, Liu et al [18] proposed certificateless signcryption as an extension of ID-based signcryption.…”
Section: Introductionmentioning
confidence: 99%