A Computationally Efficient Pairing-Free Group Key Distribution Scheme for Vehicular Ad-Hoc Network

Abouelkheir, Eman; El-Sherbiny, Shamia

doi:10.1109/icces48960.2019.9068116

Cited by 1 publication

(1 citation statement)

References 7 publications

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