scholarly journals An efficient pairing-free certificateless signcryption scheme with public verifiability

2021 ◽  
Keyword(s):  
Public Verifiability ◽  
Signcryption Scheme

scholarly journals Identity-Based Multi-Signcryption with Public Verifiability

2011 ◽  
Vol 1 ◽  
pp. 198-203
Author(s):  
Xiu Ying Yu ◽  
Da Ke He
Keyword(s):  
Elliptic Curve ◽  
Bilinear Pairing ◽  
The Public ◽  
Public Verifiability ◽  
Identity Based ◽  
Signcryption Scheme ◽  
Public Verification

Multi-signcryption can meet the requirement of message signcryption with muti-participant. Since the existing identity-based multi-signcryption scheme cannot offer the function of public verifiability, based on identity and bilinear pairing on the Elliptic Curve, a new scheme with public verifiability is proposed. In the scheme, with the steps which is comparatively independent to the signcryption process, it can provide the public verification of each signcryption in need. Therefore, our scheme efficiently achieves the cryptographic functions of multi-signcryption.

scholarly journals A Public Verifiability Signcryption Scheme without Pairings

2017 ◽  
Vol 157 (9) ◽  
pp. 35-40
Author(s):  
Hassan M. ◽  
Mohamed H. ◽  
Eman Abouelkheir
Keyword(s):  
Public Verifiability ◽  
Signcryption Scheme

An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography

2014 ◽  
Vol 74 (5) ◽  
pp. 1711-1723 ◽  
Author(s):  
Shehzad Ashraf Ch ◽  
Nizam uddin ◽  
Muhammad Sher ◽  
Anwar Ghani ◽  
Husnain Naqvi ◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Forward Secrecy ◽  
Public Verifiability ◽  
Hyper Elliptic Curve ◽  
Signcryption Scheme

An hyper elliptic curve based efficient signcryption scheme for user authentication

2020 ◽  
Vol 39 (6) ◽  
pp. 8487-8498
Author(s):  
Malathi Devarajan ◽  
N. Sasikaladevi
Keyword(s):  
Elliptic Curve ◽  
User Authentication ◽  
Computational Cost ◽  
Bilinear Pairing ◽  
Resource Constraint ◽  
Communication Overhead ◽  
Public Verifiability ◽  
High Level ◽  
Hyper Elliptic Curve ◽  
Signcryption Scheme

With ever growing popularity, wireless communication system also vulnerable to various security attacks. To provide high level security, many cryptographic solutions have been proposed. One such solution is signcryption, where authenticity and confidentiality provided by single logical step. Therefore, signcryption scheme helps to reduce computational cost, but it is not feasible for resource constraint environments. Because, most of the existing approaches were based on El-Gamal, bilinear pairing, Rivest-Shamir-Adleman (RSA), and Elliptic curve Cryptography (ECC). They consume more energy due to their increased key size. Hence, the new signcryption approach is proposed based on Hyper Elliptic Curve Cryptosystem (HECC) whose key size is much lesser than ECC. It significantly reduces the cost of computation and communication overhead by half the amount of ECC which suits well for resource constraint environments. Further, the proposed scheme attains necessary security features along with forward secrecy and public verifiability. On the other hand, the security of the approach is validated through an automated protocol validation tool – AVISPA.

Sign in / Sign up

Export Citation Format

Share Document