An Unconditionally Secure and Non-malleable Encryption Scheme for Cloud Storage

We consider a system consisting of a user and a public cloud storage provider. We provide an unconditionally secure and non-malleable encryption scheme for storing the confidential data of the user on the public cloud storage. More specifically, we show that the proposed scheme provides: i) semantic security against an all-powerful adversary, i.e., with unbounded computational power who has complete access to the communication line, and ii) ciphertext integrity against the all-powerful adversary. To provide the scheme, we use the Encrypt-then-MAC approach, and it is implemented by exploiting finite group modular addition. As an illustrative example, according to the proposed scheme, by using around 46.4 Terabytes (TBs) of secret bits, a user can store around 1.96 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">8</sup> TBs of data on public storage with guaranteed everlasting security.

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1109/ieeeconf60004.2024.10942690
Primary Topic
Cloud Data Security Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Unconditionally Secure and Non-malleable Encryption Scheme for Cloud Storage

Hamid R. Sadjadpour, Zouheir Rezki, Mohammad Moltafet
Cloud Data Security Solutions
article

An Unconditionally Secure and Non-malleable Encryption Scheme for Cloud Storage

Hamid R. Sadjadpour, Zouheir Rezki, Mohammad Moltafet
article en

Abstract

We consider a system consisting of a user and a public cloud storage provider. We provide an unconditionally secure and non-malleable encryption scheme for storing the confidential data of the user on the public cloud storage. More specifically, we show that the proposed scheme provides: i) semantic security against an all-powerful adversary, i.e., with unbounded computational power who has complete access to the communication line, and ii) ciphertext integrity against the all-powerful adversary. To provide the scheme, we use the Encrypt-then-MAC approach, and it is implemented by exploiting finite group modular addition. As an illustrative example, according to the proposed scheme, by using around 46.4 Terabytes (TBs) of secret bits, a user can store around 1.96 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">8</sup> TBs of data on public storage with guaranteed everlasting security.

University of California, Santa Cruz (US)
Openalex Percentile: Top 54%
Cloud Data Security Solutions
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.