Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Provably Secure Identity-based Conditional Proxy Re-encryption Scheme

YE Weiwei,OU Qingyu,WEI Wei

Published Sep 1, 2017• 0 citations
Publisher

Abstract

The conditional proxy re-encryption based on the traditional public key cryptosystem is mature,but the Identity-based Proxy Re-encryption(IBPRE) scheme,controlling agents’ permissions from the fine-grained level is a problem needed to be solved.Thus,this paper proposes an identity-based conditional proxy re-encryption scheme.The security of the scheme is proven equivalent to the DBDH problem,and its chosen-ciphertext security in the adaptive corruption model is proved in the random oracle model.Security analysis results show that,compared with other schemes,this scheme has better security,practicality and higher efficiency.

DOI
10.3969/j.issn.1000-3428.2017.09.034

Related papers

Identity Based Proxy Re-encryption From BB1 IBE

Jindan Zhang, Xu An Wang, Xiaoyuan Yang

In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opened under Bob’s decryption key. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE (Certificate Based Public Key Encryption) to IBE (Identity Based Encryption) (type 1), IBE to IBE (type 2), IBE to CBE (type 3), CBE to CBE (type 4). In this paper, we find that if we allow the PKG to use its masterkey in the process of generating re-encryption key for proxy re-encryption in identity based setting, many open problems can be solved. We give the new security models for proxy reencryption in identity based setting, especially considering PKG’s involving in the re-encryption key generation process and PKG’s master-key’s security. We construct the new IND-ID-CPA and the first IND-ID-CCA2 secure proxy reencryption schemes based on BB1 IBE. We also prove their security by introducing some new techniques which maybe have independent interest. At last, we compare our new schemes with existing ones, the results show that our scheme can achieve high security levels and are very efficient for re-encryption and, which are very important for practical applications.

Journal of Computers•May 18, 2013•1 citation

Identity-based multi-condition proxy re-encryption

Pingshu Wang

In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob without seeing the underlying plaintext.However, a fine-grained delegation is demanded in some scenarios.For this, Weng et al. introduce the notion of conditional proxy re-encryption (CPRE), and formalize its security model and propose an efficient CPRE scheme.This paper presents the notion of identity-based multi-condition proxy re-encryption, which is a variant of identity-based condition proxy re-encryption.In such system, ciphertexts are generated under specified conditions by Alice, and the proxy can translate the ciphertext if the relevant conditions are satisfied.We formalize its security model and construct a concrete multi-condition proxy re-encryption scheme, and prove its security in the standard model.

International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII)•Jan 1, 2016•2 citations

Identity-Based Proxy Re-Encryption Based on LWE with Short Parameters

Keyuan Zhang, Yuan Liu, Licheng Wang +1 more

Proxy re-encryption (PRE) can guarantee the security of data sharing in the cloud making it important in ciphertext sharing in the cloud computing environment. Plenty of the current PRE algorithms based on the learning with errors (LWE) problem are constructed under the random oracle model or have problems such as long public parameter size, large ciphertext expansion rate, etc. We propose an identity-based PRE (IB-PRE) scheme using the LWE problem with short public parameters which can solve the mentioned challenges. Our scheme uses the blocking operation to decrease the public parameter size and a more useful trapdoor generation algorithm to reduce the trapdoor size. These two technologies improve the computational efficiency of the public key. We think that when we divide the identity id into 16 blocks, without much increase in computational overhead, the public key size can be reduced by 88.34%, and the scheme’s security level can remain unchanged. Our scheme achieves adaptive IND-ID-CPA security. It is unidirectional, collusion-resistant, and constructed under the standard model.

International Conference on Mobile Internet, Cloud Computing and Information Security (MICCIS)•Apr 1, 2023•2 citations

Security Analysis of a Multi-use Identity Based CCA-Secure Proxy Re-encryption Scheme

Jindan Zhang, Xu An Wang

In proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the underlying plaintext. In multi-use PRE schemes, the cipher text can be transformed from Alice to Bob and to Charlie and so on. Due to its cipher text transformation property, it is difficult to achieve chosen cipher text security for PRE, especially for multi-use PRE. IBE is a new kind of public-key encryption where the recipient's public key is an arbitrary string that represents the recipient's identity. Identity based proxy re-encryption (IBPRE) is a primitive combing the feature of IBE and PRE. Recently Wang et al. proposed a multi-use unidirectional CCA-secure identity based proxy re-encryption (IBPRE) scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2012•10 citations

