Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Constructing PEKS schemes secure against keyword guessing attacks is possible?
- Authors
- Jeong, I.R.; Kwon, J.O.; Hong, D.; Lee, D.H.
- Issue Date
- 2009
- Keywords
- Consistency; Keyword guessing attack; Keyword search; Searchable encryption
- Citation
- Computer Communications, v.32, no.2, pp.394 - 396
- Indexed
- SCOPUS
- Journal Title
- Computer Communications
- Volume
- 32
- Number
- 2
- Start Page
- 394
- End Page
- 396
- ISSN
- 0140-3664
- 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. © 2008 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.