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

The Computer Journal

A Key-Policy Attribute-Based Proxy Re-Encryption Without Random Oracles: Table 1.

Chunpeng Ge, Willy Susilo, Jiandong Wang, Zhiqiu Huang, Liming Fang, Yongjun Ren

Published Nov 12, 2015• 40 citations
Publisher

Abstract

A conditional proxy re-encryption (CPRE) scheme enables the proxy to convert a ciphertext from Alice to Bob, if the ciphertext satisfies one condition set by Alice. To improve the issue of more fine-grained on the condition set, Fang, Wang, Ge and Ren proposed a new primitive named Interactive conditional PRE with fine grain policy (ICPRE-FG) in 2011, and left an open problem on how to construct CCA-secure ICPRE-FG without random oracles. In this paper, we answer this open problem affirmatively by presenting a new construction of CCA-secure key-policy attribute-based PRE (KP-ABPRE) without random oracles. In this paper, we enhance the security model of Fang's ICPRE-FG scheme by allowing the adversary to make some extra queries, which do not help them win the game trivially. Finally, we present a CCA-secure KP-ABPRE without random oracles under the 3-weak decisional bilinear Diffie–Hellman inversion(3-wDBDHI) assumption.

DOI
10.1093/comjnl/bxv100

Related papers

Research on Non-interactive Construction based on Fuzzy Conditional Proxy Re-encryption

Chunpeng Ge, Jiandong Wang, Liming Fang

In a conditional proxy re-encryption (C-PRE) scheme, a semi-trusted proxy can transform Alice's ciphertext into Bob's ciphertext without learning the underlying plaintext, if the ciphertext satisfies a certain condition.To achieve more fine-grained delegation on conditions, Fang, Wang and Ge introduced the notion of fuzzy conditional proxy re-encryption (FC-PRE), whereby the conditions is viewed a set of descriptive keywords.The proxy with a re-encryption key for a condition word set can convert a ciphertext encrypted with a condition word set , if and only if and are close to each other as measured by the "set overlap" distance metric.Nonetheless, they left an open problem on how to construct a non-interactive FC-PRE scheme.Furthermore, their scheme is only proved secure in the random oracle model.In this paper, we answer the above problems affirmatively by presenting a non-interactive fuzzy conditional proxy reencryption scheme.Moreover, our scheme is proved secure without random oracles.

International Journal of Security and Its Applications•Dec 31, 2015•0 citations

New CCA-Secure Proxy Re-encryption Scheme without Random Oracles

Xu An Wang, Ping Wei, Minqing Zhang

Proxy re-encryption (PRE) allows a ciphertext computed under Alice's public key to be transformed to those which can be decrypted by Bob. In PKC'08, Libert and Vergnaud proposed the first unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.'s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2010•2 citations

Restricted CCA-secure bidirectional proxy re-encryption scheme

Guo Duntao, Xu An Wang, Minqing Zhang +1 more

Proxy re-encryption allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In CANS'08, Deng et al. proposed the first bidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. Later, in PKC'09, Shao et al. proposed the first unidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. But both of these schemes prove their security in the random oracle. They left an open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings. In this paper, we try to solve this open problem by proposing two new restricted IND-PRE-CCA2 secure bidirectional proxy re-encryption schemes without pairing nor random oracle.

•Jul 1, 2010•0 citations

Bidirectional proxy re-encryption schemes without pairing nor random oracle

Xu An Wang, Ping Wei, Weidong Zhong +1 more

Blaze et al. in 1998 introduced the concept of proxy re-encryption, which allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In CCS'07, Canetti et al. proposed an IND-PRE-CCA2 bidirectional proxy re-encryption scheme, and later, Libert et al. proposed another IND-PRE-CCA2 secure unidirectional proxy re-encryption. However, both schemes rely on the costly bilinear pairings. In CANS'08, Deng et al. proposed the first IND-PRE-CCA2 secure proxy re-encryption without parings. Later, in PKC'09, Shao et al. proposed another IND-PRE-CCA2 secure proxy re-encryption without parings. But both of these schemes prove their security in the random oracle. In this paper, based on Hanaoka's efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we present two new interesting bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.

