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

Advances in intelligent systems research/Advances in Intelligent Systems Research

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

Yanni Chang, Mingxing He

Published Jan 1, 2014• 0 citations
Publisher

Abstract

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.

DOI
10.2991/csss-14.2014.69

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

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

Linru Ma

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.

Dianzi xuebao•Jan 1, 2011•3 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

CCA-Secure Unidirectional Proxy Re-Encryption in the Adaptive Corruption Model without Random Oracles.

Jian Weng, Min-Rong Chen, Yanjiang Yang +3 more

•Jan 1, 2010•2 citations

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

Jian Weng, Min-Rong Chen, Yanjiang Yang +3 more

Science China Information Sciences•Mar 1, 2010•88 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
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.
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.
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.
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.
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.