ID-Based Proxy Re-encryption Scheme with Chosen-Ciphertext Security

Woo Kwon Koo, Jungyeon Hwang, Hyoung-Joong Kim +1 more

A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert a ciphertext for Alice into the ciphertext for Bob. Recently, ID-based proxy re-encryption schemes are receiving considerable attention for a variety of applications such as distributed storage, DRM, and email-forwarding system. And a non-interactive identity-based proxy re-encryption scheme was proposed for achieving CCA-security by Green and Ateniese. In the paper, we show that the identity-based proxy re-encryption scheme is unfortunately vulnerable to a collusion attack. The collusion of a proxy and a malicious user enables two parties to derive other honest users' private keys and thereby decrypt ciphertexts intended for only the honest user. To solve this problem, we propose two ID-based proxy re-encryption scheme schemes, which are proved secure under CPA and CCA in the random oracle model. For achieving CCA-security, we present self-authentication tag based on short signature. Important features of proposed scheme is that ciphertext structure is preserved after the ciphertext is re-encrypted. Therefore it does not lead to ciphertext expansion. And there is no limitation on the number of re-encryption.

Journal of the Institute of Electronics Engineers of Korea•Jan 1, 2009•1 citation

Identity-Based Proxy Re-encryption over NTRU Lattices for Cloud Computing

Na Yue, Yang Wang, Mingqiang Wang

Identity-based proxy re-encryption (IB-PRE) is a kind of public key cryptography that allows a proxy to convert the ciphertext based on Alice’s identity into another ciphertext of the same message for Bob. It has important applications in cloud computing, distributed systems and secure e-mail forwarding. So far, the existing lattice-based IB-PRE schemes are designed on the general lattice and their security is based on the learning with errors (LWE) assumption. In this paper, we propose an IB-PRE scheme over NTRU lattices with the desirable properties of anonymity, unidirectionality, backward collusion safeness and multi-hop. Our IB-PRE scheme is provable secure under adaptive chosen-plaintext and adaptive chosen-identity attacks. And, in the random oracle model, the security of our scheme is based on the decisional Ring-LWE assumption. Besides, the key and ciphertext sizes of our IB-PRE scheme are short, only one or two ring elements, and our scheme could encrypt n bits in each encryption process.

