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

72 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

Fingerprint

Cryptography
Polynomials

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Constructing PEKS schemes secure against keyword guessing attacks is possible? / Jeong, ik rae; Kwon, Jeong Ok; Hong, Dowon; Lee, Dong Hoon.

In: Computer Communications, Vol. 32, No. 2, 12.02.2009, p. 394-396.

Research output: Contribution to journalArticle

@article{6f81efc5756d4e3599384c10cc2f98ed,
title = "Constructing PEKS schemes secure against keyword guessing attacks is possible?",
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.",
keywords = "Consistency, Keyword guessing attack, Keyword search, Searchable encryption",
author = "Jeong, {ik rae} and Kwon, {Jeong Ok} and Dowon Hong and Lee, {Dong Hoon}",
year = "2009",
month = "2",
day = "12",
doi = "10.1016/j.comcom.2008.11.018",
language = "English",
volume = "32",
pages = "394--396",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Constructing PEKS schemes secure against keyword guessing attacks is possible?

AU - Jeong, ik rae

AU - Kwon, Jeong Ok

AU - Hong, Dowon

AU - Lee, Dong Hoon

PY - 2009/2/12

Y1 - 2009/2/12

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

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

KW - Consistency

KW - Keyword guessing attack

KW - Keyword search

KW - Searchable encryption

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

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

U2 - 10.1016/j.comcom.2008.11.018

DO - 10.1016/j.comcom.2008.11.018

M3 - Article

AN - SCOPUS:58249100325

VL - 32

SP - 394

EP - 396

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 2

ER -