•Jul 1, 2010•1 citation

Toward CCA-secure bidirectional proxy re-encryption without pairing nor random oracle

Longxia Zhang, Xu An Wang, Wei Wang

Proxy re-encryption, introduced by Blaze et al. in 1998, allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. An open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings was left until now. In this paper, based on Hanaoka's efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we try to solve this open problem by presenting two new bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.

International Conference on Signal Processing Systems (ICSPS)•Jul 1, 2010•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
A conditional proxy re-encryption (CPRE) scheme enables the proxy to convert a ciphertext from Alice to Bob, if the ciphertext satisfies one condition set by Alice. To improve the issue of more fine-grained on the condition set, Fang, Wang, Ge and Ren proposed a new primitive named Interactive conditional PRE with fine grain policy (ICPRE-FG) in 2011, and left an open problem on how to construct CCA-secure ICPRE-FG without random oracles. In this paper, we answer this open problem affirmatively by presenting a new construction of CCA-secure key-policy attribute-based PRE (KP-ABPRE) without random oracles. In this paper, we enhance the security model of Fang's ICPRE-FG scheme by allowing the adversary to make some extra queries, which do not help them win the game trivially. Finally, we present a CCA-secure KP-ABPRE without random oracles under the 3-weak decisional bilinear Diffie–Hellman inversion(3-wDBDHI) assumption.
In a conditional proxy re-encryption (C-PRE) scheme, a semi-trusted proxy can transform Alice's ciphertext into Bob's ciphertext without learning the underlying plaintext, if the ciphertext satisfies a certain condition.To achieve more fine-grained delegation on conditions, Fang, Wang and Ge introduced the notion of fuzzy conditional proxy re-encryption (FC-PRE), whereby the conditions is viewed a set of descriptive keywords.The proxy with a re-encryption key for a condition word set can convert a ciphertext encrypted with a condition word set , if and only if and are close to each other as measured by the "set overlap" distance metric.Nonetheless, they left an open problem on how to construct a non-interactive FC-PRE scheme.Furthermore, their scheme is only proved secure in the random oracle model.In this paper, we answer the above problems affirmatively by presenting a non-interactive fuzzy conditional proxy reencryption scheme.Moreover, our scheme is proved secure without random oracles.
Proxy re-encryption (PRE) allows a ciphertext computed under Alice's public key to be transformed to those which can be decrypted by Bob. In PKC'08, Libert and Vergnaud proposed the first unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.'s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.
Proxy re-encryption allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In CANS'08, Deng et al. proposed the first bidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. Later, in PKC'09, Shao et al. proposed the first unidirectional IND-PRE-CCA2 secure proxy re-encryption without parings. But both of these schemes prove their security in the random oracle. They left an open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings. In this paper, we try to solve this open problem by proposing two new restricted IND-PRE-CCA2 secure bidirectional proxy re-encryption schemes without pairing nor random oracle.
Blaze et al. in 1998 introduced the concept of proxy re-encryption, which allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. In CCS'07, Canetti et al. proposed an IND-PRE-CCA2 bidirectional proxy re-encryption scheme, and later, Libert et al. proposed another IND-PRE-CCA2 secure unidirectional proxy re-encryption. However, both schemes rely on the costly bilinear pairings. In CANS'08, Deng et al. proposed the first IND-PRE-CCA2 secure proxy re-encryption without parings. Later, in PKC'09, Shao et al. proposed another IND-PRE-CCA2 secure proxy re-encryption without parings. But both of these schemes prove their security in the random oracle. In this paper, based on Hanaoka's efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we present two new interesting bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.
Proxy re-encryption, introduced by Blaze et al. in 1998, allows a proxy to transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. An open problem of constructing (bidirectional or unidirectional) IND-PRE-CCA2 secure proxy re-encryption scheme in the standard model yet without pairings was left until now. In this paper, based on Hanaoka's efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption, we try to solve this open problem by presenting two new bidirectional proxy re-encryption schemes, which are restricted IND-PRE-CCA2 secure without pairing nor random oracle.
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.