### 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 language | English |
---|---|

Title of host publication | Proceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012 |

Pages | 142-147 |

Number of pages | 6 |

Publication status | Published - Dec 1 2012 |

Event | 5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012 - Istanbul, Turkey Duration: Oct 12 2012 → Oct 14 2012 |

### Publication series

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

### Other

Other | 5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012 |
---|---|

Country | Turkey |

City | Istanbul |

Period | 10/12/12 → 10/14/12 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Artificial Intelligence
- Computer Science Applications

### Cite this

*Proceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012*(pp. 142-147). [6516798] (Proceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012).

**Weakness of provably secure searchable encryption against frequency analysis.** / Suga, Takanori; Nishide, Takashi; Sakurai, Kouichi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012.*, 6516798, Proceedings of the 5th International Conference on Communications, Computers and Applications, MIC-CCA 2012, pp. 142-147, 5th Mosharaka International Conference on Communications, Computers and Applications, MIC-CCA 2012, Istanbul, Turkey, 10/12/12.

}

TY - GEN

T1 - Weakness of provably secure searchable encryption against frequency analysis

AU - Suga, Takanori

AU - Nishide, Takashi

AU - Sakurai, Kouichi

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84879295958&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879295958&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84879295958

SN - 9781938302077

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

SP - 142

EP - 147

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

ER -