scholarly journals A Public Verifiability Signcryption Scheme without Pairings

2017 ◽  
Vol 157 (9) ◽  
pp. 35-40
Author(s):  
Hassan M. ◽  
Mohamed H. ◽  
Eman Abouelkheir
2011 ◽  
Vol 1 ◽  
pp. 198-203
Author(s):  
Xiu Ying Yu ◽  
Da Ke He

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.


2014 ◽  
Vol 74 (5) ◽  
pp. 1711-1723 ◽  
Author(s):  
Shehzad Ashraf Ch ◽  
Nizam uddin ◽  
Muhammad Sher ◽  
Anwar Ghani ◽  
Husnain Naqvi ◽  
...  

2020 ◽  
Vol 39 (6) ◽  
pp. 8487-8498
Author(s):  
Malathi Devarajan ◽  
N. Sasikaladevi

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.


2010 ◽  
Vol 20-23 ◽  
pp. 706-712
Author(s):  
Xuan Wu Zhou

Public verifiability in signcryption achieves public verification of signature by a trustable third party; it ensures the reliability and secure parity of signcryption scheme. In the paper, we analyzed the public verification algorithm in signcryption and presented signcryption scheme without verifiability based on discrete logarithm problem as a comparison. Signcryption without verifiability satisfies the basic requirements of authenticated encryption; it can achieve secret message transmission and identity authentication in a single protocol. But the signcryption sender can cheat in the protocol with forged information for lack of supervision by public verification. Then we presented an improved signcryption scheme with public verifiability, in the scheme signcryption message is generated with private key of message sender and other public parameters, any trustable third party can verify the signcryption without disclosing private key or secret parameters. Besides, the attack on the signcryption and secret parameters via public verification data is computationally infeasible. The scheme reinforces the security and reliability of signcryption and effectively improves its efficiency for engineering application.


Sign in / Sign up

Export Citation Format

Share Document