2017
DOI: 10.1155/2017/8405879
|View full text |Cite
|
Sign up to set email alerts
|

Certificateless Key-Insulated Generalized Signcryption Scheme without Bilinear Pairings

Abstract: Generalized signcryption (GSC) can be applied as an encryption scheme, a signature scheme, or a signcryption scheme with only one algorithm and one key pair. A key-insulated mechanism can resolve the private key exposure problem. To ensure the security of cloud storage, we introduce the key-insulated mechanism into GSC and propose a concrete scheme without bilinear pairings in the certificateless cryptosystem setting. We provide a formal definition and a security model of certificateless key-insulated GSC. The… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
58
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 52 publications
(58 citation statements)
references
References 38 publications
0
58
0
Order By: Relevance
“…For this purpose, we use the results of schemes [21,26] which shows the computational time in milliseconds of different cryptographic operations such as single BP consumes 14.31 ms, EX consumes 1.25 ms, EM consumes 0.97 ms, and HDM consumes 0.48 ms, respectively. For this experiment, the authors of the schemes [21,26], used the hardware resources, for example, 8 GB RAM, Intel Core i74510UCPU, and 2.0GHz processor. The software resources like window 7 and C++ with Multi-Precision Integer and Rational Arithmetic C Library (MIRACL).…”
Section: Computational Costmentioning
confidence: 99%
“…For this purpose, we use the results of schemes [21,26] which shows the computational time in milliseconds of different cryptographic operations such as single BP consumes 14.31 ms, EX consumes 1.25 ms, EM consumes 0.97 ms, and HDM consumes 0.48 ms, respectively. For this experiment, the authors of the schemes [21,26], used the hardware resources, for example, 8 GB RAM, Intel Core i74510UCPU, and 2.0GHz processor. The software resources like window 7 and C++ with Multi-Precision Integer and Rational Arithmetic C Library (MIRACL).…”
Section: Computational Costmentioning
confidence: 99%
“…Their results concluded that single scalar multiplication practices 0.97 ms for elliptic curve point multiplication ( -). We suppose that, if using the same environment like [44], the hyper-elliptic curve divisors scalar multiplication ( -) will be consumes 0.48 ms because it is the generalized form of elliptic curves and uses the half amount of key,i.e., 80 bits. The following Table 3 shows the computational cost comparisons with respect to time-consuming in milliseconds: Table 3.…”
Section: Computational Costmentioning
confidence: 99%
“…Table I shows the most costly operations comparison of a proposed multi-message and multireciever with existing schemes [43], [44]. It is inspected from [58] the modular exponential consumes 1.25, pairing computation 14.31, pairing based multiplications 4.31 and elliptic curve point multiplication 0.97 milliseconds, respectively. This experiment was done by using the PC with hardware equipment's such as Intel Core i7-4510UCPU, 2.0GHz processor and 8GB of memory.…”
Section: Computational Costmentioning
confidence: 99%