Procedia Computer Science•Jan 1, 2021•1 citation
The conditional proxy re-encryption based on the traditional public key cryptosystem is mature,but the Identity-based Proxy Re-encryption(IBPRE) scheme,controlling agents’ permissions from the fine-grained level is a problem needed to be solved.Thus,this paper proposes an identity-based conditional proxy re-encryption scheme.The security of the scheme is proven equivalent to the DBDH problem,and its chosen-ciphertext security in the adaptive corruption model is proved in the random oracle model.Security analysis results show that,compared with other schemes,this scheme has better security,practicality and higher efficiency.
In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice’s public key into one that can be opened under Bob’s decryption key. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE (Certificate Based Public Key Encryption) to IBE (Identity Based Encryption) (type 1), IBE to IBE (type 2), IBE to CBE (type 3), CBE to CBE (type 4). In this paper, we find that if we allow the PKG to use its masterkey in the process of generating re-encryption key for proxy re-encryption in identity based setting, many open problems can be solved. We give the new security models for proxy reencryption in identity based setting, especially considering PKG’s involving in the re-encryption key generation process and PKG’s master-key’s security. We construct the new IND-ID-CPA and the first IND-ID-CCA2 secure proxy reencryption schemes based on BB1 IBE. We also prove their security by introducing some new techniques which maybe have independent interest. At last, we compare our new schemes with existing ones, the results show that our scheme can achieve high security levels and are very efficient for re-encryption and, which are very important for practical applications.
In a proxy re-encryption system, a semi-trusted proxy can convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob without seeing the underlying plaintext.However, a fine-grained delegation is demanded in some scenarios.For this, Weng et al. introduce the notion of conditional proxy re-encryption (CPRE), and formalize its security model and propose an efficient CPRE scheme.This paper presents the notion of identity-based multi-condition proxy re-encryption, which is a variant of identity-based condition proxy re-encryption.In such system, ciphertexts are generated under specified conditions by Alice, and the proxy can translate the ciphertext if the relevant conditions are satisfied.We formalize its security model and construct a concrete multi-condition proxy re-encryption scheme, and prove its security in the standard model.
Proxy re-encryption (PRE) can guarantee the security of data sharing in the cloud making it important in ciphertext sharing in the cloud computing environment. Plenty of the current PRE algorithms based on the learning with errors (LWE) problem are constructed under the random oracle model or have problems such as long public parameter size, large ciphertext expansion rate, etc. We propose an identity-based PRE (IB-PRE) scheme using the LWE problem with short public parameters which can solve the mentioned challenges. Our scheme uses the blocking operation to decrease the public parameter size and a more useful trapdoor generation algorithm to reduce the trapdoor size. These two technologies improve the computational efficiency of the public key. We think that when we divide the identity id into 16 blocks, without much increase in computational overhead, the public key size can be reduced by 88.34%, and the scheme’s security level can remain unchanged. Our scheme achieves adaptive IND-ID-CPA security. It is unidirectional, collusion-resistant, and constructed under the standard model.
In proxy re-encryption (PRE), a semi-trusted proxy can convert a cipher text originally intended for Alice into one which can be decrypted by Bob, while the proxy can not know the underlying plaintext. In multi-use PRE schemes, the cipher text can be transformed from Alice to Bob and to Charlie and so on. Due to its cipher text transformation property, it is difficult to achieve chosen cipher text security for PRE, especially for multi-use PRE. IBE is a new kind of public-key encryption where the recipient's public key is an arbitrary string that represents the recipient's identity. Identity based proxy re-encryption (IBPRE) is a primitive combing the feature of IBE and PRE. Recently Wang et al. proposed a multi-use unidirectional CCA-secure identity based proxy re-encryption (IBPRE) scheme. Unfortunately, we show their proposal is not CCA-secure in the corresponding security models by giving concrete attacks.
A proxy re-encryption scheme allows Alice to temporarily delegate the decryption rights to Bob via a proxy. Alice gives the proxy a re-encryption key so that the proxy can convert a ciphertext for Alice into the ciphertext for Bob. Recently, ID-based proxy re-encryption schemes are receiving considerable attention for a variety of applications such as distributed storage, DRM, and email-forwarding system. And a non-interactive identity-based proxy re-encryption scheme was proposed for achieving CCA-security by Green and Ateniese. In the paper, we show that the identity-based proxy re-encryption scheme is unfortunately vulnerable to a collusion attack. The collusion of a proxy and a malicious user enables two parties to derive other honest users' private keys and thereby decrypt ciphertexts intended for only the honest user. To solve this problem, we propose two ID-based proxy re-encryption scheme schemes, which are proved secure under CPA and CCA in the random oracle model. For achieving CCA-security, we present self-authentication tag based on short signature. Important features of proposed scheme is that ciphertext structure is preserved after the ciphertext is re-encrypted. Therefore it does not lead to ciphertext expansion. And there is no limitation on the number of re-encryption.
Identity-based proxy re-encryption (IB-PRE) is a kind of public key cryptography that allows a proxy to convert the ciphertext based on Alice’s identity into another ciphertext of the same message for Bob. It has important applications in cloud computing, distributed systems and secure e-mail forwarding. So far, the existing lattice-based IB-PRE schemes are designed on the general lattice and their security is based on the learning with errors (LWE) assumption. In this paper, we propose an IB-PRE scheme over NTRU lattices with the desirable properties of anonymity, unidirectionality, backward collusion safeness and multi-hop. Our IB-PRE scheme is provable secure under adaptive chosen-plaintext and adaptive chosen-identity attacks. And, in the random oracle model, the security of our scheme is based on the decisional Ring-LWE assumption. Besides, the key and ciphertext sizes of our IB-PRE scheme are short, only one or two ring elements, and our scheme could encrypt n bits in each encryption process.