Submit

Login Login

Register Register

Home / Journals / CMC / Online First / doi:10.32604/cmc.2025.073553
Journal Menu
Special Issues
Table of Content

All issues

Online First

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Open Access

ARTICLE

Evolve and Revoke: A Secure and Efficient Conditional Proxy Re-Encryption Scheme with Ciphertext Evolution

Han-Yu Lin, Tung-Tso Tsai*, Yi-Jia Ye
Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, 202, Taiwan
* Corresponding Author: Tung-Tso Tsai. Email: email
(This article belongs to the Special Issue: Advances in IoT Security: Challenges, Solutions, and Future Applications)

Computers, Materials & Continua https://doi.org/10.32604/cmc.2025.073553

Received 20 September 2025; Accepted 28 November 2025; Published online 04 January 2026

Abstract

Cloud data sharing is an important issue in modern times. To maintain the privacy and confidentiality of data stored in the cloud, encryption is an inevitable process before uploading the data. However, the centralized management and transmission latency of the cloud makes it difficult to support real-time processing and distributed access structures. As a result, fog computing and the Internet of Things (IoT) have emerged as crucial applications. Fog-assisted proxy re-encryption is a commonly adopted technique for sharing cloud ciphertexts. It allows a semi-trusted proxy to transform a data owner’s ciphertext into another re-encrypted ciphertext intended for a data requester, without compromising any information about the original ciphertext. Yet, the user revocation and cloud ciphertext renewal problems still lack effective and secure mechanisms. Motivated by it, we propose a revocable conditional proxy re-encryption scheme offering ciphertext evolution (R-CPRE-CE). In particular, a periodically updated time key is used to revoke the user’s access privileges while an access condition prevents a malicious proxy from re-encrypting unauthorized ciphertext. We also demonstrate that our scheme is provably secure under the notion of indistinguishability against adaptively chosen identity and chosen ciphertext attacks in the random oracle model. Performance analysis shows that our scheme reduces the computation time for a complete data access cycle from an initial query to the final decryption by approximately 47.05% compared to related schemes.

Keywords

Revocable; proxy re-encryption; conditional access control; ciphertext evolution; fog computing

  • 228

    View

  • 49

    Download

  • 0

    Like

Related articles
Copyright© 2026 Tech Science Press
© 1997-2026 TSP (Henderson, USA) unless otherwise stated

Share Link