Abstract
We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa introduced an interesting keyword search scheme called oblivious keyword search by using the notion of oblivious transfer. However, only one keyword can be searched in each query, hence the scheme cannot provide a conjunctive keyword search which finds items containing each of several keywords. In this paper, we firstly design a conjunctive keyword search by using the oblivious transfer, and present oblivious conjunctive keyword search (for short, OCKS). We prove that OCKS protocol is secure under the intractability of RSA known target inversion problem.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 318-327 |
| Number of pages | 10 |
| Volume | 3786 LNCS |
| Publication status | Published - 2005 Dec 1 |
| Event | 6th International Workshop on Information Security Applications, WISA 2005 - Jeju Island, Korea, Republic of Duration: 2005 Aug 22 → 2005 Aug 24 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 3786 LNCS |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 6th International Workshop on Information Security Applications, WISA 2005 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju Island |
| Period | 05/8/22 → 05/8/24 |
Fingerprint
Keywords
- Anonymity
- Conjunctive Keyword Search
- Oblivious Transfer
- Privacy
- Storage system
ASJC Scopus subject areas
- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science
Cite this
Oblivious conjunctive keyword search. / Rhee, Hyun Sook; Byun, Jin Wook; Lee, Dong Hoon; Lim, Jong In.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3786 LNCS 2005. p. 318-327 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3786 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Oblivious conjunctive keyword search
AU - Rhee, Hyun Sook
AU - Byun, Jin Wook
AU - Lee, Dong Hoon
AU - Lim, Jong In
PY - 2005/12/1
Y1 - 2005/12/1
N2 - We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa introduced an interesting keyword search scheme called oblivious keyword search by using the notion of oblivious transfer. However, only one keyword can be searched in each query, hence the scheme cannot provide a conjunctive keyword search which finds items containing each of several keywords. In this paper, we firstly design a conjunctive keyword search by using the oblivious transfer, and present oblivious conjunctive keyword search (for short, OCKS). We prove that OCKS protocol is secure under the intractability of RSA known target inversion problem.
AB - We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa introduced an interesting keyword search scheme called oblivious keyword search by using the notion of oblivious transfer. However, only one keyword can be searched in each query, hence the scheme cannot provide a conjunctive keyword search which finds items containing each of several keywords. In this paper, we firstly design a conjunctive keyword search by using the oblivious transfer, and present oblivious conjunctive keyword search (for short, OCKS). We prove that OCKS protocol is secure under the intractability of RSA known target inversion problem.
KW - Anonymity
KW - Conjunctive Keyword Search
KW - Oblivious Transfer
KW - Privacy
KW - Storage system
UR - http://www.scopus.com/inward/record.url?scp=33744903955&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33744903955&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33744903955
SN - 3540310126
SN - 9783540310129
VL - 3786 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 318
EP - 327
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -