Pairing free identity based aggregate signcryption scheme

Abouelkheir, Eman; El-Sherbiny, Shamia

doi:10.1049/iet-ifs.2019.0579

Cited by 17 publications

(3 citation statements)

References 18 publications

(36 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as mentioned above, the lattice based DRE schemes encounter the problem of large key size and do not corroborate public demonstrability. Hence, the pairing based PK-DRE are commonly considered Pairing free cryptography is proposed for many situations to reduce the resources and memory requirements [15][16][17][18][19][20][21]. Hence, in this work we propose a pairing free DRE to reduce the problem of computational complexity of pairing based counterpart.…”

Section: Related Workmentioning

confidence: 99%

A Pairing Free Provable Public Key Dual Receiver Encryption Scheme

Abouelkheir,

El-Sherbiny

2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

Preserving the privacy of sensitive data such as mercantile, medical, political or financial might utilize encryption, these encrypted data, in some cases, may be needed to be decrypted by other party, for this issue, the dual receiver encryption, DRE, scheme is constructed. Since the development of the first DRE and until now, several DRE schemes have been constructed, some of these schemes are based on bilinear pairings and others are lattice based. The lattice based DRE schemes have larger key size and does not corroborate the public verifiability whereas pairing based schemes suffers from higher computational cost. In the present work, we propose a construction of DRE without pairing to avoid the computational complexity problems. The proposed scheme is based on the decisional Diffie-Hellman security assumption. Our proposed scheme is secure under chosen cipher text attack. In addition, the suggested scheme achieves public verifiability and reduces computational complexity. In terms of computational complexity, our scheme saves about 53% compared to others with pairing in literature.

show abstract

Section: Related Workmentioning

confidence: 99%

A Pairing Free Provable Public Key Dual Receiver Encryption Scheme

Abouelkheir,

El-Sherbiny

2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…In 2020, Eman et al [18] proposed a secure identity-based pairing-free aggregate signcryption scheme over the elliptic curve cryptographic (ECC). This proposed scheme is considered secure under the random oracle model providing confidentiality and unforgeability security requirements.…”

Section: Related Workmentioning

confidence: 99%

Secure Equality Test Technique Using Identity-Based Signcryption for Telemedicine Systems

Ramadan

Raza

2023

IEEE Internet Things J.

View full text Add to dashboard Cite

For telemedicine, Wireless Body Area Network (WBAN) offers enormous benefits where a patient can be remotely monitored without compromising the mobility of remote treatments. With the advent of high capacity and reliable wireless networks, WBANs are used in several remote monitoring systems, limiting the COVID-19 spread. The sensitivity of telemedicine applications mandates confidentiality and privacy requirements. In this paper, we propose a secure WBAN-19 telemedicine system to overcome the pervasiveness of contagious deceases utilizing a novel aggregate identity-based signcryption scheme with an equality test feature. We demonstrate a security analysis regarding indistinguishable adaptive chosen-ciphertext attack (IND-CCA2), one-way security against adaptive chosen-ciphertext attack (OW-CCA2), and unforgeability against adaptive chosen-message attack (EUF-CMA) under the random oracle model. The security analysis of the scheme is followed by complexity evaluations where the computation cost and communication overhead are measured. The evaluation demonstrates that the proposed model is efficient and applicable in telemedicine systems with high-performance capacities.

show abstract

“…This section provides some computational problems that related to our scheme [45]. The elliptic curve problems are:…”

Section: Preliminariesmentioning

confidence: 99%

Provable Lightweight Hybrid Proxy Re-Encryption Scheme without Pairings for Internet of Things

Abouelkeir

2022

Preprint

View full text Add to dashboard Cite

Cisco originated a term fog computing which decentralized computing process on the cloud central to be closer to IOT data. Fog computing provides an efficient data storage and processing. Fog computing still suffer from some security and privacy. Security problems solved by proxy re-encryption schemes but it suffers from heavy computational operations because of using so many paring operations in delegation and delegated sides. Parings operations causes heavy computations. This paper suggests a new hybrid proxy re-encryption scheme without parings using both the symmetric and asymmetric cryptography schemes. The security proof of the proposed scheme has been done under Indistinguishability-Chosen Plaintext Attack. The suggested scheme is highly computationally efficient when compared with other schemes in literature.

show abstract

Pairing free identity based aggregate signcryption scheme

Cited by 17 publications

References 18 publications

A Pairing Free Provable Public Key Dual Receiver Encryption Scheme

A Pairing Free Provable Public Key Dual Receiver Encryption Scheme

Secure Equality Test Technique Using Identity-Based Signcryption for Telemedicine Systems

Provable Lightweight Hybrid Proxy Re-Encryption Scheme without Pairings for Internet of Things

Contact Info

Product

Resources

About