There are encryption schemes called searchable encryption schemes.
We can prove the security of these schemes based on a security model.
However, we face the risk of the frequency analysis in some constructions
because these schemes encrypt the keywords per word in the file as well as itself.
In this attack, we assume an adversary knows the frequency distribution of plaintexts
(i.e., keywords), and an adversary measures the frequency of the ciphertext
and guesses the plaintext by comparing the frequency of the plaintext with it.
In this work, we apply this attack to the existing works and evaluate
the resistance of the searchable encryption to this attack
by considering the difference between the deterministic encryption and the probabilistic encryption,
and the supported types of searches.
5th Mosharaka International Conference on Communications, Computers and Applications (MIC-CCA 2012)
Congress
2012 Global Congress on Communications, Computers and Applications (GC-CCA 2012), 12-14 October 2012, Istanbul, Turkey
Pages
--1
Topics
Internet and Web Security Cryptography and Data Security
ISSN
2227-331X
DOI
BibTeX
@inproceedings{479CCA2012,
title={Weakness of provably secure searchable encryption against frequency analysis},
author={Takanori Suga, and Takashi Nishide, and Kouichi Sakurai},
booktitle={2012 Global Congress on Communications, Computers and Applications (GC-CCA 2012)},
year={2012},
pages={--1},
doi={}},
organization={Mosharaka for Research and Studies}
}
