Delegating Decryption Rights via Proxy Re-encryption

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 268 papers95 conceptsfrozen 2026-10-04

In traditional cryptography, encryption is a locked box. If Alice wants to share a secret with Bob, she must either encrypt it with Bob’s public key from the start or decrypt her own copy and re-encrypt it for him. This creates a bottleneck: in a world of massive cloud storage and real-time streaming, Alice (the data owner) shouldn't have to be online or expend massive bandwidth every time a new user needs access.

The research direction of Proxy Re-encryption (PRE) solves this by introducing a semi-trusted intermediary—a "proxy"—that can transform a ciphertext intended for Alice into one that Bob can decrypt. Crucially, the proxy performs this transformation without ever seeing the underlying plaintext or Alice’s private keys.

The Intuition of Ciphertext Transformation

The core mechanism of PRE relies on a special cryptographic token called a re-encryption key ($rk_{A \to B}$). Alice generates this token using her private key and Bob’s public key. When the proxy receives a ciphertext encrypted for Alice, it applies this token to "shift" the mathematical structure of the ciphertext into Bob’s key space.

As Giuseppe Ateniese and Matthew Green demonstrated in Identity-Based Proxy Re-encryption, this can be done using identity-based strings (like email addresses), allowing Alice to delegate rights to Bob even if Bob hasn't generated a traditional key pair yet. The proxy acts as a blind translator, facilitating the handoff without gaining any knowledge of the conversation.

Unidirectionality and Security Guarantees

A critical challenge in PRE is ensuring the proxy doesn't overstep its bounds. Early schemes were often "bidirectional," meaning if a proxy could transform Alice’s data for Bob, it could also transform Bob’s data for Alice. Modern research focuses on unidirectional schemes, where the delegation is strictly one-way.

To make these systems robust for real-world use, researchers like Jun Shao and Peng Liu have developed CCA-secure PRE schemes. These ensure that even if an attacker can manipulate ciphertexts, they cannot glean information about the underlying messages. Furthermore, Yi Jun He and colleagues introduced non-transferable schemes in Non-Transferable Proxy Re-Encryption Scheme for Data Dissemination Control, which prevent a proxy and a malicious delegatee from colluding to re-delegate access to unauthorized third parties.

Key Rotation and Cloud Maintenance

PRE is not just about sharing; it is a powerful tool for data maintenance. In cloud environments, security best practices require periodic key rotation. Normally, rotating a key requires downloading the data, decrypting it, re-encrypting it with a new key, and re-uploading it—a nightmare for Big Data.

By using updatable encryption, a concept explored by Kevin Lewi and Ananth Raghunathan in Key Homomorphic PRFs and Their Applications, the data owner can simply send a re-encryption token to the cloud. The cloud then "rotates" the stored ciphertexts in place. This same logic applies to revocation: if a user’s access is canceled, the system can use PRE to update the data to a new key that the revoked user does not possess, as detailed in the work of Saiyu Qi and Mo Li regarding RFID supply chains.

Unifying Data for Secure Analytics

One of the most ambitious applications of PRE is in multi-user analytics. Imagine several hospitals want to perform a joint study on patient data, but each hospital has encrypted its records with a different key. A central server cannot analyze this "mismatch" of ciphertexts.

Researchers like Yanling Li have proposed ciphertext unification mechanisms that use PRE to transform data from multiple distinct sources into a single, unified key space. Once unified, homomorphic operations can be performed on the collective dataset. This allows for complex tasks like $k$-means clustering or genomic susceptibility testing—as proposed by Erman Ayday and Jean-Pierre Hubaux in Towards Quantifying and Preventing the Leakage of Genomic Data—without the central server ever seeing the raw, sensitive information.

Secure Deduplication

Finally, PRE addresses the conflict between privacy and storage efficiency. Cloud providers use deduplication to save space by only storing one copy of a file uploaded by multiple users. However, if every user encrypts their file with a unique key, the files look different, and deduplication fails.

In Secure Deduplication of Encrypted Data, Jian Liu and N. Asokan describe how PRE can be used to "blindly" transform a new uploader's ciphertext to match an existing one. This allows the server to recognize duplicate content and manage keys securely without learning what the file actually contains.

Papers in this version

Showing 60 of 68 papers.

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 73 papers
  2. Version 1 · 2026-10-04 · 68 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_proxy_re_encryption_2b394c94,
  title = {proxy re-encryption},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/proxy-re-encryption/rdr_2b394c94d2e44454a9dbdebe8f1ac67f},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_delegating_decryption_rights_via_proxy_r_2b394c94_v1,
  title = {Delegating Decryption Rights via Proxy Re-encryption},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/delegating-decryption-rights-via-proxy-re-encryption/rdr_2b394c94d2e44454a9dbdebe8f1ac67f/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}