Updatable Encryption Secure against Randomness Compromise

Updatable encryption (UE) allows a thirdparty server to update outsourced encrypted data without exposing keys and plaintexts. The server can update ciphertexts to ones under a new key using an update token provided by the client. UE can realize efficient key rotation and is effective against key compromise. The standard security notions of UE capture the property that even if keys or update tokens are compromised, the confidentiality of messages is maintained by the key update and ciphertext update. In general, the randomnesses used in the encryption and ciphertext update algorithms must be kept secret in the same way as the keys. On the other hand, while key compromise is considered in existing security notions, randomness compromise is not. In this paper, we define a new security notion for UE, IND-UE-R security, that is resilient to the compromise of randomnesses used to generate or update ciphertexts. Furthermore, we prove that the UE construction RISE (EUROCRYPT'18) satisfies our proposed security notion.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2025-09-29
DOI
https://doi.org/10.1587/transfun.2025cip0020
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Updatable Encryption Secure against Randomness Compromise

Takahiro Matsuda, Ryu Ishii, K. Matsuura, Yuichi Tanishita et al.
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Cryptography and Data Security
article

Updatable Encryption Secure against Randomness Compromise

Takahiro Matsuda, Ryu Ishii, K. Matsuura, Yuichi Tanishita, Ryuya Hayashi
article en

Abstract

Updatable encryption (UE) allows a thirdparty server to update outsourced encrypted data without exposing keys and plaintexts. The server can update ciphertexts to ones under a new key using an update token provided by the client. UE can realize efficient key rotation and is effective against key compromise. The standard security notions of UE capture the property that even if keys or update tokens are compromised, the confidentiality of messages is maintained by the key update and ciphertext update. In general, the randomnesses used in the encryption and ciphertext update algorithms must be kept secret in the same way as the keys. On the other hand, while key compromise is considered in existing security notions, randomness compromise is not. In this paper, we define a new security notion for UE, IND-UE-R security, that is resilient to the compromise of randomnesses used to generate or update ciphertexts. Furthermore, we prove that the UE construction RISE (EUROCRYPT'18) satisfies our proposed security notion.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E109.A(3)
Deloitte (United Kingdom) (GB), National Institute of Advanced Industrial Science and Technology (JP), The University of Tokyo (JP)
Japan Society for the Promotion of Science, Core Research for Evolutional Science and Technology
Openalex Percentile: Top 86%
Cryptography and Data Security
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.

Updatable Encryption Secure against Randomness Compromise — Takahiro Matsuda, Ryu Ishii, et al. · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences (2025) | TGRS Research Map | TGRS