Efficient Key-Aggregate Proxy Re-Encryption for Secure Data Sharing in Clouds

  title={Efficient Key-Aggregate Proxy Re-Encryption for Secure Data Sharing in Clouds},
  author={Wei-Hao Chen and Chun-I Fan and Yi-Fan Tseng},
  journal={2018 IEEE Conference on Dependable and Secure Computing (DSC)},
Cloud computing undoubtedly is the most unparalleled technique in rapidly developing industries. Protecting sensitive files stored in the clouds from being accessed by malicious attackers is essential to the success of the clouds. In proxy re-encryption schemes, users delegate their encrypted files to other users by using re-encryption keys, which elegantly transfers the users' burden to the cloud servers. Moreover, one can adopt conditional proxy re-encryption schemes to employ their access… 

Figures and Tables from this paper

Key-Aggregate Proxy Re-Encryption with Dynamic Condition Generation Using Multilinear Map

The multilinear maps are applied to the key-aggregate proxy re-encryption to extend the number of conditions to be exponentially large, while keeping the size of public parameters small and practical.


This paper proposes a Mutual User Authentication Protocol (MUAP) in which the users can safely share their data in a suspicious cloud servers and provides assurance on data over user security and focussed mainly on data sharing among the users by an encrypted way.

Re-Encryption Model for Multi-Block Data Updates in Network Security

  • D. KLeena Jenifer L
  • Computer Science
    2022 International Conference on Applied Artificial Intelligence and Computing (ICAAIC)
  • 2022
A safe cloud cache solution, AES-UCODR, is proposed to decrease I/O overheads for multi-block updates in proxy re-encryption systems and its competence is evaluated using the real-world finance sector.

An Improved ID-Based Data Storage Scheme for Fog-Enabled IoT Environments

An improved variant of this protocol is presented, which not only eliminates their security weaknesses, but also preserves the functionalities of anonymous key generation and user revocation mechanism and is also provably secure in the security notion of IND-PrID-CPA.

Cloud Data Security in Multi Model Attributes For Randomized Key Service Using Encryption Techniques

An efficient Service LevelAttributeBasedEncryption (SLABE) scheme is presented and a multi attribute randomized key Service Level Encryption (MARK-SLE) scheme has been presented to improve the security performance.

BCSolid: A Blockchain-Based Decentralized Data Storage and Authentication Scheme for Solid

A blockchain-based decentralized data storage and authentication scheme for Solid, termed BCSolid, in which a user’s data can be independent of multiple web applications and can switch data storage service easily without relying on a trusted third party is proposed.

Synthesizing Privacy Preserving Traces: Enhancing Plausibility With Social Networks

The main idea is to credibly imitate the temporal, spatial, and social behavior of users’ mobility, sample the traces that exhibit similar three-dimension mobility behavior, and synthesize traces using the sampled locations to provide "differential privacy" on location privacy preservation.

An Analysis on Data Sharing for Effective Health Monitoring in Internet of Things

The practice described in the article aims to provide end-users with important understanding into in-depth physical layer set-up with relieve from complicated and varied nature of monitoring devices via reducing the shared infrastructure to a single representative source for accessibility.



Key-Private Proxy Re-encryption

This work proposes the first key-private PRE construction and proves its CPA-security under a simple extension of Decisional Bilinear Diffie Hellman assumption and its key-privacy under the Decision Linear assumption in the standard model.

Conditional Proxy Broadcast Re-Encryption

This paper introduces a more generalized notion of conditional proxy broadcast re-encryption (CPBRE), and proposes a basic CPBRE scheme secure against chosen-plaintext attacks, and its extension which is secure against replayable chosen-ciphertext attacks (RCCA).

Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage

New public-key cryptosystems that produce constant-size ciphertexts such that efficient delegation of decryption rights for any set of ciphertextS are possible are described, giving the first public-keys patient-controlled encryption for flexible hierarchy.

Chosen-Ciphertext Secure Proxy Re-encryption without Pairings

A new proxy re-encryption scheme without resort to bilinear pairings is proposed, and the chosen-ciphertext security of the proposed scheme is proved in the random oracle model.

Chosen-ciphertext secure proxy re-encryption

This work proposes a definition of security against chosen ciphertext attacks for PRE schemes, and presents a scheme that satisfies the definition and formally captures CCA security for PRE scheme via both a game-based definition and simulation-based definitions that guarantee universally composable security.

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

A new unidirectional single-hop Identity-Based Conditional Proxy Re-Encryption (IBCPRE) scheme that not only captures the property of IBPRE, but also supports conditional re-encryption and can be proved secure against adaptive condition and adaptive identity chosen-ciphertext attacks in the standard model.

Identity-Based Proxy Re-encryption

This paper addresses the problem of Identity-Based proxy re-encryption, where ciphertexts are transformed from one identity to another, and develops two schemes that are compatible with current IBE deployments and do not require any extra work from the IBE trusted-party key generator.

Conditional proxy re-encryption secure against chosen-ciphertext attack

This work formalizes its security model and proposes an efficient C-PRE scheme, whose chosen-ciphertext security is proven under the 3-quotient bilinear Diffie-Hellman assumption.

Anonymous Conditional Proxy Re-encryption without Random Oracle

This paper answers the question posed by Weng et al. affirmatively by presenting a new and efficient construction of anonymous conditional proxy re-encryption (C-PRE) scheme without requiring random oracle.

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

This work proposes a new unidirectional proxy re-encryption scheme, and proves its chosen-ciphertext security in the adaptive corruption model without random oracles, and enjoys the advantages of both higher efficiency and stronger security.