Open AccessJournal Article
Efficient certificateless signcryption scheme
Wang Xing,Qian Haifeng +1 more
Reads0
Chats0
TLDR
This paper presents an efficient certificateless signcryption scheme, which only requires one pairing operation in the signc encryption phase and three pairing operations in the unsigncryption phase, and satisfies confidentiality, unforgeability and public verifiability.Abstract:
Certificateless cryptography not only overcomes the certificate management problems in the traditional public key cryptosystems,but also solves the key escrow problems in identity-based cryptosystemsSigncryption scheme combines the functionality of public key encryption and digital signature,which can realize the confidentiality and unforgeability of message simultaneouslyThis paper presents an efficient certificateless signcryption scheme,which only requires one pairing operation in the signcryption phase and three pairing operations in the unsigncryption phaseWith comparison to the existing schemes,the efficiency of the scheme is betterFor security requirements,this new scheme satisfies confidentiality,unforgeability and public verifiabilityread more
Citations
More filters
Proceedings ArticleDOI
An efficient certificateless aggregate signcryption scheme from pairings
Haijun Lu,Qi Xie +1 more
TL;DR: The proposed scheme captures indistinguishability of encryptions under adaptively chosen ciphertext attacks (IND-CCA2) and existential unforgeability against chosen message attacks (EUF-CMA) in the random oracle model.
Journal Article
Secure certificateless signcryption scheme without bilinear pairing
TL;DR: The security of the proposed certificateless signcryption scheme without bilinear pairing is higher and there is no existed not solving the discrete logarithm problem polynomial time attacking algorithm aimed at the proposed signc encryption scheme.
Proceedings ArticleDOI
An efficient certificateless signcryption in the standard model
Xiao Zheng,Xudong Li +1 more
TL;DR: This scheme possesses public ciphertext verifiability and satisfies indistinguishable against adaptive chosen ciphertext attacks (IND-CCA) and existentially unforgeable against chosen message attacks (EUF-CMA) under computational Diffie-Hellman (CDH) problems assumption.
Proceedings ArticleDOI
Security Analysis and Improvement of Hybrid Signcryption Scheme Based on Heterogeneous System
Shijin Li,Fushou Tao,Ting Shi +2 more
TL;DR: An improved heterogeneous hybrid signcryption scheme is proposed based on the bilinear Diffie-Hellman problem and discrete logarithm problem and is proved to satisfy confidentiality and unforgeability.
Journal ArticleDOI
Research on ID-Based Proxy Re-Signcryption Scheme
Yan Hong Wang,Jun Yao Ye +1 more
TL;DR: This paper constructs a new ID-based proxy re-signcryption scheme that uses a semi-trusted agent to achieve the transparent conversion between identiy decryption and identity verification, and proves that this scheme is secure.