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

Science China Information Sciences

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

Jian Weng, Min-Rong Chen, Yanjiang Yang, Robert Huijie Deng, Kefei Chen, Feng Bao

Published Mar 1, 2010• 88 citations
Publisher
DOI
10.1007/s11432-010-0047-3

Related papers

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

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

Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles

Jae Woo Seo, Dae Hyun Yum, Pil Joong Lee

Theoretical Computer Science•Dec 4, 2012•20 citations

A CCA-Secure Identity-Based Conditional Proxy Re-Encryption without Random Oracles

Kaitai Liang, Zhen Liu, Xiao Tan +2 more

Lecture notes in computer science•Jan 1, 2013•54 citations

Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation

Junzuo Lai, Zhengan Huang, Man Ho Au +1 more

Theoretical Computer Science•Sep 16, 2020•14 citations

A Provably-Secure Unidirectional Proxy Re-encryption Scheme Without Pairing in the Random Oracle Model

S. Sharmila Deva Selvi, Arinjita Paul, C. Pandurangan

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