Journal
COMPUTER COMMUNICATIONS
Volume 32, Issue 2, Pages 394-396Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.comcom.2008.11.018
Keywords
Keyword search; Searchable encryption; Keyword guessing attack; Consistency
Categories
Funding
- Korea University
- IT R&D program of MIC/IITA [2005-Y001-04]
- Korea Evaluation Institute of Industrial Technology (KEIT) [2005-Y-001-05] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
- National IT Industry Promotion Agency (NIPA), Republic of Korea [2005-Y-001] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
- National Research Foundation of Korea [과C6A2502] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
Ask authors/readers for more resources
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. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
