A Pairing-Free Identity-Based Broadcast Proxy Re-Encryption Scheme for the Cloud

In cloud computing environments, the data owner typically chooses to encrypt his data before storing it on cloud servers. When multiple users request access to the data owner’s information, the cloud server can utilize broadcast proxy re-encryption technology to convert the data owner’s original ciphertext into new ciphertexts for these users to decrypt. Most existing broadcast proxy re-encryption schemes rely on bilinear pairings and hash-to-point operations, which reduce computational efficiency and are impractical for resource-constrained proxy servers. To address this issue, we propose an identity-based broadcast proxy re-encryption scheme that eliminates these complex operations, thereby reducing computational complexity and implementation costs. This scheme can resist chosen-ciphertext attacks and collusion attacks in the random oracle model(ROM). Analysis results show that the proposed scheme maintains security while achieving high computational efficiency.

Authors

Institutions

Publication Details

Published
2024-09-13
DOI
https://doi.org/10.1109/itme63426.2024.00109
Citations
1
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Pairing-Free Identity-Based Broadcast Proxy Re-Encryption Scheme for the Cloud

Lunzhi Deng, Binhan Li, Yiming Mou
1 citations
Cryptography and Data Security
0.35
article

A Pairing-Free Identity-Based Broadcast Proxy Re-Encryption Scheme for the Cloud

Lunzhi Deng, Binhan Li, Yiming Mou
article en
1 citations

Abstract

In cloud computing environments, the data owner typically chooses to encrypt his data before storing it on cloud servers. When multiple users request access to the data owner’s information, the cloud server can utilize broadcast proxy re-encryption technology to convert the data owner’s original ciphertext into new ciphertexts for these users to decrypt. Most existing broadcast proxy re-encryption schemes rely on bilinear pairings and hash-to-point operations, which reduce computational efficiency and are impractical for resource-constrained proxy servers. To address this issue, we propose an identity-based broadcast proxy re-encryption scheme that eliminates these complex operations, thereby reducing computational complexity and implementation costs. This scheme can resist chosen-ciphertext attacks and collusion attacks in the random oracle model(ROM). Analysis results show that the proposed scheme maintains security while achieving high computational efficiency.

Guizhou Normal University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 29%
Cryptography and Data Security
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.