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

Dianzi xuebao

CCA-Secure Type-Based Proxy Re-Encryption Without Pairings

Linru Ma

Published Jan 1, 2011• 3 citations
OpenAlex

Abstract

Type-based proxy re-encryption is an effective and efficient cryptographic solution to ciphertext delegation and distribution,which also enables the ciphertext owners to carry out fine-grained delegation control.In this paper,we propose a new type-based proxy re-encryption scheme without pairings and prove it against the chosen-ciphertext attack(CCA) in the random oracle model.Compared with the existing type-based proxy re-encryption schemes constructed with pairings,our scheme owns better efficiency as well as the master key security.

Related papers

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Chen Min

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher efficiency and stronger security.

Science China Information Sciences•Jan 1, 2010•0 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

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

A Fine-grained Certificateless Conditional Proxy Broadcast Re-Encryption Scheme Without Pairing

Hongfei Yang, Li Li, Chunyan Yang

Proxy re-encryption allows a semi-trusted proxy to convert the ciphertext of the data owner into the ciphertext of the target user. The certificateless proxy re-encryption eliminates the need for public key certificate in traditional public-key cryptography and key-escrow problem in identity-based cryptography, which makes it more convenient to apply. However, the existing certificateless proxy re-encryption schemes cannot support one-to-many conversion and flexible control on convert conditions. In this paper, we propose a fine-grained certificateless conditional proxy broadcast re-encryption scheme without pairing. In our scheme, the data owner can delegate the decryption rights of the ciphertext that meets certain conditions to the target users, and the data owner can revoke the delegate rights. At the same time, no pairing is used, which makes the scheme more efficient. Finally, we show that the security of the scheme for chosen-ciphertext attacks in the random oracle model.

IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC)•Jun 17, 2022•8 citations

Certificateless Proxy Re-Encryption Without Pairing: Revisited

Akshayaram Srinivasan, Chandrasekharan Pandu Rangan

Proxy Re-Encryption was introduced by Blaze, Bleumer and Strauss to efficiently solve the problem of delegation of decryption rights. In proxy re-encryption, a semi-honest proxy transforms a ciphertext intended for Alice to a ciphertext of the same message for Bob without learning anything about the underlying message. From its introduction, several proxy re-encryption schemes in the Public Key In-frastructure (PKI) and Identity (ID) based setting have been proposed. In practice, systems in the public key infrastructure suffer from the certificate management problem and those in identity based setting suffer from the key escrow problem. Certificateless Proxy Re-encryption schemes enjoy the advantages provided by ID-based constructions without suffering from the key escrow problem. In this work, we construct the first unidirectional, single-hop CCA-secure certificateless proxy re-encryption scheme without pairing by extending the PKI based construction of Chow et al. proposed in 2010. We prove its security in the random oracle model under the Computational Diffie-Hellman (CDH) assumption. Prior to this work, the only secure certificateless proxy re-encryption scheme is due to Guo et al. proposed in 2013 using bilinear pairing. The construction proposed in this work is more efficient than that system and its security relies on more standard assumptions. We also show that the recently proposed construction of Yang et al. is insecure with respect to the security model considered in this work.

•Jan 1, 2015•1 citation

CCA secure type-based proxy re-encryption in the adaptive corruption model without random oracle

Yanni Chang, Mingxing He

Type-based proxy re-encryption can solve the finegrained delegation perfectly, and being more and more important in applications.However, as we know, there is still a problem come up with type-based proxy re-encryption in adaptive corruption model.In this paper, we propose a typedbased proxy re-encryption in the adaptive corruption model without random oracle; the scheme is CCA secure and proxyinvisible.Compared with the type-based proxy re-encryption proposed by J.S.D in 2013, this scheme has advantages in both security and efficiency.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2014•0 citations
Type-based proxy re-encryption is an effective and efficient cryptographic solution to ciphertext delegation and distribution,which also enables the ciphertext owners to carry out fine-grained delegation control.In this paper,we propose a new type-based proxy re-encryption scheme without pairings and prove it against the chosen-ciphertext attack(CCA) in the random oracle model.Compared with the existing type-based proxy re-encryption schemes constructed with pairings,our scheme owns better efficiency as well as the master key security.
Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher efficiency and stronger security.
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.
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.
Proxy re-encryption allows a semi-trusted proxy to convert the ciphertext of the data owner into the ciphertext of the target user. The certificateless proxy re-encryption eliminates the need for public key certificate in traditional public-key cryptography and key-escrow problem in identity-based cryptography, which makes it more convenient to apply. However, the existing certificateless proxy re-encryption schemes cannot support one-to-many conversion and flexible control on convert conditions. In this paper, we propose a fine-grained certificateless conditional proxy broadcast re-encryption scheme without pairing. In our scheme, the data owner can delegate the decryption rights of the ciphertext that meets certain conditions to the target users, and the data owner can revoke the delegate rights. At the same time, no pairing is used, which makes the scheme more efficient. Finally, we show that the security of the scheme for chosen-ciphertext attacks in the random oracle model.
Proxy Re-Encryption was introduced by Blaze, Bleumer and Strauss to efficiently solve the problem of delegation of decryption rights. In proxy re-encryption, a semi-honest proxy transforms a ciphertext intended for Alice to a ciphertext of the same message for Bob without learning anything about the underlying message. From its introduction, several proxy re-encryption schemes in the Public Key In-frastructure (PKI) and Identity (ID) based setting have been proposed. In practice, systems in the public key infrastructure suffer from the certificate management problem and those in identity based setting suffer from the key escrow problem. Certificateless Proxy Re-encryption schemes enjoy the advantages provided by ID-based constructions without suffering from the key escrow problem. In this work, we construct the first unidirectional, single-hop CCA-secure certificateless proxy re-encryption scheme without pairing by extending the PKI based construction of Chow et al. proposed in 2010. We prove its security in the random oracle model under the Computational Diffie-Hellman (CDH) assumption. Prior to this work, the only secure certificateless proxy re-encryption scheme is due to Guo et al. proposed in 2013 using bilinear pairing. The construction proposed in this work is more efficient than that system and its security relies on more standard assumptions. We also show that the recently proposed construction of Yang et al. is insecure with respect to the security model considered in this work.
Type-based proxy re-encryption can solve the finegrained delegation perfectly, and being more and more important in applications.However, as we know, there is still a problem come up with type-based proxy re-encryption in adaptive corruption model.In this paper, we propose a typedbased proxy re-encryption in the adaptive corruption model without random oracle; the scheme is CCA secure and proxyinvisible.Compared with the type-based proxy re-encryption proposed by J.S.D in 2013, this scheme has advantages in both security and efficiency.