Weakness of provably secure searchable encryption against frequency analysis

Takanori Suga, Takashi Nishide, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012
Pages142-147
Number of pages6
Publication statusPublished - Dec 1 2012
Event5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012 - Istanbul, Turkey
Duration: Oct 12 2012Oct 14 2012

Publication series

NameProceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012

Other

Other5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012
Country/TerritoryTurkey
CityIstanbul
Period10/12/1210/14/12

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Weakness of provably secure searchable encryption against frequency analysis'. Together they form a unique fingerprint.

Cite this