Constructing PEKS schemes secure against keyword guessing attacks is possible?

Ik Rae Jeong, Jeong Ok Kwon, Dowon Hong, Dong Hoon Lee

Research output: Contribution to journalArticle

80 Citations (Scopus)

Abstract

Byun et al. suggested keyword guessing attacks and showed that some PEKS (public-key encryption with keyword search) schemes are not secure to keyword guessing attacks, when the number of possible keywords is bounded by some polynomial. Abdalla et al. showed that robust PEKS schemes should satisfy consistency which ensures the PEKS schemes fulfil their functions. In the paper, we show a negative result about the open problem to construct secure PEKS schemes against keyword guessing attacks. Our result shows that consistency implies insecurity to keyword guessing attacks in PEKS. This means that constructing secure and consistent PEKS schemes against keyword guessing attacks is impossible, when the number of possible keywords is bounded by some polynomial.

Original languageEnglish
Pages (from-to)394-396
Number of pages3
JournalComputer Communications
Volume32
Issue number2
DOIs
Publication statusPublished - 2009 Feb 12

Keywords

  • Consistency
  • Keyword guessing attack
  • Keyword search
  • Searchable encryption

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Constructing PEKS schemes secure against keyword guessing attacks is possible?'. Together they form a unique fingerprint.

  • Cite this