Abstract
Searchable encryption has many applications including email 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 efficientlysearchable 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-searchable 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1200-1203 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E92-D |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2009 Dec 1 |
Fingerprint
Keywords
- Chosen ciphertext attacks
- Data-recoverability
- Keyword search
- Keyword-recoverability
- Keyword-testability
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Software
- Artificial Intelligence
- Hardware and Architecture
- Computer Vision and Pattern Recognition
Cite this
Searchable encryption with keyword-recoverability. / Jeong, ik rae; Kwon, Jeong Ok; Hong, Dowon; Lee, Dong Hoon.
In: IEICE Transactions on Information and Systems, Vol. E92-D, No. 5, 01.12.2009, p. 1200-1203.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Searchable encryption with keyword-recoverability
AU - Jeong, ik rae
AU - Kwon, Jeong Ok
AU - Hong, Dowon
AU - Lee, Dong Hoon
PY - 2009/12/1
Y1 - 2009/12/1
N2 - Searchable encryption has many applications including email 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 efficientlysearchable 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-searchable 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.
AB - Searchable encryption has many applications including email 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 efficientlysearchable 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-searchable 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.
KW - Chosen ciphertext attacks
KW - Data-recoverability
KW - Keyword search
KW - Keyword-recoverability
KW - Keyword-testability
UR - http://www.scopus.com/inward/record.url?scp=77950317505&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77950317505&partnerID=8YFLogxK
U2 - 10.1587/transinf.E92.D.1200
DO - 10.1587/transinf.E92.D.1200
M3 - Article
AN - SCOPUS:77950317505
VL - E92-D
SP - 1200
EP - 1203
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
SN - 0916-8532
IS - 5
ER -