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

Lecture notes in computer science

Cloud-Based Data-Sharing Scheme Using Verifiable and CCA-Secure Re-encryption from Indistinguishability Obfuscation

Mingwu Zhang, Yan Jiang, Hua Shen, Bingbing Li, Willy Susilo

Published Jan 1, 2019• 3 citations
Publisher
DOI
10.1007/978-3-030-14234-6_13

Related papers

Efficient Multi-receiver Certificate-Based Proxy Re-encryption Scheme for Secure Cloud Data Sharing

Jinmei Tian, Yang Lu, Fen Wang +1 more

Communications in computer and information science•Jan 1, 2021•5 citations

Fully Secure Secret-sharing Schemes Using Indistinguishability Obfuscation

Hui Min Zhao, Kouichi Sakurai

IEICE Technical Report; IEICE Tech. Rep.•Jul 7, 2016•0 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

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

Jun Shao, Dongsheng Xing, Zhenfu Cao

•Jan 1, 2008•17 citations

Improved functional proxy re-encryption schemes for secure cloud data sharing

Xu An Wang, Xiaoyuan Yang, Cong Li +2 more

Recently Liang et al. propose an interesting privacy-preserving ciphertext multi-sharing control for big data storage mechanism, which is based on the cryptographic primitive of anonymous multi-hop identity based conditional proxy re-encryption scheme AMH-IBCPRE. They propose a concrete AMH-IBCPRE scheme and conclude their scheme can achieve IND-sCon-sID-CCA secure (indistinguishable secure under selectively conditional selectively identity chosen ciphertext attack). However, our research show their scheme can not be IND-sConsID- CCA secure for single-hop and multi-hop data sharing. Also in 2014, Liang et al. propose an interesting deterministic finite automata-based functional proxy reencryption scheme DFA-based FPRE for secure public cloud data sharing, they also conclude their scheme can achieve IND-CCA secure (indistinguishable secure under chosen ciphertext attack), we also show their scheme can not be IND-CCA secure either. For these two proposals, the main reason of insecurity is that part of the re-encryption key has the same structure as the valid ciphertext, thus the adversary can query on the decryption oracle with this part of the re-encryption key to get secret keys, which will break the CCA-security of their scheme.We give an improved AMH-IBCPRE scheme and an improved DFA-based FPRE scheme for cloud data sharing and show the new schemes can resist our attack and be CCA-secure.We also demonstrate our improved AMH-IBCPRE scheme?s efficiency compared with other related identity based proxy re-encryption schemes, the results show our scheme is almost the most efficient one.

Computer Science and Information Systems•Jan 1, 2018•13 citations

Efficient Leakage-Resilient Identity-Based Encryption with CCA Security

Shi-Feng Sun, Dawu Gu, Shengli Liu

Lecture notes in computer science•Jan 1, 2014•20 citations
Recently Liang et al. propose an interesting privacy-preserving ciphertext multi-sharing control for big data storage mechanism, which is based on the cryptographic primitive of anonymous multi-hop identity based conditional proxy re-encryption scheme AMH-IBCPRE. They propose a concrete AMH-IBCPRE scheme and conclude their scheme can achieve IND-sCon-sID-CCA secure (indistinguishable secure under selectively conditional selectively identity chosen ciphertext attack). However, our research show their scheme can not be IND-sConsID- CCA secure for single-hop and multi-hop data sharing. Also in 2014, Liang et al. propose an interesting deterministic finite automata-based functional proxy reencryption scheme DFA-based FPRE for secure public cloud data sharing, they also conclude their scheme can achieve IND-CCA secure (indistinguishable secure under chosen ciphertext attack), we also show their scheme can not be IND-CCA secure either. For these two proposals, the main reason of insecurity is that part of the re-encryption key has the same structure as the valid ciphertext, thus the adversary can query on the decryption oracle with this part of the re-encryption key to get secret keys, which will break the CCA-security of their scheme.We give an improved AMH-IBCPRE scheme and an improved DFA-based FPRE scheme for cloud data sharing and show the new schemes can resist our attack and be CCA-secure.We also demonstrate our improved AMH-IBCPRE scheme?s efficiency compared with other related identity based proxy re-encryption schemes, the results show our scheme is almost the most efficient one.