Abstract
There are encryption schemes called searchable encryption which enable keyword searches. Traditional symmetric ones support only full keyword matches. Therefore, both a data owner and data searcher have to enumerate all possible keywords to realize a variety of searches. It causes increases of data size and run time.We propose searchable symmetric encryption which can check characters in the specified position as we perform search on plaintexts. Our scheme realizes a variety of searches such as fuzzy keyword search, wildcard search, and so on.
| Original language | English |
|---|---|
| Title of host publication | Provable Security - 6th International Conference, ProvSec 2012, Proceedings |
| Pages | 235-252 |
| Number of pages | 18 |
| DOIs | |
| Publication status | Published - Sep 14 2012 |
| Event | 6th International Conference on Provable Security, ProvSec 2012 - Chengdu, China Duration: Sep 26 2012 → Sep 28 2012 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7496 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 6th International Conference on Provable Security, ProvSec 2012 |
|---|---|
| Country | China |
| City | Chengdu |
| Period | 9/26/12 → 9/28/12 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Secure keyword search using bloom filter with specified character positions. / Suga, Takanori; Nishide, Takashi; Sakurai, Kouichi.
Provable Security - 6th International Conference, ProvSec 2012, Proceedings. 2012. p. 235-252 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7496 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Secure keyword search using bloom filter with specified character positions
AU - Suga, Takanori
AU - Nishide, Takashi
AU - Sakurai, Kouichi
PY - 2012/9/14
Y1 - 2012/9/14
N2 - There are encryption schemes called searchable encryption which enable keyword searches. Traditional symmetric ones support only full keyword matches. Therefore, both a data owner and data searcher have to enumerate all possible keywords to realize a variety of searches. It causes increases of data size and run time.We propose searchable symmetric encryption which can check characters in the specified position as we perform search on plaintexts. Our scheme realizes a variety of searches such as fuzzy keyword search, wildcard search, and so on.
AB - There are encryption schemes called searchable encryption which enable keyword searches. Traditional symmetric ones support only full keyword matches. Therefore, both a data owner and data searcher have to enumerate all possible keywords to realize a variety of searches. It causes increases of data size and run time.We propose searchable symmetric encryption which can check characters in the specified position as we perform search on plaintexts. Our scheme realizes a variety of searches such as fuzzy keyword search, wildcard search, and so on.
UR - http://www.scopus.com/inward/record.url?scp=84866039014&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84866039014&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-33272-2_15
DO - 10.1007/978-3-642-33272-2_15
M3 - Conference contribution
AN - SCOPUS:84866039014
SN - 9783642332715
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 235
EP - 252
BT - Provable Security - 6th International Conference, ProvSec 2012, Proceedings
ER -