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

Information Processing Letters

Security vulnerability in a non-interactive ID-based proxy re-encryption scheme

Woo Kwon Koo, Jung Yeon Hwang, Dong Hoon Lee

Published Oct 2, 2009• 11 citations
Publisher
DOI
10.1016/j.ipl.2009.09.010

Related papers

Security Analysis and Improvement of A Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme

Linchao Zhang, Hua Ma, Zhenhua Liu +1 more

Lecture notes on data engineering and communications technologies•Oct 21, 2016•6 citations

Security Analysis of Two Identity Based Proxy Re-encryption Schemes in Multi-user Networks

Xu An Wang, Jianfeng Ma, Xiaoyuan Yang +1 more

Lecture notes in computer science•Jan 1, 2015•1 citation

On the security of two identity-based conditional proxy re-encryption schemes

Kai He, Jian Weng, Robert Huijie Deng +1 more

Theoretical Computer Science•Sep 9, 2016•8 citations

Identity-Based Proxy Re-encryption Schemes with Multiuse, Unidirection, and CCA Security

Jun Shao, Dongsheng Xing, Zhenfu Cao

•Jan 1, 2008•17 citations

A CCA-Secure Collusion-Resistant Identity-Based Proxy Re-Encryption Scheme

Arinjita Paul, Varshika Srinivasavaradhan, S. Sharmila Deva Selvi +1 more

Lecture notes in computer science•Jan 1, 2018•16 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
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.