Searchable Encryption with Keyword-Recoverability
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jeong, Ik Rae | - |
dc.contributor.author | Kwon, Jeong Ok | - |
dc.contributor.author | Hong, Dowon | - |
dc.contributor.author | Lee, Dong Hoon | - |
dc.date.accessioned | 2021-09-08T17:27:08Z | - |
dc.date.available | 2021-09-08T17:27:08Z | - |
dc.date.created | 2021-06-10 | - |
dc.date.issued | 2009-05 | - |
dc.identifier.issn | 0916-8532 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/120091 | - |
dc.description.abstract | Searchable encryption has many applications including e-mail systems and storage systems. The usefulness of searchable encryption derives from its support of keyword-testability. Keyword-testability means that a receiver of a ciphertext can test whether the ciphertext contains a specific keyword. Recently, Bellare et al. suggested an efficiently-searchable encryption scheme with keyword-recoverability as well as keyword-testability. Keyword-recoverability means that a receiver can extract the keyword from a ciphertext. All of the previous searchable encryption schemes have provided only keyword-testability. However, as explained by Bellare et al., no efficiently-search able encryption scheme can provide even security against chosen keyword attacks. That is, Bellare et al.'s scheme assumes that no useful partial information about the keyword is known to the adversaries. In this paper, we suggest an SEKR (searchable encryption with keyword-recoverability) scheme which is secure even if the adversaries have any useful partial information about the keyword. Our scheme provides security against chosen ciphertext attacks which are stronger attacks than chosen keyword attacks. We also suggest an SEKR scheme for multi-keywords. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.subject | PUBLIC-KEY ENCRYPTION | - |
dc.title | Searchable Encryption with Keyword-Recoverability | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jeong, Ik Rae | - |
dc.contributor.affiliatedAuthor | Lee, Dong Hoon | - |
dc.identifier.doi | 10.1587/transinf.E92.D.1200 | - |
dc.identifier.scopusid | 2-s2.0-77950317505 | - |
dc.identifier.wosid | 000266425700047 | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E92D, no.5, pp.1200 - 1203 | - |
dc.relation.isPartOf | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | - |
dc.citation.title | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | - |
dc.citation.volume | E92D | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 1200 | - |
dc.citation.endPage | 1203 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | PUBLIC-KEY ENCRYPTION | - |
dc.subject.keywordAuthor | keyword search | - |
dc.subject.keywordAuthor | keyword-testability | - |
dc.subject.keywordAuthor | keyword-recoverability | - |
dc.subject.keywordAuthor | data-recoverability | - |
dc.subject.keywordAuthor | chosen ciphertext attacks | - |
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.