Constructing PEKS schemes secure against keyword guessing attacks is possible?
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, I.R. | - |
dc.contributor.author | Kwon, J.O. | - |
dc.contributor.author | Hong, D. | - |
dc.contributor.author | Lee, D.H. | - |
dc.date.accessioned | 2021-09-09T00:14:37Z | - |
dc.date.available | 2021-09-09T00:14:37Z | - |
dc.date.created | 2021-06-17 | - |
dc.date.issued | 2009 | - |
dc.identifier.issn | 0140-3664 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/121856 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.subject | Online searching | - |
dc.subject | Polynomial approximation | - |
dc.subject | Consistency | - |
dc.subject | Keyword guessing attack | - |
dc.subject | Keyword search | - |
dc.subject | Open problems | - |
dc.subject | Searchable encryption | - |
dc.subject | Cryptography | - |
dc.title | Constructing PEKS schemes secure against keyword guessing attacks is possible? | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jeong, I.R. | - |
dc.contributor.affiliatedAuthor | Lee, D.H. | - |
dc.identifier.doi | 10.1016/j.comcom.2008.11.018 | - |
dc.identifier.scopusid | 2-s2.0-58249100325 | - |
dc.identifier.bibliographicCitation | Computer Communications, v.32, no.2, pp.394 - 396 | - |
dc.relation.isPartOf | Computer Communications | - |
dc.citation.title | Computer Communications | - |
dc.citation.volume | 32 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 394 | - |
dc.citation.endPage | 396 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Online searching | - |
dc.subject.keywordPlus | Polynomial approximation | - |
dc.subject.keywordPlus | Consistency | - |
dc.subject.keywordPlus | Keyword guessing attack | - |
dc.subject.keywordPlus | Keyword search | - |
dc.subject.keywordPlus | Open problems | - |
dc.subject.keywordPlus | Searchable encryption | - |
dc.subject.keywordPlus | Cryptography | - |
dc.subject.keywordAuthor | Consistency | - |
dc.subject.keywordAuthor | Keyword guessing attack | - |
dc.subject.keywordAuthor | Keyword search | - |
dc.subject.keywordAuthor | Searchable encryption | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.