scholarly journals Broadcast Proxy Reencryption Based on Certificateless Public Key Cryptography for Secure Data Sharing

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Won-Bin Kim ◽  
Su-Hyun Kim ◽  
Daehee Seo ◽  
Im-Yeong Lee
Keyword(s):  
Data Sharing ◽  
Computational Efficiency ◽  
Computation Time ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Public Key ◽  
Broadcast Encryption ◽  
Key Escrow ◽  
Certificateless Public Key Cryptography ◽  
Verification Problem

Broadcast proxy reencryption (BPRE), which combines broadcast encryption (BE) and proxy reencryption (PRE), is a technology used for the redistribution of data uploaded on the cloud to multiple users. BPRE reencrypts data encrypted by the distributor and then uploads it to the cloud into a ciphertext that at a later stage targets multiple recipients. As a result of this, flexible data sharing is possible for multiple recipients. However, various inefficiencies and vulnerabilities of the BE, such as the recipient anonymity problem and the key escrow problem, also creep into BPRE. Our aim in this study was to address this problem of the existing BPRE technology. The partial key verification problem that appeared in the process of solving the key escrow problem was solved, and the computational efficiency was improved by not using bilinear pairing, which requires a lot of computation time.

scholarly journals A Certificateless Ring Signature Scheme with High Efficiency in the Random Oracle Model

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yingying Zhang ◽  
Jiwen Zeng ◽  
Wei Li ◽  
Huilin Zhu
Keyword(s):  
Digital Signature ◽  
High Efficiency ◽  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Bilinear Pairing ◽  
Public Key ◽  
Ring Signature ◽  
Certificateless Public Key Cryptography ◽  
Identity Based

Ring signature is a kind of digital signature which can protect the identity of the signer. Certificateless public key cryptography not only overcomes key escrow problem but also does not lose some advantages of identity-based cryptography. Certificateless ring signature integrates ring signature with certificateless public key cryptography. In this paper, we propose an efficient certificateless ring signature; it has only three bilinear pairing operations in the verify algorithm. The scheme is proved to be unforgeable in the random oracle model.

Certificateless Multi-Signcryption Scheme without Pairing

2014 ◽  
Vol 599-601 ◽  
pp. 1435-1438 ◽  
Author(s):  
Yi Ding
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
New Paradigm ◽  
Key Escrow ◽  
Certificateless Public Key Cryptography ◽  
Signcryption Scheme

Certificateless public key cryptography is a new paradigm that simplifies the traditional PKC and solves the inherent key escrow problem suffered by ID-PKC. As realizing both encryption and signature security goals, certificateless signcryption is one of the most important security primitives in CL-PKC. To adapt multi-user settings, we present a certificateless multi-signcryption scheme without pairing. The performace analysis shows that the scheme is very efficient.

Structure and Analysis of Certificateless Proxy Blind Signature Scheme without Bilinear Pairing

2013 ◽  
Vol 734-737 ◽  
pp. 3194-3198
Author(s):  
Yi Wang
Keyword(s):  
Finite Field ◽  
Discrete Logarithm ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Scheme ◽  
Proxy Blind Signature ◽  
Certificateless Public Key Cryptography

Combined with certificateless public key cryptography and proxy blind signature, an efficient certificateless proxy blind signature scheme is proposed. Its security is based on the discrete logarithm problem. Compared with the existed certificateless proxy blind signature scheme, because without bilinear pairing, it have higher efficiency. According to the different attacker and all kinds of attacks, the scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.

scholarly journals An efficient certificateless blind signature scheme without bilinear pairing

2014 ◽  
Vol 86 (2) ◽  
pp. 1003-1011 ◽  
Author(s):  
GUOFAGN DONG ◽  
FEI GAO ◽  
WENBO SHI ◽  
PENG GONG
Keyword(s):  
Security Analysis ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Blind Signature ◽  
Public Key ◽  
Management Problem ◽  
Storage Security ◽  
Certificateless Public Key Cryptography ◽  
Identity Based ◽  
And Storage

Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries.

Multi-Node of Synergy Certificateless Authentication in WSNs

2012 ◽  
Vol 263-266 ◽  
pp. 3047-3051
Author(s):  
Guang Cong Liu ◽  
Yuan Jie Shi ◽  
Cong Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
High Efficiency ◽  
Low Cost ◽  
Public Key Cryptography ◽  
Security Requirements ◽  
Public Key ◽  
Wireless Sensor ◽  
Certificateless Public Key Cryptography ◽  
Certificateless Authentication

Certificateless Public Key Cryptography (CL-PKC) overcomes not only the key escrow problem in public key cryptography but also the cost of the certificate publishing and management in the Certificateless Public Key Cryptography (CL-PKC). No certificate public key cryptosystem just meet the requirements of this, but it relies on a special authentication server, which has high operating costs and lack of flexibility and it cannot meet the requirements of wireless sensor networks directly. Considering these problems, a multi-node of synergy certificateless authentication approach is proposed for WSN. The certificate of the nodes would be done by the certification set. And the set was consited of trusted neighbor nodes. Analysis indicates that this certification meets the security requirements of general wireless sensor networks and has advantages of low-cost and high efficiency.

Sign in / Sign up

Export Citation Format

Share Document