.png){kind=icon}
返回
A randomized encryption deduplication method against frequency attack
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jisa.2024.103774.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Encryption deduplication technology first encrypts the file or chunks of data, then detects and removes duplicate ciphertexts, storing only one copy on the cloud storage server (CSP). Although traditional encryption deduplication schemes have the function of ciphertext deduplication, they also have a serious problem. Since the key generation algorithm and the encryption algorithm are deterministic, the frequency of plaintext chunking will be leaked. It is possible for the attacker to infer the information of the plaintext. We propose a Randomized Encryption deduplication method against Frequency Attack (REFA) that provides high randomness in ciphertexts. The core idea of REFA is that after obtaining a convergence key generated with the aid of a key server, the user randomizes the convergence key with a random value of the same length. Then, REFA encrypts the plaintext chunk with a randomized key. Our scheme hides the random value in the ciphertext and encrypts the convergence key for user ownership verification. REFA perfectly masks the frequency of plaintext chunks and has high storage efficiency and data security. Furthermore, the CSP performs ciphertext updates with ciphertexts uploaded by subsequent users. REFA can effectively protect against frequency analysis attacks.
Keyword:
Encrypted deduplication
Cloud storage
Frequency analysis
期刊
IF:
3.7
论文数:
2.0K
被引数:
4.9K
机构
引用论文
Enterohemorrhagic Escherichia coli as causes of hemolytic uremic syndrome in the Czech Republic.肠出血性大肠杆菌Escherichia coli作为捷克共和国溶血尿毒综合征的病因。.png)
IF0
PREAI
分享收藏
查看更多内容